17.67/8.14 YES 17.67/8.14 17.67/8.14 Ultimate: Cannot open display: 17.67/8.14 This is Ultimate 0.1.24-8dc7c08-m 17.67/8.14 [2019-03-28 12:02:31,401 INFO L170 SettingsManager]: Resetting all preferences to default values... 17.67/8.14 [2019-03-28 12:02:31,403 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 17.67/8.14 [2019-03-28 12:02:31,414 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 17.67/8.14 [2019-03-28 12:02:31,415 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 17.67/8.14 [2019-03-28 12:02:31,415 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 17.67/8.14 [2019-03-28 12:02:31,417 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 17.67/8.14 [2019-03-28 12:02:31,418 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 17.67/8.14 [2019-03-28 12:02:31,420 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 17.67/8.14 [2019-03-28 12:02:31,420 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 17.67/8.14 [2019-03-28 12:02:31,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 17.67/8.14 [2019-03-28 12:02:31,422 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 17.67/8.14 [2019-03-28 12:02:31,422 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 17.67/8.14 [2019-03-28 12:02:31,423 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 17.67/8.14 [2019-03-28 12:02:31,424 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 17.67/8.14 [2019-03-28 12:02:31,425 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 17.67/8.14 [2019-03-28 12:02:31,426 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 17.67/8.14 [2019-03-28 12:02:31,428 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 17.67/8.14 [2019-03-28 12:02:31,429 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 17.67/8.14 [2019-03-28 12:02:31,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 17.67/8.14 [2019-03-28 12:02:31,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 17.67/8.14 [2019-03-28 12:02:31,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 17.67/8.14 [2019-03-28 12:02:31,435 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 17.67/8.14 [2019-03-28 12:02:31,435 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 17.67/8.14 [2019-03-28 12:02:31,436 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 17.67/8.14 [2019-03-28 12:02:31,436 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 17.67/8.14 [2019-03-28 12:02:31,437 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 17.67/8.14 [2019-03-28 12:02:31,438 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 17.67/8.14 [2019-03-28 12:02:31,438 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 17.67/8.14 [2019-03-28 12:02:31,439 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 17.67/8.14 [2019-03-28 12:02:31,439 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 17.67/8.14 [2019-03-28 12:02:31,440 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 17.67/8.14 [2019-03-28 12:02:31,441 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 17.67/8.14 [2019-03-28 12:02:31,441 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 17.67/8.14 [2019-03-28 12:02:31,442 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 17.67/8.14 [2019-03-28 12:02:31,442 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 17.67/8.14 [2019-03-28 12:02:31,442 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 17.67/8.14 [2019-03-28 12:02:31,443 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 17.67/8.14 [2019-03-28 12:02:31,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 17.67/8.14 [2019-03-28 12:02:31,444 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf 17.67/8.14 [2019-03-28 12:02:31,459 INFO L110 SettingsManager]: Loading preferences was successful 17.67/8.14 [2019-03-28 12:02:31,459 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 17.67/8.14 [2019-03-28 12:02:31,460 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 17.67/8.14 [2019-03-28 12:02:31,460 INFO L133 SettingsManager]: * Rewrite not-equals=true 17.67/8.14 [2019-03-28 12:02:31,460 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 17.67/8.14 [2019-03-28 12:02:31,461 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 17.67/8.14 [2019-03-28 12:02:31,461 INFO L133 SettingsManager]: * Use SBE=true 17.67/8.14 [2019-03-28 12:02:31,461 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 17.67/8.14 [2019-03-28 12:02:31,461 INFO L133 SettingsManager]: * Use old map elimination=false 17.67/8.14 [2019-03-28 12:02:31,461 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 17.67/8.14 [2019-03-28 12:02:31,461 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 17.67/8.14 [2019-03-28 12:02:31,462 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 17.67/8.14 [2019-03-28 12:02:31,462 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 17.67/8.14 [2019-03-28 12:02:31,462 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 17.67/8.14 [2019-03-28 12:02:31,462 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:31,462 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 17.67/8.14 [2019-03-28 12:02:31,462 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 17.67/8.14 [2019-03-28 12:02:31,463 INFO L133 SettingsManager]: * Check division by zero=IGNORE 17.67/8.14 [2019-03-28 12:02:31,463 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 17.67/8.14 [2019-03-28 12:02:31,463 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 17.67/8.14 [2019-03-28 12:02:31,463 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 17.67/8.14 [2019-03-28 12:02:31,463 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 17.67/8.14 [2019-03-28 12:02:31,464 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 17.67/8.14 [2019-03-28 12:02:31,464 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 17.67/8.14 [2019-03-28 12:02:31,464 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.67/8.14 [2019-03-28 12:02:31,464 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 17.67/8.14 [2019-03-28 12:02:31,464 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 17.67/8.14 [2019-03-28 12:02:31,464 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 17.67/8.14 [2019-03-28 12:02:31,465 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 17.67/8.14 [2019-03-28 12:02:31,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 17.67/8.14 [2019-03-28 12:02:31,504 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 17.67/8.14 [2019-03-28 12:02:31,508 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 17.67/8.14 [2019-03-28 12:02:31,509 INFO L271 PluginConnector]: Initializing CDTParser... 17.67/8.14 [2019-03-28 12:02:31,510 INFO L276 PluginConnector]: CDTParser initialized 17.67/8.14 [2019-03-28 12:02:31,510 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c 17.67/8.14 [2019-03-28 12:02:31,599 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/72cc0afd4dca4f82b3553085f521c5f1/FLAG22764947b 17.67/8.14 [2019-03-28 12:02:31,936 INFO L307 CDTParser]: Found 1 translation units. 17.67/8.14 [2019-03-28 12:02:31,936 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c 17.67/8.14 [2019-03-28 12:02:31,943 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/72cc0afd4dca4f82b3553085f521c5f1/FLAG22764947b 17.67/8.14 [2019-03-28 12:02:32,339 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/72cc0afd4dca4f82b3553085f521c5f1 17.67/8.14 [2019-03-28 12:02:32,351 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 17.67/8.14 [2019-03-28 12:02:32,352 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 17.67/8.14 [2019-03-28 12:02:32,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 17.67/8.14 [2019-03-28 12:02:32,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 17.67/8.14 [2019-03-28 12:02:32,357 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 17.67/8.14 [2019-03-28 12:02:32,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:02:32" (1/1) ... 17.67/8.14 [2019-03-28 12:02:32,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109eb9d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32, skipping insertion in model container 17.67/8.14 [2019-03-28 12:02:32,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:02:32" (1/1) ... 17.67/8.14 [2019-03-28 12:02:32,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 17.67/8.14 [2019-03-28 12:02:32,386 INFO L176 MainTranslator]: Built tables and reachable declarations 17.67/8.14 [2019-03-28 12:02:32,543 INFO L206 PostProcessor]: Analyzing one entry point: main 17.67/8.14 [2019-03-28 12:02:32,548 INFO L191 MainTranslator]: Completed pre-run 17.67/8.14 [2019-03-28 12:02:32,565 INFO L206 PostProcessor]: Analyzing one entry point: main 17.67/8.14 [2019-03-28 12:02:32,579 INFO L195 MainTranslator]: Completed translation 17.67/8.14 [2019-03-28 12:02:32,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32 WrapperNode 17.67/8.14 [2019-03-28 12:02:32,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 17.67/8.14 [2019-03-28 12:02:32,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 17.67/8.14 [2019-03-28 12:02:32,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 17.67/8.14 [2019-03-28 12:02:32,581 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 17.67/8.14 [2019-03-28 12:02:32,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 17.67/8.14 [2019-03-28 12:02:32,650 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 17.67/8.14 [2019-03-28 12:02:32,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 17.67/8.14 [2019-03-28 12:02:32,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 17.67/8.14 [2019-03-28 12:02:32,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 17.67/8.14 [2019-03-28 12:02:32,670 INFO L276 PluginConnector]: Boogie Preprocessor initialized 17.67/8.14 [2019-03-28 12:02:32,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 17.67/8.14 [2019-03-28 12:02:32,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 17.67/8.14 [2019-03-28 12:02:32,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 17.67/8.14 [2019-03-28 12:02:32,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 17.67/8.14 [2019-03-28 12:02:32,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 17.67/8.14 [2019-03-28 12:02:32,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 17.67/8.14 [2019-03-28 12:02:32,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 17.67/8.14 [2019-03-28 12:02:32,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 17.67/8.14 [2019-03-28 12:02:32,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 17.67/8.14 [2019-03-28 12:02:32,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... 17.67/8.14 [2019-03-28 12:02:32,690 INFO L276 PluginConnector]: RCFGBuilder initialized 17.67/8.14 [2019-03-28 12:02:32,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (1/1) ... 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 17.67/8.14 [2019-03-28 12:02:32,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 17.67/8.14 [2019-03-28 12:02:32,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 17.67/8.14 [2019-03-28 12:02:32,889 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 17.67/8.14 [2019-03-28 12:02:32,889 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 17.67/8.14 [2019-03-28 12:02:32,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:32 BoogieIcfgContainer 17.67/8.14 [2019-03-28 12:02:32,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 17.67/8.14 [2019-03-28 12:02:32,891 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 17.67/8.14 [2019-03-28 12:02:32,891 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 17.67/8.14 [2019-03-28 12:02:32,893 INFO L276 PluginConnector]: BlockEncodingV2 initialized 17.67/8.14 [2019-03-28 12:02:32,894 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:32" (1/1) ... 17.67/8.14 [2019-03-28 12:02:32,908 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 12 edges 17.67/8.14 [2019-03-28 12:02:32,910 INFO L258 BlockEncoder]: Using Remove infeasible edges 17.67/8.14 [2019-03-28 12:02:32,911 INFO L263 BlockEncoder]: Using Maximize final states 17.67/8.14 [2019-03-28 12:02:32,911 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 17.67/8.14 [2019-03-28 12:02:32,912 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 17.67/8.14 [2019-03-28 12:02:32,913 INFO L296 BlockEncoder]: Using Remove sink states 17.67/8.14 [2019-03-28 12:02:32,914 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 17.67/8.14 [2019-03-28 12:02:32,915 INFO L179 BlockEncoder]: Using Rewrite not-equals 17.67/8.14 [2019-03-28 12:02:32,931 INFO L185 BlockEncoder]: Using Use SBE 17.67/8.14 [2019-03-28 12:02:32,948 INFO L200 BlockEncoder]: SBE split 4 edges 17.67/8.14 [2019-03-28 12:02:32,952 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 17.67/8.14 [2019-03-28 12:02:32,954 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.67/8.14 [2019-03-28 12:02:32,962 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 17.67/8.14 [2019-03-28 12:02:32,964 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 17.67/8.14 [2019-03-28 12:02:32,965 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 17.67/8.14 [2019-03-28 12:02:32,966 INFO L71 MaximizeFinalStates]: 0 new accepting states 17.67/8.14 [2019-03-28 12:02:32,966 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 17.67/8.14 [2019-03-28 12:02:32,966 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 17.67/8.14 [2019-03-28 12:02:32,967 INFO L313 BlockEncoder]: Encoded RCFG 5 locations, 11 edges 17.67/8.14 [2019-03-28 12:02:32,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:32 BasicIcfg 17.67/8.14 [2019-03-28 12:02:32,967 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 17.67/8.14 [2019-03-28 12:02:32,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 17.67/8.14 [2019-03-28 12:02:32,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... 17.67/8.14 [2019-03-28 12:02:32,971 INFO L276 PluginConnector]: TraceAbstraction initialized 17.67/8.14 [2019-03-28 12:02:32,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:02:32" (1/4) ... 17.67/8.14 [2019-03-28 12:02:32,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352356a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:02:32, skipping insertion in model container 17.67/8.14 [2019-03-28 12:02:32,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (2/4) ... 17.67/8.14 [2019-03-28 12:02:32,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352356a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:02:32, skipping insertion in model container 17.67/8.14 [2019-03-28 12:02:32,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:32" (3/4) ... 17.67/8.14 [2019-03-28 12:02:32,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352356a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:32, skipping insertion in model container 17.67/8.14 [2019-03-28 12:02:32,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:32" (4/4) ... 17.67/8.14 [2019-03-28 12:02:32,975 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.67/8.14 [2019-03-28 12:02:32,985 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 17.67/8.14 [2019-03-28 12:02:32,993 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 17.67/8.14 [2019-03-28 12:02:33,010 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 17.67/8.14 [2019-03-28 12:02:33,040 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.67/8.14 [2019-03-28 12:02:33,041 INFO L382 AbstractCegarLoop]: Interprodecural is true 17.67/8.14 [2019-03-28 12:02:33,041 INFO L383 AbstractCegarLoop]: Hoare is true 17.67/8.14 [2019-03-28 12:02:33,041 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 17.67/8.14 [2019-03-28 12:02:33,041 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 17.67/8.14 [2019-03-28 12:02:33,041 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.67/8.14 [2019-03-28 12:02:33,042 INFO L387 AbstractCegarLoop]: Difference is false 17.67/8.14 [2019-03-28 12:02:33,042 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 17.67/8.14 [2019-03-28 12:02:33,042 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 17.67/8.14 [2019-03-28 12:02:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. 17.67/8.14 [2019-03-28 12:02:33,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 17.67/8.14 [2019-03-28 12:02:33,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. 17.67/8.14 [2019-03-28 12:02:33,113 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 21) no Hoare annotation was computed. 17.67/8.14 [2019-03-28 12:02:33,114 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 29) no Hoare annotation was computed. 17.67/8.14 [2019-03-28 12:02:33,114 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 17.67/8.14 [2019-03-28 12:02:33,114 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 28) no Hoare annotation was computed. 17.67/8.14 [2019-03-28 12:02:33,114 INFO L451 ceAbstractionStarter]: At program point L23-2(lines 14 30) the Hoare annotation is: true 17.67/8.14 [2019-03-28 12:02:33,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:33 BasicIcfg 17.67/8.14 [2019-03-28 12:02:33,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 17.67/8.14 [2019-03-28 12:02:33,124 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 17.67/8.14 [2019-03-28 12:02:33,124 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 17.67/8.14 [2019-03-28 12:02:33,127 INFO L276 PluginConnector]: BuchiAutomizer initialized 17.67/8.14 [2019-03-28 12:02:33,128 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.67/8.14 [2019-03-28 12:02:33,128 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:02:32" (1/5) ... 17.67/8.14 [2019-03-28 12:02:33,129 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c99856b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:02:33, skipping insertion in model container 17.67/8.14 [2019-03-28 12:02:33,129 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.67/8.14 [2019-03-28 12:02:33,129 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:02:32" (2/5) ... 17.67/8.14 [2019-03-28 12:02:33,130 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c99856b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:02:33, skipping insertion in model container 17.67/8.14 [2019-03-28 12:02:33,130 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.67/8.14 [2019-03-28 12:02:33,130 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:02:32" (3/5) ... 17.67/8.14 [2019-03-28 12:02:33,131 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c99856b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:33, skipping insertion in model container 17.67/8.14 [2019-03-28 12:02:33,131 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.67/8.14 [2019-03-28 12:02:33,131 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:02:32" (4/5) ... 17.67/8.14 [2019-03-28 12:02:33,131 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c99856b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:33, skipping insertion in model container 17.67/8.14 [2019-03-28 12:02:33,131 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 17.67/8.14 [2019-03-28 12:02:33,132 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:02:33" (5/5) ... 17.67/8.14 [2019-03-28 12:02:33,133 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 17.67/8.14 [2019-03-28 12:02:33,161 INFO L133 ementStrategyFactory]: Using default assertion order modulation 17.67/8.14 [2019-03-28 12:02:33,161 INFO L374 BuchiCegarLoop]: Interprodecural is true 17.67/8.14 [2019-03-28 12:02:33,162 INFO L375 BuchiCegarLoop]: Hoare is true 17.67/8.14 [2019-03-28 12:02:33,162 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 17.67/8.14 [2019-03-28 12:02:33,162 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 17.67/8.14 [2019-03-28 12:02:33,162 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 17.67/8.14 [2019-03-28 12:02:33,162 INFO L379 BuchiCegarLoop]: Difference is false 17.67/8.14 [2019-03-28 12:02:33,162 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 17.67/8.14 [2019-03-28 12:02:33,163 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 17.67/8.14 [2019-03-28 12:02:33,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 17.67/8.14 [2019-03-28 12:02:33,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 17.67/8.14 [2019-03-28 12:02:33,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.67/8.14 [2019-03-28 12:02:33,184 INFO L119 BuchiIsEmpty]: Starting construction of run 17.67/8.14 [2019-03-28 12:02:33,191 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.67/8.14 [2019-03-28 12:02:33,191 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.67/8.14 [2019-03-28 12:02:33,191 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 17.67/8.14 [2019-03-28 12:02:33,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. 17.67/8.14 [2019-03-28 12:02:33,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 17.67/8.14 [2019-03-28 12:02:33,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.67/8.14 [2019-03-28 12:02:33,192 INFO L119 BuchiIsEmpty]: Starting construction of run 17.67/8.14 [2019-03-28 12:02:33,192 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] 17.67/8.14 [2019-03-28 12:02:33,193 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.67/8.14 [2019-03-28 12:02:33,198 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_3 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 4#L23-2true 17.67/8.14 [2019-03-28 12:02:33,198 INFO L796 eck$LassoCheckResult]: Loop: 4#L23-2true [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 3#L15true [33] L15-->L16: Formula: (< 0 v_ULTIMATE.start_main_~x~0_12) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[] 6#L16true [54] L16-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_2|) (= v_ULTIMATE.start_main_~x~0_1 (+ v_ULTIMATE.start_main_~x~0_2 (- 1))) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_2|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 4#L23-2true 17.67/8.14 [2019-03-28 12:02:33,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:33,205 INFO L82 PathProgramCache]: Analyzing trace with hash 69, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:33,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:33,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:33,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:33,273 INFO L82 PathProgramCache]: Analyzing trace with hash 80840, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:33,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:33,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:33,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:33,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2106628, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:33,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:33,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:33,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:33,364 INFO L216 LassoAnalysis]: Preferences: 17.67/8.14 [2019-03-28 12:02:33,365 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.67/8.14 [2019-03-28 12:02:33,365 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.67/8.14 [2019-03-28 12:02:33,365 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.67/8.14 [2019-03-28 12:02:33,365 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.67/8.14 [2019-03-28 12:02:33,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:33,366 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.67/8.14 [2019-03-28 12:02:33,366 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.67/8.14 [2019-03-28 12:02:33,366 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 17.67/8.14 [2019-03-28 12:02:33,366 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.67/8.14 [2019-03-28 12:02:33,367 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.67/8.14 [2019-03-28 12:02:33,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:33,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:33,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:33,473 INFO L300 LassoAnalysis]: Preprocessing complete. 17.67/8.14 [2019-03-28 12:02:33,474 INFO L412 LassoAnalysis]: Checking for nontermination... 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:33,482 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:33,483 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:33,517 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:33,517 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 [2019-03-28 12:02:33,548 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.67/8.14 [2019-03-28 12:02:33,551 INFO L216 LassoAnalysis]: Preferences: 17.67/8.14 [2019-03-28 12:02:33,551 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.67/8.14 [2019-03-28 12:02:33,551 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.67/8.14 [2019-03-28 12:02:33,551 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.67/8.14 [2019-03-28 12:02:33,551 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.67/8.14 [2019-03-28 12:02:33,551 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:33,551 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.67/8.14 [2019-03-28 12:02:33,552 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.67/8.14 [2019-03-28 12:02:33,552 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 17.67/8.14 [2019-03-28 12:02:33,552 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.67/8.14 [2019-03-28 12:02:33,552 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.67/8.14 [2019-03-28 12:02:33,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:33,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:33,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:33,618 INFO L300 LassoAnalysis]: Preprocessing complete. 17.67/8.14 [2019-03-28 12:02:33,624 INFO L497 LassoAnalysis]: Using template 'affine'. 17.67/8.14 [2019-03-28 12:02:33,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.67/8.14 Termination analysis: LINEAR_WITH_GUESSES 17.67/8.14 Number of strict supporting invariants: 0 17.67/8.14 Number of non-strict supporting invariants: 1 17.67/8.14 Consider only non-deceasing supporting invariants: true 17.67/8.14 Simplify termination arguments: true 17.67/8.14 Simplify supporting invariants: trueOverapproximate stem: false 17.67/8.14 [2019-03-28 12:02:33,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.67/8.14 [2019-03-28 12:02:33,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.67/8.14 [2019-03-28 12:02:33,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.67/8.14 [2019-03-28 12:02:33,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.67/8.14 [2019-03-28 12:02:33,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.67/8.14 [2019-03-28 12:02:33,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.67/8.14 [2019-03-28 12:02:33,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.67/8.14 [2019-03-28 12:02:33,640 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.67/8.14 [2019-03-28 12:02:33,646 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.67/8.14 [2019-03-28 12:02:33,646 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 17.67/8.14 [2019-03-28 12:02:33,648 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.67/8.14 [2019-03-28 12:02:33,648 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.67/8.14 [2019-03-28 12:02:33,649 INFO L518 LassoAnalysis]: Proved termination. 17.67/8.14 [2019-03-28 12:02:33,649 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.67/8.14 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 17.67/8.14 Supporting invariants [] 17.67/8.14 [2019-03-28 12:02:33,651 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.67/8.14 [2019-03-28 12:02:33,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:33,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:33,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:33,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:33,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.67/8.14 [2019-03-28 12:02:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:33,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:33,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:33,788 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 17.67/8.14 [2019-03-28 12:02:33,794 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 17.67/8.14 [2019-03-28 12:02:33,795 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states. Second operand 3 states. 17.67/8.14 [2019-03-28 12:02:33,868 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states.. Second operand 3 states. Result 22 states and 47 transitions. Complement of second has 7 states. 17.67/8.14 [2019-03-28 12:02:33,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 17.67/8.14 [2019-03-28 12:02:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 17.67/8.14 [2019-03-28 12:02:33,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. 17.67/8.14 [2019-03-28 12:02:33,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 1 letters. Loop has 3 letters. 17.67/8.14 [2019-03-28 12:02:33,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:33,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 3 letters. 17.67/8.14 [2019-03-28 12:02:33,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:33,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 1 letters. Loop has 6 letters. 17.67/8.14 [2019-03-28 12:02:33,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:33,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 47 transitions. 17.67/8.14 [2019-03-28 12:02:33,884 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 17.67/8.14 [2019-03-28 12:02:33,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 34 transitions. 17.67/8.14 [2019-03-28 12:02:33,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 17.67/8.14 [2019-03-28 12:02:33,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 17.67/8.14 [2019-03-28 12:02:33,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 34 transitions. 17.67/8.14 [2019-03-28 12:02:33,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.67/8.14 [2019-03-28 12:02:33,891 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 34 transitions. 17.67/8.14 [2019-03-28 12:02:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 34 transitions. 17.67/8.14 [2019-03-28 12:02:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. 17.67/8.14 [2019-03-28 12:02:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 17.67/8.14 [2019-03-28 12:02:33,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. 17.67/8.14 [2019-03-28 12:02:33,923 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 29 transitions. 17.67/8.14 [2019-03-28 12:02:33,923 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 29 transitions. 17.67/8.14 [2019-03-28 12:02:33,923 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 17.67/8.14 [2019-03-28 12:02:33,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 29 transitions. 17.67/8.14 [2019-03-28 12:02:33,924 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 17.67/8.14 [2019-03-28 12:02:33,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.67/8.14 [2019-03-28 12:02:33,925 INFO L119 BuchiIsEmpty]: Starting construction of run 17.67/8.14 [2019-03-28 12:02:33,925 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 17.67/8.14 [2019-03-28 12:02:33,925 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.67/8.14 [2019-03-28 12:02:33,926 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_3 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 83#L23-2 [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 75#L15 17.67/8.14 [2019-03-28 12:02:33,926 INFO L796 eck$LassoCheckResult]: Loop: 75#L15 [33] L15-->L16: Formula: (< 0 v_ULTIMATE.start_main_~x~0_12) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[] 76#L16 [40] L16-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~y~0_6 (- 1))) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 79#L23-2 [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 75#L15 17.67/8.14 [2019-03-28 12:02:33,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:33,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2191, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:33,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:33,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:33,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:33,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:33,935 INFO L82 PathProgramCache]: Analyzing trace with hash 62796, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:33,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:33,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:33,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:33,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:33,942 INFO L82 PathProgramCache]: Analyzing trace with hash 65305086, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:33,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:33,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:33,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:33,967 INFO L216 LassoAnalysis]: Preferences: 17.67/8.14 [2019-03-28 12:02:33,968 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.67/8.14 [2019-03-28 12:02:33,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.67/8.14 [2019-03-28 12:02:33,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.67/8.14 [2019-03-28 12:02:33,968 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.67/8.14 [2019-03-28 12:02:33,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:33,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.67/8.14 [2019-03-28 12:02:33,969 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.67/8.14 [2019-03-28 12:02:33,969 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 17.67/8.14 [2019-03-28 12:02:33,969 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.67/8.14 [2019-03-28 12:02:33,969 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.67/8.14 [2019-03-28 12:02:33,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:33,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:33,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:34,023 INFO L300 LassoAnalysis]: Preprocessing complete. 17.67/8.14 [2019-03-28 12:02:34,024 INFO L412 LassoAnalysis]: Checking for nontermination... 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:34,028 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:34,028 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:34,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:34,059 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 [2019-03-28 12:02:34,136 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.67/8.14 [2019-03-28 12:02:34,138 INFO L216 LassoAnalysis]: Preferences: 17.67/8.14 [2019-03-28 12:02:34,138 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.67/8.14 [2019-03-28 12:02:34,138 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.67/8.14 [2019-03-28 12:02:34,138 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.67/8.14 [2019-03-28 12:02:34,139 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.67/8.14 [2019-03-28 12:02:34,139 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:34,139 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.67/8.14 [2019-03-28 12:02:34,139 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.67/8.14 [2019-03-28 12:02:34,139 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 17.67/8.14 [2019-03-28 12:02:34,139 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.67/8.14 [2019-03-28 12:02:34,139 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.67/8.14 [2019-03-28 12:02:34,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:34,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:34,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:34,183 INFO L300 LassoAnalysis]: Preprocessing complete. 17.67/8.14 [2019-03-28 12:02:34,183 INFO L497 LassoAnalysis]: Using template 'affine'. 17.67/8.14 [2019-03-28 12:02:34,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.67/8.14 Termination analysis: LINEAR_WITH_GUESSES 17.67/8.14 Number of strict supporting invariants: 0 17.67/8.14 Number of non-strict supporting invariants: 1 17.67/8.14 Consider only non-deceasing supporting invariants: true 17.67/8.14 Simplify termination arguments: true 17.67/8.14 Simplify supporting invariants: trueOverapproximate stem: false 17.67/8.14 [2019-03-28 12:02:34,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.67/8.14 [2019-03-28 12:02:34,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.67/8.14 [2019-03-28 12:02:34,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.67/8.14 [2019-03-28 12:02:34,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.67/8.14 [2019-03-28 12:02:34,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.67/8.14 [2019-03-28 12:02:34,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.67/8.14 [2019-03-28 12:02:34,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.67/8.14 [2019-03-28 12:02:34,192 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.67/8.14 [2019-03-28 12:02:34,195 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.67/8.14 [2019-03-28 12:02:34,195 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 17.67/8.14 [2019-03-28 12:02:34,196 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.67/8.14 [2019-03-28 12:02:34,196 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.67/8.14 [2019-03-28 12:02:34,196 INFO L518 LassoAnalysis]: Proved termination. 17.67/8.14 [2019-03-28 12:02:34,196 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.67/8.14 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 17.67/8.14 Supporting invariants [] 17.67/8.14 [2019-03-28 12:02:34,196 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.67/8.14 [2019-03-28 12:02:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:34,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:34,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:34,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:34,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.67/8.14 [2019-03-28 12:02:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:34,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:34,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:34,289 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 17.67/8.14 [2019-03-28 12:02:34,289 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 17.67/8.14 [2019-03-28 12:02:34,290 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 29 transitions. cyclomatic complexity: 18 Second operand 4 states. 17.67/8.14 [2019-03-28 12:02:34,391 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 29 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 42 states and 80 transitions. Complement of second has 8 states. 17.67/8.14 [2019-03-28 12:02:34,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states 17.67/8.14 [2019-03-28 12:02:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 17.67/8.14 [2019-03-28 12:02:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. 17.67/8.14 [2019-03-28 12:02:34,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 2 letters. Loop has 3 letters. 17.67/8.14 [2019-03-28 12:02:34,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:34,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 3 letters. 17.67/8.14 [2019-03-28 12:02:34,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:34,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 2 letters. Loop has 6 letters. 17.67/8.14 [2019-03-28 12:02:34,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:34,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 80 transitions. 17.67/8.14 [2019-03-28 12:02:34,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 17.67/8.14 [2019-03-28 12:02:34,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 33 states and 68 transitions. 17.67/8.14 [2019-03-28 12:02:34,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 17.67/8.14 [2019-03-28 12:02:34,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 17.67/8.14 [2019-03-28 12:02:34,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 68 transitions. 17.67/8.14 [2019-03-28 12:02:34,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.67/8.14 [2019-03-28 12:02:34,403 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 68 transitions. 17.67/8.14 [2019-03-28 12:02:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 68 transitions. 17.67/8.14 [2019-03-28 12:02:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. 17.67/8.14 [2019-03-28 12:02:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 17.67/8.14 [2019-03-28 12:02:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. 17.67/8.14 [2019-03-28 12:02:34,407 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 56 transitions. 17.67/8.14 [2019-03-28 12:02:34,407 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 56 transitions. 17.67/8.14 [2019-03-28 12:02:34,407 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 17.67/8.14 [2019-03-28 12:02:34,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 56 transitions. 17.67/8.14 [2019-03-28 12:02:34,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 17.67/8.14 [2019-03-28 12:02:34,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.67/8.14 [2019-03-28 12:02:34,408 INFO L119 BuchiIsEmpty]: Starting construction of run 17.67/8.14 [2019-03-28 12:02:34,409 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 17.67/8.14 [2019-03-28 12:02:34,409 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.67/8.14 [2019-03-28 12:02:34,410 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_3 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 193#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 203#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 201#L23 17.67/8.14 [2019-03-28 12:02:34,410 INFO L796 eck$LassoCheckResult]: Loop: 201#L23 [56] L23-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 190#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 200#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 201#L23 17.67/8.14 [2019-03-28 12:02:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash 67999, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:34,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:34,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:34,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:34,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash 85297, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:34,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:34,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:34,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:34,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2025813715, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:34,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:34,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:34,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:34,474 INFO L216 LassoAnalysis]: Preferences: 17.67/8.14 [2019-03-28 12:02:34,475 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.67/8.14 [2019-03-28 12:02:34,475 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.67/8.14 [2019-03-28 12:02:34,475 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.67/8.14 [2019-03-28 12:02:34,475 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.67/8.14 [2019-03-28 12:02:34,475 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:34,475 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.67/8.14 [2019-03-28 12:02:34,476 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.67/8.14 [2019-03-28 12:02:34,476 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 17.67/8.14 [2019-03-28 12:02:34,476 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.67/8.14 [2019-03-28 12:02:34,476 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.67/8.14 [2019-03-28 12:02:34,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:34,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:34,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:34,512 INFO L300 LassoAnalysis]: Preprocessing complete. 17.67/8.14 [2019-03-28 12:02:34,512 INFO L412 LassoAnalysis]: Checking for nontermination... 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:34,517 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:34,517 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 [2019-03-28 12:02:34,546 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.67/8.14 [2019-03-28 12:02:34,546 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:34,552 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:34,552 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:34,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:34,584 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 [2019-03-28 12:02:34,661 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.67/8.14 [2019-03-28 12:02:34,663 INFO L216 LassoAnalysis]: Preferences: 17.67/8.14 [2019-03-28 12:02:34,663 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.67/8.14 [2019-03-28 12:02:34,663 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.67/8.14 [2019-03-28 12:02:34,664 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.67/8.14 [2019-03-28 12:02:34,664 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.67/8.14 [2019-03-28 12:02:34,664 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:34,664 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.67/8.14 [2019-03-28 12:02:34,664 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.67/8.14 [2019-03-28 12:02:34,664 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop 17.67/8.14 [2019-03-28 12:02:34,664 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.67/8.14 [2019-03-28 12:02:34,664 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.67/8.14 [2019-03-28 12:02:34,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:34,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:34,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:34,719 INFO L300 LassoAnalysis]: Preprocessing complete. 17.67/8.14 [2019-03-28 12:02:34,719 INFO L497 LassoAnalysis]: Using template 'affine'. 17.67/8.14 [2019-03-28 12:02:34,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.67/8.14 Termination analysis: LINEAR_WITH_GUESSES 17.67/8.14 Number of strict supporting invariants: 0 17.67/8.14 Number of non-strict supporting invariants: 1 17.67/8.14 Consider only non-deceasing supporting invariants: true 17.67/8.14 Simplify termination arguments: true 17.67/8.14 Simplify supporting invariants: trueOverapproximate stem: false 17.67/8.14 [2019-03-28 12:02:34,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.67/8.14 [2019-03-28 12:02:34,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.67/8.14 [2019-03-28 12:02:34,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.67/8.14 [2019-03-28 12:02:34,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.67/8.14 [2019-03-28 12:02:34,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.67/8.14 [2019-03-28 12:02:34,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.67/8.14 [2019-03-28 12:02:34,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.67/8.14 [2019-03-28 12:02:34,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.67/8.14 [2019-03-28 12:02:34,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.67/8.14 Termination analysis: LINEAR_WITH_GUESSES 17.67/8.14 Number of strict supporting invariants: 0 17.67/8.14 Number of non-strict supporting invariants: 1 17.67/8.14 Consider only non-deceasing supporting invariants: true 17.67/8.14 Simplify termination arguments: true 17.67/8.14 Simplify supporting invariants: trueOverapproximate stem: false 17.67/8.14 [2019-03-28 12:02:34,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.67/8.14 [2019-03-28 12:02:34,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.67/8.14 [2019-03-28 12:02:34,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.67/8.14 [2019-03-28 12:02:34,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.67/8.14 [2019-03-28 12:02:34,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.67/8.14 [2019-03-28 12:02:34,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.67/8.14 [2019-03-28 12:02:34,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.67/8.14 [2019-03-28 12:02:34,731 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.67/8.14 [2019-03-28 12:02:34,734 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.67/8.14 [2019-03-28 12:02:34,735 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 17.67/8.14 [2019-03-28 12:02:34,735 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.67/8.14 [2019-03-28 12:02:34,735 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.67/8.14 [2019-03-28 12:02:34,735 INFO L518 LassoAnalysis]: Proved termination. 17.67/8.14 [2019-03-28 12:02:34,735 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.67/8.14 Ranking function f(ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~x~0 17.67/8.14 Supporting invariants [] 17.67/8.14 [2019-03-28 12:02:34,736 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.67/8.14 [2019-03-28 12:02:34,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:34,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:34,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:34,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:34,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.67/8.14 [2019-03-28 12:02:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:34,786 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:34,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:34,788 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 17.67/8.14 [2019-03-28 12:02:34,788 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 17.67/8.14 [2019-03-28 12:02:34,788 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 27 states and 56 transitions. cyclomatic complexity: 31 Second operand 3 states. 17.67/8.14 [2019-03-28 12:02:34,863 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 27 states and 56 transitions. cyclomatic complexity: 31. Second operand 3 states. Result 96 states and 222 transitions. Complement of second has 9 states. 17.67/8.14 [2019-03-28 12:02:34,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 17.67/8.14 [2019-03-28 12:02:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 17.67/8.14 [2019-03-28 12:02:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. 17.67/8.14 [2019-03-28 12:02:34,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 3 letters. 17.67/8.14 [2019-03-28 12:02:34,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:34,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 6 letters. Loop has 3 letters. 17.67/8.14 [2019-03-28 12:02:34,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:34,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 6 letters. 17.67/8.14 [2019-03-28 12:02:34,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:34,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 222 transitions. 17.67/8.14 [2019-03-28 12:02:34,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 17.67/8.14 [2019-03-28 12:02:34,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 95 states and 217 transitions. 17.67/8.14 [2019-03-28 12:02:34,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 17.67/8.14 [2019-03-28 12:02:34,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 17.67/8.14 [2019-03-28 12:02:34,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 217 transitions. 17.67/8.14 [2019-03-28 12:02:34,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.67/8.14 [2019-03-28 12:02:34,875 INFO L706 BuchiCegarLoop]: Abstraction has 95 states and 217 transitions. 17.67/8.14 [2019-03-28 12:02:34,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 217 transitions. 17.67/8.14 [2019-03-28 12:02:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. 17.67/8.14 [2019-03-28 12:02:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. 17.67/8.14 [2019-03-28 12:02:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 189 transitions. 17.67/8.14 [2019-03-28 12:02:34,884 INFO L729 BuchiCegarLoop]: Abstraction has 82 states and 189 transitions. 17.67/8.14 [2019-03-28 12:02:34,884 INFO L609 BuchiCegarLoop]: Abstraction has 82 states and 189 transitions. 17.67/8.14 [2019-03-28 12:02:34,884 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 17.67/8.14 [2019-03-28 12:02:34,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 189 transitions. 17.67/8.14 [2019-03-28 12:02:34,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 17.67/8.14 [2019-03-28 12:02:34,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.67/8.14 [2019-03-28 12:02:34,887 INFO L119 BuchiIsEmpty]: Starting construction of run 17.67/8.14 [2019-03-28 12:02:34,887 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 17.67/8.14 [2019-03-28 12:02:34,887 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 17.67/8.14 [2019-03-28 12:02:34,887 INFO L794 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_3 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 359#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 361#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 382#L23 17.67/8.14 [2019-03-28 12:02:34,888 INFO L796 eck$LassoCheckResult]: Loop: 382#L23 [43] L23-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_11 |v_ULTIMATE.start_main_#t~nondet5_3|) (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 364#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 418#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 382#L23 17.67/8.14 [2019-03-28 12:02:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:34,888 INFO L82 PathProgramCache]: Analyzing trace with hash 67999, now seen corresponding path program 2 times 17.67/8.14 [2019-03-28 12:02:34,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:34,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:34,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash 72804, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:34,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:34,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:34,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:34,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2025801222, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:34,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:34,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:34,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:34,945 INFO L216 LassoAnalysis]: Preferences: 17.67/8.14 [2019-03-28 12:02:34,945 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.67/8.14 [2019-03-28 12:02:34,945 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.67/8.14 [2019-03-28 12:02:34,945 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.67/8.14 [2019-03-28 12:02:34,946 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.67/8.14 [2019-03-28 12:02:34,946 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:34,946 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.67/8.14 [2019-03-28 12:02:34,946 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.67/8.14 [2019-03-28 12:02:34,946 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 17.67/8.14 [2019-03-28 12:02:34,946 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.67/8.14 [2019-03-28 12:02:34,946 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.67/8.14 [2019-03-28 12:02:34,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:34,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:34,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:34,996 INFO L300 LassoAnalysis]: Preprocessing complete. 17.67/8.14 [2019-03-28 12:02:34,996 INFO L412 LassoAnalysis]: Checking for nontermination... 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:35,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:35,001 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 [2019-03-28 12:02:35,005 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.67/8.14 [2019-03-28 12:02:35,005 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=0} Honda state: {ULTIMATE.start_main_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:35,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:35,033 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 [2019-03-28 12:02:35,039 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.67/8.14 [2019-03-28 12:02:35,039 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=-1, ULTIMATE.start_main_~x~0=-1} Honda state: {ULTIMATE.start_main_#t~nondet5=-1, ULTIMATE.start_main_~x~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:35,068 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:35,069 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:35,100 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:35,100 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 [2019-03-28 12:02:35,176 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.67/8.14 [2019-03-28 12:02:35,178 INFO L216 LassoAnalysis]: Preferences: 17.67/8.14 [2019-03-28 12:02:35,178 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.67/8.14 [2019-03-28 12:02:35,178 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.67/8.14 [2019-03-28 12:02:35,178 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.67/8.14 [2019-03-28 12:02:35,179 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.67/8.14 [2019-03-28 12:02:35,179 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:35,179 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.67/8.14 [2019-03-28 12:02:35,179 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.67/8.14 [2019-03-28 12:02:35,179 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop 17.67/8.14 [2019-03-28 12:02:35,179 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.67/8.14 [2019-03-28 12:02:35,179 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.67/8.14 [2019-03-28 12:02:35,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:35,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:35,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:35,248 INFO L300 LassoAnalysis]: Preprocessing complete. 17.67/8.14 [2019-03-28 12:02:35,248 INFO L497 LassoAnalysis]: Using template 'affine'. 17.67/8.14 [2019-03-28 12:02:35,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.67/8.14 Termination analysis: LINEAR_WITH_GUESSES 17.67/8.14 Number of strict supporting invariants: 0 17.67/8.14 Number of non-strict supporting invariants: 1 17.67/8.14 Consider only non-deceasing supporting invariants: true 17.67/8.14 Simplify termination arguments: true 17.67/8.14 Simplify supporting invariants: trueOverapproximate stem: false 17.67/8.14 [2019-03-28 12:02:35,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.67/8.14 [2019-03-28 12:02:35,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.67/8.14 [2019-03-28 12:02:35,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.67/8.14 [2019-03-28 12:02:35,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.67/8.14 [2019-03-28 12:02:35,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.67/8.14 [2019-03-28 12:02:35,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.67/8.14 [2019-03-28 12:02:35,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.67/8.14 [2019-03-28 12:02:35,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.67/8.14 [2019-03-28 12:02:35,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.67/8.14 Termination analysis: LINEAR_WITH_GUESSES 17.67/8.14 Number of strict supporting invariants: 0 17.67/8.14 Number of non-strict supporting invariants: 1 17.67/8.14 Consider only non-deceasing supporting invariants: true 17.67/8.14 Simplify termination arguments: true 17.67/8.14 Simplify supporting invariants: trueOverapproximate stem: false 17.67/8.14 [2019-03-28 12:02:35,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.67/8.14 [2019-03-28 12:02:35,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.67/8.14 [2019-03-28 12:02:35,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.67/8.14 [2019-03-28 12:02:35,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.67/8.14 [2019-03-28 12:02:35,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.67/8.14 [2019-03-28 12:02:35,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.67/8.14 [2019-03-28 12:02:35,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.67/8.14 [2019-03-28 12:02:35,258 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.67/8.14 [2019-03-28 12:02:35,261 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.67/8.14 [2019-03-28 12:02:35,261 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 17.67/8.14 [2019-03-28 12:02:35,262 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.67/8.14 [2019-03-28 12:02:35,262 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.67/8.14 [2019-03-28 12:02:35,262 INFO L518 LassoAnalysis]: Proved termination. 17.67/8.14 [2019-03-28 12:02:35,262 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.67/8.14 Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 17.67/8.14 Supporting invariants [] 17.67/8.14 [2019-03-28 12:02:35,263 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.67/8.14 [2019-03-28 12:02:35,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:35,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:35,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:35,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:35,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.67/8.14 [2019-03-28 12:02:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:35,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:35,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:35,324 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 17.67/8.14 [2019-03-28 12:02:35,324 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 17.67/8.14 [2019-03-28 12:02:35,324 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 82 states and 189 transitions. cyclomatic complexity: 109 Second operand 4 states. 17.67/8.14 [2019-03-28 12:02:35,459 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 82 states and 189 transitions. cyclomatic complexity: 109. Second operand 4 states. Result 331 states and 893 transitions. Complement of second has 20 states. 17.67/8.14 [2019-03-28 12:02:35,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 2 accepting loop states 17.67/8.14 [2019-03-28 12:02:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 17.67/8.14 [2019-03-28 12:02:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. 17.67/8.14 [2019-03-28 12:02:35,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 3 letters. Loop has 3 letters. 17.67/8.14 [2019-03-28 12:02:35,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:35,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 6 letters. Loop has 3 letters. 17.67/8.14 [2019-03-28 12:02:35,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:35,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 3 letters. Loop has 6 letters. 17.67/8.14 [2019-03-28 12:02:35,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:35,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 893 transitions. 17.67/8.14 [2019-03-28 12:02:35,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 208 17.67/8.14 [2019-03-28 12:02:35,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 221 states and 510 transitions. 17.67/8.14 [2019-03-28 12:02:35,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 17.67/8.14 [2019-03-28 12:02:35,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 17.67/8.14 [2019-03-28 12:02:35,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 510 transitions. 17.67/8.14 [2019-03-28 12:02:35,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.67/8.14 [2019-03-28 12:02:35,479 INFO L706 BuchiCegarLoop]: Abstraction has 221 states and 510 transitions. 17.67/8.14 [2019-03-28 12:02:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 510 transitions. 17.67/8.14 [2019-03-28 12:02:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 114. 17.67/8.14 [2019-03-28 12:02:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. 17.67/8.14 [2019-03-28 12:02:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 281 transitions. 17.67/8.14 [2019-03-28 12:02:35,492 INFO L729 BuchiCegarLoop]: Abstraction has 114 states and 281 transitions. 17.67/8.14 [2019-03-28 12:02:35,492 INFO L609 BuchiCegarLoop]: Abstraction has 114 states and 281 transitions. 17.67/8.14 [2019-03-28 12:02:35,492 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 17.67/8.14 [2019-03-28 12:02:35,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 281 transitions. 17.67/8.14 [2019-03-28 12:02:35,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 17.67/8.14 [2019-03-28 12:02:35,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.67/8.14 [2019-03-28 12:02:35,494 INFO L119 BuchiIsEmpty]: Starting construction of run 17.67/8.14 [2019-03-28 12:02:35,495 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 17.67/8.14 [2019-03-28 12:02:35,495 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 17.67/8.14 [2019-03-28 12:02:35,495 INFO L794 eck$LassoCheckResult]: Stem: 847#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_3 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 848#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 907#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 869#L23 17.67/8.14 [2019-03-28 12:02:35,495 INFO L796 eck$LassoCheckResult]: Loop: 869#L23 [43] L23-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~x~0_11 |v_ULTIMATE.start_main_#t~nondet5_3|) (= 0 |v_ULTIMATE.start_main_#t~nondet4_5|) (= v_ULTIMATE.start_main_~y~0_9 (+ v_ULTIMATE.start_main_~y~0_10 (- 1)))) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_10, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_3|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_9, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_4|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 902#L23-2 [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 886#L15 [33] L15-->L16: Formula: (< 0 v_ULTIMATE.start_main_~x~0_12) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[] 853#L16 [54] L16-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_2|) (= v_ULTIMATE.start_main_~x~0_1 (+ v_ULTIMATE.start_main_~x~0_2 (- 1))) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_2|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 861#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 867#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 869#L23 17.67/8.14 [2019-03-28 12:02:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:35,496 INFO L82 PathProgramCache]: Analyzing trace with hash 67999, now seen corresponding path program 3 times 17.67/8.14 [2019-03-28 12:02:35,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:35,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:35,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:35,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:35,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:35,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2127350343, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:35,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:35,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:35,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:35,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:35,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.67/8.14 [2019-03-28 12:02:35,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.67/8.14 [2019-03-28 12:02:35,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 17.67/8.14 [2019-03-28 12:02:35,551 INFO L811 eck$LassoCheckResult]: loop already infeasible 17.67/8.14 [2019-03-28 12:02:35,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 17.67/8.14 [2019-03-28 12:02:35,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 17.67/8.14 [2019-03-28 12:02:35,556 INFO L87 Difference]: Start difference. First operand 114 states and 281 transitions. cyclomatic complexity: 169 Second operand 4 states. 17.67/8.14 [2019-03-28 12:02:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.67/8.14 [2019-03-28 12:02:35,601 INFO L93 Difference]: Finished difference Result 71 states and 130 transitions. 17.67/8.14 [2019-03-28 12:02:35,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 17.67/8.14 [2019-03-28 12:02:35,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 130 transitions. 17.67/8.14 [2019-03-28 12:02:35,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 17.67/8.14 [2019-03-28 12:02:35,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 47 states and 93 transitions. 17.67/8.14 [2019-03-28 12:02:35,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 17.67/8.14 [2019-03-28 12:02:35,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 17.67/8.14 [2019-03-28 12:02:35,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 93 transitions. 17.67/8.14 [2019-03-28 12:02:35,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 17.67/8.14 [2019-03-28 12:02:35,606 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 93 transitions. 17.67/8.14 [2019-03-28 12:02:35,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 93 transitions. 17.67/8.14 [2019-03-28 12:02:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. 17.67/8.14 [2019-03-28 12:02:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 17.67/8.14 [2019-03-28 12:02:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 70 transitions. 17.67/8.14 [2019-03-28 12:02:35,609 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 70 transitions. 17.67/8.14 [2019-03-28 12:02:35,609 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 70 transitions. 17.67/8.14 [2019-03-28 12:02:35,609 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 17.67/8.14 [2019-03-28 12:02:35,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 70 transitions. 17.67/8.14 [2019-03-28 12:02:35,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 17.67/8.14 [2019-03-28 12:02:35,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 17.67/8.14 [2019-03-28 12:02:35,610 INFO L119 BuchiIsEmpty]: Starting construction of run 17.67/8.14 [2019-03-28 12:02:35,610 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 17.67/8.14 [2019-03-28 12:02:35,610 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] 17.67/8.14 [2019-03-28 12:02:35,611 INFO L794 eck$LassoCheckResult]: Stem: 1038#ULTIMATE.startENTRY [38] ULTIMATE.startENTRY-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_2 |v_ULTIMATE.start_main_#t~nondet1_4|) (= v_ULTIMATE.start_main_~x~0_3 |v_ULTIMATE.start_main_#t~nondet0_4|)) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_1|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_1|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_2, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_3} AuxVars[|v_ULTIMATE.start_main_#t~nondet1_4|, |v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 1039#L23-2 [53] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (> 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 1028#L15 [47] L15-->L23: Formula: (>= 0 v_ULTIMATE.start_main_~x~0_6) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_6} AuxVars[] AssignedVars[] 1029#L23 [57] L23-->L23-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~nondet4_3|) (= v_ULTIMATE.start_main_~x~0_8 (+ v_ULTIMATE.start_main_~x~0_9 1))) InVars {ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_9} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_2|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~x~0] 1032#L23-2 [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 1033#L15 17.67/8.14 [2019-03-28 12:02:35,611 INFO L796 eck$LassoCheckResult]: Loop: 1033#L15 [33] L15-->L16: Formula: (< 0 v_ULTIMATE.start_main_~x~0_12) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[] 1035#L16 [54] L16-->L23-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~nondet2_2|) (= v_ULTIMATE.start_main_~x~0_1 (+ v_ULTIMATE.start_main_~x~0_2 (- 1))) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet3_2|)) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_2, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_2|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~y~0, ULTIMATE.start_main_~x~0] 1036#L23-2 [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 1057#L15 [33] L15-->L16: Formula: (< 0 v_ULTIMATE.start_main_~x~0_12) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} OutVars{ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_12} AuxVars[] AssignedVars[] 1031#L16 [40] L16-->L23-2: Formula: (and (= v_ULTIMATE.start_main_~y~0_5 (+ v_ULTIMATE.start_main_~y~0_6 (- 1))) (= 0 |v_ULTIMATE.start_main_#t~nondet2_5|)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_6, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_5, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~y~0] 1037#L23-2 [52] L23-2-->L15: Formula: (and (< 0 v_ULTIMATE.start_main_~y~0_8) (< 0 v_ULTIMATE.start_main_~x~0_10)) InVars {ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} OutVars{ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_8, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_10} AuxVars[] AssignedVars[] 1033#L15 17.67/8.14 [2019-03-28 12:02:35,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash 65348858, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:35,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:35,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:35,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:35,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:35,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.67/8.14 [2019-03-28 12:02:35,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 17.67/8.14 [2019-03-28 12:02:35,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 17.67/8.14 [2019-03-28 12:02:35,629 INFO L799 eck$LassoCheckResult]: stem already infeasible 17.67/8.14 [2019-03-28 12:02:35,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:35,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1883717935, now seen corresponding path program 1 times 17.67/8.14 [2019-03-28 12:02:35,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 17.67/8.14 [2019-03-28 12:02:35,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 17.67/8.14 [2019-03-28 12:02:35,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:35,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 17.67/8.14 [2019-03-28 12:02:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 17.67/8.14 [2019-03-28 12:02:35,687 INFO L216 LassoAnalysis]: Preferences: 17.67/8.14 [2019-03-28 12:02:35,687 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.67/8.14 [2019-03-28 12:02:35,687 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.67/8.14 [2019-03-28 12:02:35,688 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.67/8.14 [2019-03-28 12:02:35,688 INFO L127 ssoRankerPreferences]: Use exernal solver: true 17.67/8.14 [2019-03-28 12:02:35,688 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:35,688 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.67/8.14 [2019-03-28 12:02:35,688 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.67/8.14 [2019-03-28 12:02:35,688 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 17.67/8.14 [2019-03-28 12:02:35,688 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.67/8.14 [2019-03-28 12:02:35,688 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.67/8.14 [2019-03-28 12:02:35,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:35,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:35,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:35,746 INFO L300 LassoAnalysis]: Preprocessing complete. 17.67/8.14 [2019-03-28 12:02:35,747 INFO L412 LassoAnalysis]: Checking for nontermination... 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:35,751 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:35,752 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 [2019-03-28 12:02:35,779 INFO L445 LassoAnalysis]: Proved nontermination for one component. 17.67/8.14 [2019-03-28 12:02:35,780 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=1} Honda state: {ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:35,785 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:35,785 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 17.67/8.14 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 17.67/8.14 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:35,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 17.67/8.14 [2019-03-28 12:02:35,816 INFO L163 nArgumentSynthesizer]: Using integer mode. 17.67/8.14 [2019-03-28 12:02:35,897 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 17.67/8.14 [2019-03-28 12:02:35,899 INFO L216 LassoAnalysis]: Preferences: 17.67/8.14 [2019-03-28 12:02:35,899 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 17.67/8.14 [2019-03-28 12:02:35,899 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 17.67/8.14 [2019-03-28 12:02:35,899 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 17.67/8.14 [2019-03-28 12:02:35,899 INFO L127 ssoRankerPreferences]: Use exernal solver: false 17.67/8.14 [2019-03-28 12:02:35,899 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 17.67/8.14 [2019-03-28 12:02:35,900 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 17.67/8.14 [2019-03-28 12:02:35,900 INFO L130 ssoRankerPreferences]: Path of dumped script: 17.67/8.14 [2019-03-28 12:02:35,900 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 17.67/8.14 [2019-03-28 12:02:35,900 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 17.67/8.14 [2019-03-28 12:02:35,900 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 17.67/8.14 [2019-03-28 12:02:35,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:35,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:35,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 17.67/8.14 [2019-03-28 12:02:35,951 INFO L300 LassoAnalysis]: Preprocessing complete. 17.67/8.14 [2019-03-28 12:02:35,951 INFO L497 LassoAnalysis]: Using template 'affine'. 17.67/8.14 [2019-03-28 12:02:35,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.67/8.14 Termination analysis: LINEAR_WITH_GUESSES 17.67/8.14 Number of strict supporting invariants: 0 17.67/8.14 Number of non-strict supporting invariants: 1 17.67/8.14 Consider only non-deceasing supporting invariants: true 17.67/8.14 Simplify termination arguments: true 17.67/8.14 Simplify supporting invariants: trueOverapproximate stem: false 17.67/8.14 [2019-03-28 12:02:35,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.67/8.14 [2019-03-28 12:02:35,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.67/8.14 [2019-03-28 12:02:35,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.67/8.14 [2019-03-28 12:02:35,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.67/8.14 [2019-03-28 12:02:35,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.67/8.14 [2019-03-28 12:02:35,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.67/8.14 [2019-03-28 12:02:35,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.67/8.14 [2019-03-28 12:02:35,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 17.67/8.14 [2019-03-28 12:02:35,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 17.67/8.14 Termination analysis: LINEAR_WITH_GUESSES 17.67/8.14 Number of strict supporting invariants: 0 17.67/8.14 Number of non-strict supporting invariants: 1 17.67/8.14 Consider only non-deceasing supporting invariants: true 17.67/8.14 Simplify termination arguments: true 17.67/8.14 Simplify supporting invariants: trueOverapproximate stem: false 17.67/8.14 [2019-03-28 12:02:35,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. 17.67/8.14 [2019-03-28 12:02:35,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 17.67/8.14 [2019-03-28 12:02:35,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 17.67/8.14 [2019-03-28 12:02:35,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 17.67/8.14 [2019-03-28 12:02:35,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 17.67/8.14 [2019-03-28 12:02:35,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 17.67/8.14 [2019-03-28 12:02:35,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 17.67/8.14 [2019-03-28 12:02:35,962 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 17.67/8.14 [2019-03-28 12:02:35,965 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 17.67/8.14 [2019-03-28 12:02:35,965 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 17.67/8.14 [2019-03-28 12:02:35,965 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 17.67/8.14 [2019-03-28 12:02:35,965 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 17.67/8.14 [2019-03-28 12:02:35,966 INFO L518 LassoAnalysis]: Proved termination. 17.67/8.14 [2019-03-28 12:02:35,966 INFO L520 LassoAnalysis]: Termination argument consisting of: 17.67/8.14 Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 17.67/8.14 Supporting invariants [] 17.67/8.14 [2019-03-28 12:02:35,966 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 17.67/8.14 [2019-03-28 12:02:35,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 17.67/8.14 [2019-03-28 12:02:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:35,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:35,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:35,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:35,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 17.67/8.14 [2019-03-28 12:02:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:36,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:36,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:36,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:36,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 17.67/8.14 [2019-03-28 12:02:36,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core 17.67/8.14 [2019-03-28 12:02:36,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... 17.67/8.14 [2019-03-28 12:02:36,056 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 17.67/8.14 [2019-03-28 12:02:36,056 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates 17.67/8.14 [2019-03-28 12:02:36,057 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 30 states and 70 transitions. cyclomatic complexity: 43 Second operand 5 states. 17.67/8.14 [2019-03-28 12:02:36,086 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 30 states and 70 transitions. cyclomatic complexity: 43. Second operand 5 states. Result 50 states and 102 transitions. Complement of second has 8 states. 17.67/8.14 [2019-03-28 12:02:36,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states 17.67/8.14 [2019-03-28 12:02:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 17.67/8.14 [2019-03-28 12:02:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. 17.67/8.14 [2019-03-28 12:02:36,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 6 letters. 17.67/8.14 [2019-03-28 12:02:36,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:36,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 6 letters. 17.67/8.14 [2019-03-28 12:02:36,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:36,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 12 letters. 17.67/8.14 [2019-03-28 12:02:36,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. 17.67/8.14 [2019-03-28 12:02:36,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 102 transitions. 17.67/8.14 [2019-03-28 12:02:36,091 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 17.67/8.14 [2019-03-28 12:02:36,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 0 states and 0 transitions. 17.67/8.14 [2019-03-28 12:02:36,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 17.67/8.14 [2019-03-28 12:02:36,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 17.67/8.14 [2019-03-28 12:02:36,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 17.67/8.14 [2019-03-28 12:02:36,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.67/8.14 [2019-03-28 12:02:36,092 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.67/8.14 [2019-03-28 12:02:36,092 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.67/8.14 [2019-03-28 12:02:36,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 17.67/8.14 [2019-03-28 12:02:36,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 17.67/8.14 [2019-03-28 12:02:36,093 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. 17.67/8.14 [2019-03-28 12:02:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 17.67/8.14 [2019-03-28 12:02:36,093 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. 17.67/8.14 [2019-03-28 12:02:36,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 17.67/8.14 [2019-03-28 12:02:36,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. 17.67/8.14 [2019-03-28 12:02:36,094 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 17.67/8.14 [2019-03-28 12:02:36,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. 17.67/8.14 [2019-03-28 12:02:36,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 17.67/8.14 [2019-03-28 12:02:36,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 17.67/8.14 [2019-03-28 12:02:36,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 17.67/8.14 [2019-03-28 12:02:36,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 17.67/8.14 [2019-03-28 12:02:36,095 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.67/8.14 [2019-03-28 12:02:36,095 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.67/8.14 [2019-03-28 12:02:36,095 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 17.67/8.14 [2019-03-28 12:02:36,095 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 17.67/8.14 [2019-03-28 12:02:36,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 17.67/8.14 [2019-03-28 12:02:36,095 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 17.67/8.14 [2019-03-28 12:02:36,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 17.67/8.14 [2019-03-28 12:02:36,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:02:36 BasicIcfg 17.67/8.14 [2019-03-28 12:02:36,102 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 17.67/8.14 [2019-03-28 12:02:36,102 INFO L168 Benchmark]: Toolchain (without parser) took 3751.09 ms. Allocated memory was 649.6 MB in the beginning and 744.5 MB in the end (delta: 94.9 MB). Free memory was 559.5 MB in the beginning and 575.9 MB in the end (delta: -16.4 MB). Peak memory consumption was 78.5 MB. Max. memory is 50.3 GB. 17.67/8.14 [2019-03-28 12:02:36,104 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.67/8.14 [2019-03-28 12:02:36,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.17 ms. Allocated memory is still 649.6 MB. Free memory was 559.5 MB in the beginning and 548.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 50.3 GB. 17.67/8.14 [2019-03-28 12:02:36,105 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.29 ms. Allocated memory was 649.6 MB in the beginning and 665.8 MB in the end (delta: 16.3 MB). Free memory was 548.9 MB in the beginning and 630.5 MB in the end (delta: -81.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. 17.67/8.14 [2019-03-28 12:02:36,106 INFO L168 Benchmark]: Boogie Preprocessor took 19.75 ms. Allocated memory is still 665.8 MB. Free memory is still 630.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.67/8.14 [2019-03-28 12:02:36,106 INFO L168 Benchmark]: RCFGBuilder took 201.15 ms. Allocated memory is still 665.8 MB. Free memory was 630.5 MB in the beginning and 616.1 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 50.3 GB. 17.67/8.14 [2019-03-28 12:02:36,107 INFO L168 Benchmark]: BlockEncodingV2 took 76.41 ms. Allocated memory is still 665.8 MB. Free memory was 616.1 MB in the beginning and 610.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 17.67/8.14 [2019-03-28 12:02:36,107 INFO L168 Benchmark]: TraceAbstraction took 155.02 ms. Allocated memory is still 665.8 MB. Free memory was 610.7 MB in the beginning and 600.2 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 50.3 GB. 17.67/8.14 [2019-03-28 12:02:36,108 INFO L168 Benchmark]: BuchiAutomizer took 2978.22 ms. Allocated memory was 665.8 MB in the beginning and 744.5 MB in the end (delta: 78.6 MB). Free memory was 600.2 MB in the beginning and 575.9 MB in the end (delta: 24.3 MB). Peak memory consumption was 103.0 MB. Max. memory is 50.3 GB. 17.67/8.14 [2019-03-28 12:02:36,112 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 17.67/8.14 --- Results --- 17.67/8.14 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 17.67/8.14 - StatisticsResult: Initial Icfg 17.67/8.14 8 locations, 12 edges 17.67/8.14 - StatisticsResult: Encoded RCFG 17.67/8.14 5 locations, 11 edges 17.67/8.14 * Results from de.uni_freiburg.informatik.ultimate.core: 17.67/8.14 - StatisticsResult: Toolchain Benchmarks 17.67/8.14 Benchmark results are: 17.67/8.14 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.67/8.14 * CACSL2BoogieTranslator took 227.17 ms. Allocated memory is still 649.6 MB. Free memory was 559.5 MB in the beginning and 548.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 50.3 GB. 17.67/8.14 * Boogie Procedure Inliner took 88.29 ms. Allocated memory was 649.6 MB in the beginning and 665.8 MB in the end (delta: 16.3 MB). Free memory was 548.9 MB in the beginning and 630.5 MB in the end (delta: -81.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. 17.67/8.14 * Boogie Preprocessor took 19.75 ms. Allocated memory is still 665.8 MB. Free memory is still 630.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 17.67/8.14 * RCFGBuilder took 201.15 ms. Allocated memory is still 665.8 MB. Free memory was 630.5 MB in the beginning and 616.1 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 50.3 GB. 17.67/8.14 * BlockEncodingV2 took 76.41 ms. Allocated memory is still 665.8 MB. Free memory was 616.1 MB in the beginning and 610.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. 17.67/8.14 * TraceAbstraction took 155.02 ms. Allocated memory is still 665.8 MB. Free memory was 610.7 MB in the beginning and 600.2 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 50.3 GB. 17.67/8.14 * BuchiAutomizer took 2978.22 ms. Allocated memory was 665.8 MB in the beginning and 744.5 MB in the end (delta: 78.6 MB). Free memory was 600.2 MB in the beginning and 575.9 MB in the end (delta: 24.3 MB). Peak memory consumption was 103.0 MB. Max. memory is 50.3 GB. 17.67/8.14 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 17.67/8.14 - AllSpecificationsHoldResult: All specifications hold 17.67/8.14 We were not able to verify any specifiation because the program does not contain any specification. 17.67/8.14 - InvariantResult [Line: 14]: Loop Invariant 17.67/8.14 Derived loop invariant: 1 17.67/8.14 - StatisticsResult: Ultimate Automizer benchmark data 17.67/8.14 CFG has 1 procedures, 5 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 17.67/8.14 - StatisticsResult: Constructed decomposition of program 17.67/8.14 Your program was decomposed into 7 terminating modules (2 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function -1 * x and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 6 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. 17.67/8.14 - StatisticsResult: Timing statistics 17.67/8.14 BüchiAutomizer plugin needed 2.9s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 1.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 146 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 114 states and ocurred in iteration 4. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 30 SDtfs, 98 SDslu, 29 SDs, 0 SdLazy, 215 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s 17.67/8.14 - TerminationAnalysisResult: Termination proven 17.67/8.14 Buchi Automizer proved that your program is terminating 17.67/8.14 RESULT: Ultimate proved your program to be correct! 17.67/8.14 !SESSION 2019-03-28 12:02:29.104 ----------------------------------------------- 17.67/8.14 eclipse.buildId=unknown 17.67/8.14 java.version=1.8.0_181 17.67/8.14 java.vendor=Oracle Corporation 17.67/8.14 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 17.67/8.14 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c 17.67/8.14 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c 17.67/8.14 17.67/8.14 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:02:36.343 17.67/8.14 !MESSAGE The workspace will exit with unsaved changes in this session. 17.67/8.14 Received shutdown request... 17.67/8.14 Ultimate: 17.67/8.14 GTK+ Version Check 17.67/8.14 EOF