19.23/8.62 YES 19.23/8.62 19.23/8.62 Ultimate: Cannot open display: 19.23/8.62 This is Ultimate 0.1.24-8dc7c08-m 19.23/8.62 [2019-03-28 12:34:15,234 INFO L170 SettingsManager]: Resetting all preferences to default values... 19.23/8.62 [2019-03-28 12:34:15,237 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 19.23/8.62 [2019-03-28 12:34:15,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 19.23/8.62 [2019-03-28 12:34:15,249 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 19.23/8.62 [2019-03-28 12:34:15,250 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 19.23/8.62 [2019-03-28 12:34:15,251 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 19.23/8.62 [2019-03-28 12:34:15,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 19.23/8.62 [2019-03-28 12:34:15,254 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 19.23/8.62 [2019-03-28 12:34:15,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 19.23/8.62 [2019-03-28 12:34:15,256 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 19.23/8.62 [2019-03-28 12:34:15,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 19.23/8.62 [2019-03-28 12:34:15,257 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 19.23/8.62 [2019-03-28 12:34:15,258 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 19.23/8.62 [2019-03-28 12:34:15,259 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 19.23/8.62 [2019-03-28 12:34:15,260 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 19.23/8.62 [2019-03-28 12:34:15,261 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 19.23/8.62 [2019-03-28 12:34:15,262 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 19.23/8.62 [2019-03-28 12:34:15,264 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 19.23/8.62 [2019-03-28 12:34:15,266 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 19.23/8.62 [2019-03-28 12:34:15,267 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 19.23/8.62 [2019-03-28 12:34:15,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 19.23/8.62 [2019-03-28 12:34:15,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 19.23/8.62 [2019-03-28 12:34:15,271 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 19.23/8.62 [2019-03-28 12:34:15,271 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 19.23/8.62 [2019-03-28 12:34:15,272 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 19.23/8.62 [2019-03-28 12:34:15,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 19.23/8.62 [2019-03-28 12:34:15,274 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 19.23/8.62 [2019-03-28 12:34:15,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 19.23/8.62 [2019-03-28 12:34:15,275 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 19.23/8.62 [2019-03-28 12:34:15,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 19.23/8.62 [2019-03-28 12:34:15,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 19.23/8.62 [2019-03-28 12:34:15,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 19.23/8.62 [2019-03-28 12:34:15,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 19.23/8.62 [2019-03-28 12:34:15,278 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 19.23/8.62 [2019-03-28 12:34:15,278 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 19.23/8.62 [2019-03-28 12:34:15,278 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 19.23/8.62 [2019-03-28 12:34:15,279 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 19.23/8.62 [2019-03-28 12:34:15,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 19.23/8.62 [2019-03-28 12:34:15,280 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 19.23/8.62 [2019-03-28 12:34:15,295 INFO L110 SettingsManager]: Loading preferences was successful 19.23/8.62 [2019-03-28 12:34:15,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 19.23/8.62 [2019-03-28 12:34:15,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 19.23/8.62 [2019-03-28 12:34:15,297 INFO L133 SettingsManager]: * Rewrite not-equals=true 19.23/8.62 [2019-03-28 12:34:15,297 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 19.23/8.62 [2019-03-28 12:34:15,297 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 19.23/8.62 [2019-03-28 12:34:15,298 INFO L133 SettingsManager]: * Use SBE=true 19.23/8.62 [2019-03-28 12:34:15,298 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 19.23/8.62 [2019-03-28 12:34:15,298 INFO L133 SettingsManager]: * Use old map elimination=false 19.23/8.62 [2019-03-28 12:34:15,298 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 19.23/8.62 [2019-03-28 12:34:15,298 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 19.23/8.62 [2019-03-28 12:34:15,298 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 19.23/8.62 [2019-03-28 12:34:15,299 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 19.23/8.62 [2019-03-28 12:34:15,299 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 19.23/8.62 [2019-03-28 12:34:15,299 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.23/8.62 [2019-03-28 12:34:15,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 19.23/8.62 [2019-03-28 12:34:15,299 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 19.23/8.62 [2019-03-28 12:34:15,299 INFO L133 SettingsManager]: * Check division by zero=IGNORE 19.23/8.62 [2019-03-28 12:34:15,300 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 19.23/8.62 [2019-03-28 12:34:15,300 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 19.23/8.62 [2019-03-28 12:34:15,300 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 19.23/8.62 [2019-03-28 12:34:15,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 19.23/8.62 [2019-03-28 12:34:15,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 19.23/8.62 [2019-03-28 12:34:15,301 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 19.23/8.62 [2019-03-28 12:34:15,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.23/8.62 [2019-03-28 12:34:15,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 19.23/8.62 [2019-03-28 12:34:15,301 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 19.23/8.62 [2019-03-28 12:34:15,301 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 19.23/8.62 [2019-03-28 12:34:15,301 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 19.23/8.62 [2019-03-28 12:34:15,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 19.23/8.62 [2019-03-28 12:34:15,342 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 19.23/8.62 [2019-03-28 12:34:15,346 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 19.23/8.62 [2019-03-28 12:34:15,348 INFO L271 PluginConnector]: Initializing CDTParser... 19.23/8.62 [2019-03-28 12:34:15,348 INFO L276 PluginConnector]: CDTParser initialized 19.23/8.62 [2019-03-28 12:34:15,349 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 19.23/8.62 [2019-03-28 12:34:15,421 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/7996fd0c47c049929f052fcbc05f8aaf/FLAGbcabd8592 19.23/8.62 [2019-03-28 12:34:15,772 INFO L307 CDTParser]: Found 1 translation units. 19.23/8.62 [2019-03-28 12:34:15,773 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 19.23/8.62 [2019-03-28 12:34:15,773 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 19.23/8.62 [2019-03-28 12:34:15,780 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/7996fd0c47c049929f052fcbc05f8aaf/FLAGbcabd8592 19.23/8.62 [2019-03-28 12:34:16,166 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/7996fd0c47c049929f052fcbc05f8aaf 19.23/8.62 [2019-03-28 12:34:16,177 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 19.23/8.62 [2019-03-28 12:34:16,179 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 19.23/8.62 [2019-03-28 12:34:16,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 19.23/8.62 [2019-03-28 12:34:16,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 19.23/8.62 [2019-03-28 12:34:16,184 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 19.23/8.62 [2019-03-28 12:34:16,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:34:16" (1/1) ... 19.23/8.62 [2019-03-28 12:34:16,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7735bca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:16, skipping insertion in model container 19.23/8.62 [2019-03-28 12:34:16,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:34:16" (1/1) ... 19.23/8.62 [2019-03-28 12:34:16,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 19.23/8.62 [2019-03-28 12:34:16,214 INFO L176 MainTranslator]: Built tables and reachable declarations 19.23/8.62 [2019-03-28 12:34:16,381 INFO L206 PostProcessor]: Analyzing one entry point: main 19.23/8.62 [2019-03-28 12:34:16,393 INFO L191 MainTranslator]: Completed pre-run 19.23/8.62 [2019-03-28 12:34:16,474 INFO L206 PostProcessor]: Analyzing one entry point: main 19.23/8.62 [2019-03-28 12:34:16,491 INFO L195 MainTranslator]: Completed translation 19.23/8.62 [2019-03-28 12:34:16,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:16 WrapperNode 19.23/8.62 [2019-03-28 12:34:16,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 19.23/8.62 [2019-03-28 12:34:16,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 19.23/8.62 [2019-03-28 12:34:16,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 19.23/8.62 [2019-03-28 12:34:16,493 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 19.23/8.62 [2019-03-28 12:34:16,503 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:34:16" (1/1) ... 19.23/8.62 [2019-03-28 12:34:16,512 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:34:16" (1/1) ... 19.23/8.62 [2019-03-28 12:34:16,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 19.23/8.62 [2019-03-28 12:34:16,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 19.23/8.62 [2019-03-28 12:34:16,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 19.23/8.62 [2019-03-28 12:34:16,536 INFO L276 PluginConnector]: Boogie Preprocessor initialized 19.23/8.62 [2019-03-28 12:34:16,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:16" (1/1) ... 19.23/8.62 [2019-03-28 12:34:16,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:16" (1/1) ... 19.23/8.62 [2019-03-28 12:34:16,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:16" (1/1) ... 19.23/8.62 [2019-03-28 12:34:16,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:16" (1/1) ... 19.23/8.62 [2019-03-28 12:34:16,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:16" (1/1) ... 19.23/8.62 [2019-03-28 12:34:16,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:16" (1/1) ... 19.23/8.62 [2019-03-28 12:34:16,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:16" (1/1) ... 19.23/8.62 [2019-03-28 12:34:16,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 19.23/8.62 [2019-03-28 12:34:16,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 19.23/8.62 [2019-03-28 12:34:16,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... 19.23/8.62 [2019-03-28 12:34:16,563 INFO L276 PluginConnector]: RCFGBuilder initialized 19.23/8.62 [2019-03-28 12:34:16,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:16" (1/1) ... 19.23/8.62 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.23/8.62 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 19.23/8.62 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.23/8.62 [2019-03-28 12:34:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 19.23/8.62 [2019-03-28 12:34:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 19.23/8.62 [2019-03-28 12:34:16,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 19.23/8.62 [2019-03-28 12:34:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 19.23/8.62 [2019-03-28 12:34:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 19.23/8.62 [2019-03-28 12:34:16,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 19.23/8.62 [2019-03-28 12:34:16,906 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 19.23/8.62 [2019-03-28 12:34:16,906 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 19.23/8.62 [2019-03-28 12:34:16,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:16 BoogieIcfgContainer 19.23/8.62 [2019-03-28 12:34:16,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 19.23/8.62 [2019-03-28 12:34:16,909 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 19.23/8.62 [2019-03-28 12:34:16,909 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 19.23/8.62 [2019-03-28 12:34:16,911 INFO L276 PluginConnector]: BlockEncodingV2 initialized 19.23/8.62 [2019-03-28 12:34:16,914 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:16" (1/1) ... 19.23/8.62 [2019-03-28 12:34:16,933 INFO L313 BlockEncoder]: Initial Icfg 33 locations, 38 edges 19.23/8.62 [2019-03-28 12:34:16,934 INFO L258 BlockEncoder]: Using Remove infeasible edges 19.23/8.62 [2019-03-28 12:34:16,935 INFO L263 BlockEncoder]: Using Maximize final states 19.23/8.62 [2019-03-28 12:34:16,936 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 19.23/8.62 [2019-03-28 12:34:16,936 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 19.23/8.62 [2019-03-28 12:34:16,938 INFO L296 BlockEncoder]: Using Remove sink states 19.23/8.62 [2019-03-28 12:34:16,939 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 19.23/8.62 [2019-03-28 12:34:16,939 INFO L179 BlockEncoder]: Using Rewrite not-equals 19.23/8.62 [2019-03-28 12:34:16,963 INFO L185 BlockEncoder]: Using Use SBE 19.23/8.62 [2019-03-28 12:34:16,989 INFO L200 BlockEncoder]: SBE split 13 edges 19.23/8.62 [2019-03-28 12:34:16,994 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 19.23/8.62 [2019-03-28 12:34:16,996 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.23/8.62 [2019-03-28 12:34:17,030 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 19.23/8.62 [2019-03-28 12:34:17,032 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 19.23/8.62 [2019-03-28 12:34:17,034 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 19.23/8.62 [2019-03-28 12:34:17,034 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.23/8.62 [2019-03-28 12:34:17,035 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 19.23/8.62 [2019-03-28 12:34:17,035 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 19.23/8.62 [2019-03-28 12:34:17,035 INFO L313 BlockEncoder]: Encoded RCFG 25 locations, 41 edges 19.23/8.62 [2019-03-28 12:34:17,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:17 BasicIcfg 19.23/8.62 [2019-03-28 12:34:17,036 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 19.23/8.62 [2019-03-28 12:34:17,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 19.23/8.62 [2019-03-28 12:34:17,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... 19.23/8.62 [2019-03-28 12:34:17,041 INFO L276 PluginConnector]: TraceAbstraction initialized 19.23/8.62 [2019-03-28 12:34:17,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:34:16" (1/4) ... 19.23/8.62 [2019-03-28 12:34:17,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e351df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:34:17, skipping insertion in model container 19.23/8.62 [2019-03-28 12:34:17,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:16" (2/4) ... 19.23/8.62 [2019-03-28 12:34:17,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e351df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:34:17, skipping insertion in model container 19.23/8.62 [2019-03-28 12:34:17,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:16" (3/4) ... 19.23/8.62 [2019-03-28 12:34:17,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e351df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:17, skipping insertion in model container 19.23/8.62 [2019-03-28 12:34:17,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:17" (4/4) ... 19.23/8.62 [2019-03-28 12:34:17,045 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.23/8.62 [2019-03-28 12:34:17,055 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 19.23/8.62 [2019-03-28 12:34:17,063 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. 19.23/8.62 [2019-03-28 12:34:17,081 INFO L257 AbstractCegarLoop]: Starting to check reachability of 12 error locations. 19.23/8.62 [2019-03-28 12:34:17,109 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.23/8.62 [2019-03-28 12:34:17,110 INFO L382 AbstractCegarLoop]: Interprodecural is true 19.23/8.62 [2019-03-28 12:34:17,110 INFO L383 AbstractCegarLoop]: Hoare is true 19.23/8.62 [2019-03-28 12:34:17,110 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 19.23/8.62 [2019-03-28 12:34:17,111 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 19.23/8.62 [2019-03-28 12:34:17,111 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.23/8.62 [2019-03-28 12:34:17,111 INFO L387 AbstractCegarLoop]: Difference is false 19.23/8.62 [2019-03-28 12:34:17,111 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 19.23/8.62 [2019-03-28 12:34:17,111 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 19.23/8.62 [2019-03-28 12:34:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. 19.23/8.62 [2019-03-28 12:34:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 19.23/8.62 [2019-03-28 12:34:17,133 INFO L394 BasicCegarLoop]: Found error trace 19.23/8.62 [2019-03-28 12:34:17,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 19.23/8.62 [2019-03-28 12:34:17,134 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 19.23/8.62 [2019-03-28 12:34:17,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.62 [2019-03-28 12:34:17,139 INFO L82 PathProgramCache]: Analyzing trace with hash 841575624, now seen corresponding path program 1 times 19.23/8.62 [2019-03-28 12:34:17,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.62 [2019-03-28 12:34:17,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.62 [2019-03-28 12:34:17,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:17,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:17,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.23/8.62 [2019-03-28 12:34:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.23/8.62 [2019-03-28 12:34:17,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.23/8.62 [2019-03-28 12:34:17,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.23/8.62 [2019-03-28 12:34:17,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.23/8.62 [2019-03-28 12:34:17,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.23/8.62 [2019-03-28 12:34:17,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.23/8.62 [2019-03-28 12:34:17,334 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. 19.23/8.62 [2019-03-28 12:34:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.23/8.62 [2019-03-28 12:34:17,434 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. 19.23/8.62 [2019-03-28 12:34:17,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.23/8.62 [2019-03-28 12:34:17,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 19.23/8.62 [2019-03-28 12:34:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.23/8.62 [2019-03-28 12:34:17,448 INFO L225 Difference]: With dead ends: 25 19.23/8.62 [2019-03-28 12:34:17,448 INFO L226 Difference]: Without dead ends: 19 19.23/8.62 [2019-03-28 12:34:17,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.23/8.62 [2019-03-28 12:34:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 19.23/8.62 [2019-03-28 12:34:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. 19.23/8.62 [2019-03-28 12:34:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. 19.23/8.62 [2019-03-28 12:34:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. 19.23/8.62 [2019-03-28 12:34:17,488 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 6 19.23/8.62 [2019-03-28 12:34:17,488 INFO L84 Accepts]: Finished accepts. word is rejected. 19.23/8.62 [2019-03-28 12:34:17,489 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. 19.23/8.62 [2019-03-28 12:34:17,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.23/8.62 [2019-03-28 12:34:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. 19.23/8.62 [2019-03-28 12:34:17,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 19.23/8.62 [2019-03-28 12:34:17,490 INFO L394 BasicCegarLoop]: Found error trace 19.23/8.62 [2019-03-28 12:34:17,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 19.23/8.62 [2019-03-28 12:34:17,490 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 19.23/8.62 [2019-03-28 12:34:17,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.62 [2019-03-28 12:34:17,490 INFO L82 PathProgramCache]: Analyzing trace with hash 841575626, now seen corresponding path program 1 times 19.23/8.62 [2019-03-28 12:34:17,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.62 [2019-03-28 12:34:17,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.62 [2019-03-28 12:34:17,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:17,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:17,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.23/8.62 [2019-03-28 12:34:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.23/8.62 [2019-03-28 12:34:17,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.23/8.62 [2019-03-28 12:34:17,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 19.23/8.62 [2019-03-28 12:34:17,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 19.23/8.62 [2019-03-28 12:34:17,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 19.23/8.62 [2019-03-28 12:34:17,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 19.23/8.62 [2019-03-28 12:34:17,532 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand 4 states. 19.23/8.62 [2019-03-28 12:34:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.23/8.62 [2019-03-28 12:34:17,648 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. 19.23/8.62 [2019-03-28 12:34:17,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 19.23/8.62 [2019-03-28 12:34:17,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 19.23/8.62 [2019-03-28 12:34:17,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.23/8.62 [2019-03-28 12:34:17,649 INFO L225 Difference]: With dead ends: 41 19.23/8.62 [2019-03-28 12:34:17,649 INFO L226 Difference]: Without dead ends: 35 19.23/8.62 [2019-03-28 12:34:17,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 19.23/8.62 [2019-03-28 12:34:17,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 19.23/8.62 [2019-03-28 12:34:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. 19.23/8.62 [2019-03-28 12:34:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 19.23/8.62 [2019-03-28 12:34:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. 19.23/8.62 [2019-03-28 12:34:17,657 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 6 19.23/8.62 [2019-03-28 12:34:17,657 INFO L84 Accepts]: Finished accepts. word is rejected. 19.23/8.62 [2019-03-28 12:34:17,657 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 45 transitions. 19.23/8.62 [2019-03-28 12:34:17,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 19.23/8.62 [2019-03-28 12:34:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 45 transitions. 19.23/8.62 [2019-03-28 12:34:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 19.23/8.62 [2019-03-28 12:34:17,658 INFO L394 BasicCegarLoop]: Found error trace 19.23/8.62 [2019-03-28 12:34:17,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 19.23/8.62 [2019-03-28 12:34:17,658 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 19.23/8.62 [2019-03-28 12:34:17,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.62 [2019-03-28 12:34:17,659 INFO L82 PathProgramCache]: Analyzing trace with hash 841575627, now seen corresponding path program 1 times 19.23/8.62 [2019-03-28 12:34:17,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.62 [2019-03-28 12:34:17,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.62 [2019-03-28 12:34:17,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:17,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:17,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.23/8.62 [2019-03-28 12:34:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.23/8.62 [2019-03-28 12:34:17,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.23/8.62 [2019-03-28 12:34:17,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 19.23/8.62 [2019-03-28 12:34:17,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 19.23/8.62 [2019-03-28 12:34:17,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 19.23/8.62 [2019-03-28 12:34:17,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 19.23/8.62 [2019-03-28 12:34:17,714 INFO L87 Difference]: Start difference. First operand 27 states and 45 transitions. Second operand 4 states. 19.23/8.62 [2019-03-28 12:34:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.23/8.62 [2019-03-28 12:34:17,791 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. 19.23/8.62 [2019-03-28 12:34:17,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 19.23/8.62 [2019-03-28 12:34:17,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 19.23/8.62 [2019-03-28 12:34:17,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.23/8.62 [2019-03-28 12:34:17,795 INFO L225 Difference]: With dead ends: 33 19.23/8.62 [2019-03-28 12:34:17,795 INFO L226 Difference]: Without dead ends: 27 19.23/8.62 [2019-03-28 12:34:17,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 19.23/8.62 [2019-03-28 12:34:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 19.23/8.62 [2019-03-28 12:34:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 19.23/8.62 [2019-03-28 12:34:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 19.23/8.62 [2019-03-28 12:34:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. 19.23/8.62 [2019-03-28 12:34:17,801 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 6 19.23/8.62 [2019-03-28 12:34:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. 19.23/8.62 [2019-03-28 12:34:17,802 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. 19.23/8.62 [2019-03-28 12:34:17,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 19.23/8.62 [2019-03-28 12:34:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. 19.23/8.62 [2019-03-28 12:34:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 19.23/8.62 [2019-03-28 12:34:17,803 INFO L394 BasicCegarLoop]: Found error trace 19.23/8.62 [2019-03-28 12:34:17,803 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 19.23/8.62 [2019-03-28 12:34:17,803 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 19.23/8.62 [2019-03-28 12:34:17,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.62 [2019-03-28 12:34:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash 808207579, now seen corresponding path program 1 times 19.23/8.62 [2019-03-28 12:34:17,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.62 [2019-03-28 12:34:17,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.62 [2019-03-28 12:34:17,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:17,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:17,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.23/8.62 [2019-03-28 12:34:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.23/8.62 [2019-03-28 12:34:17,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.23/8.62 [2019-03-28 12:34:17,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 19.23/8.62 [2019-03-28 12:34:17,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 19.23/8.62 [2019-03-28 12:34:17,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 19.23/8.62 [2019-03-28 12:34:17,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 19.23/8.62 [2019-03-28 12:34:17,859 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. 19.23/8.62 [2019-03-28 12:34:17,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.23/8.62 [2019-03-28 12:34:17,916 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. 19.23/8.62 [2019-03-28 12:34:17,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 19.23/8.62 [2019-03-28 12:34:17,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 19.23/8.62 [2019-03-28 12:34:17,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.23/8.62 [2019-03-28 12:34:17,917 INFO L225 Difference]: With dead ends: 29 19.23/8.62 [2019-03-28 12:34:17,917 INFO L226 Difference]: Without dead ends: 0 19.23/8.62 [2019-03-28 12:34:17,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 19.23/8.62 [2019-03-28 12:34:17,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 19.23/8.62 [2019-03-28 12:34:17,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 19.23/8.62 [2019-03-28 12:34:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 19.23/8.62 [2019-03-28 12:34:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 19.23/8.62 [2019-03-28 12:34:17,919 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 19.23/8.62 [2019-03-28 12:34:17,919 INFO L84 Accepts]: Finished accepts. word is rejected. 19.23/8.62 [2019-03-28 12:34:17,919 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 19.23/8.62 [2019-03-28 12:34:17,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 19.23/8.62 [2019-03-28 12:34:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 19.23/8.62 [2019-03-28 12:34:17,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 19.23/8.62 [2019-03-28 12:34:17,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 19.23/8.62 [2019-03-28 12:34:17,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,983 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,983 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,983 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,983 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,983 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,983 INFO L448 ceAbstractionStarter]: For program point L11-2(lines 11 15) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,984 INFO L444 ceAbstractionStarter]: At program point L9-3(lines 9 17) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_bubbleSort_~numbers.base) 1) (= ULTIMATE.start_bubbleSort_~numbers.offset 0) (<= (+ (* 4 ULTIMATE.start_bubbleSort_~i~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base))) 19.23/8.62 [2019-03-28 12:34:17,984 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,984 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,984 INFO L448 ceAbstractionStarter]: For program point L22-2(lines 22 24) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,984 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,985 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,985 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,985 INFO L448 ceAbstractionStarter]: For program point L10-2(lines 10 16) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,985 INFO L444 ceAbstractionStarter]: At program point L10-3(lines 10 16) the Hoare annotation is: (let ((.cse0 (= (select |#valid| ULTIMATE.start_bubbleSort_~numbers.base) 1)) (.cse1 (= ULTIMATE.start_bubbleSort_~numbers.offset 0)) (.cse2 (<= (+ (* 4 ULTIMATE.start_bubbleSort_~i~0) 4) (select |#length| ULTIMATE.start_bubbleSort_~numbers.base)))) (or (and (<= 8 (+ ULTIMATE.start_bubbleSort_~numbers.offset (* 4 ULTIMATE.start_bubbleSort_~j~0))) .cse0 .cse1 .cse2) (and .cse0 (= ULTIMATE.start_bubbleSort_~j~0 1) .cse1 .cse2))) 19.23/8.62 [2019-03-28 12:34:17,985 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,985 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 19.23/8.62 [2019-03-28 12:34:17,986 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 19.23/8.62 [2019-03-28 12:34:17,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.23/8.62 [2019-03-28 12:34:18,001 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.23/8.62 [2019-03-28 12:34:18,003 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.23/8.62 [2019-03-28 12:34:18,003 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.23/8.62 [2019-03-28 12:34:18,004 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.23/8.62 [2019-03-28 12:34:18,005 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.23/8.62 [2019-03-28 12:34:18,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:18 BasicIcfg 19.23/8.62 [2019-03-28 12:34:18,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 19.23/8.62 [2019-03-28 12:34:18,007 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 19.23/8.62 [2019-03-28 12:34:18,007 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 19.23/8.62 [2019-03-28 12:34:18,011 INFO L276 PluginConnector]: BuchiAutomizer initialized 19.23/8.62 [2019-03-28 12:34:18,012 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.23/8.62 [2019-03-28 12:34:18,012 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:34:16" (1/5) ... 19.23/8.62 [2019-03-28 12:34:18,012 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@653f0b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:34:18, skipping insertion in model container 19.23/8.62 [2019-03-28 12:34:18,013 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.23/8.62 [2019-03-28 12:34:18,013 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:16" (2/5) ... 19.23/8.62 [2019-03-28 12:34:18,013 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@653f0b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:34:18, skipping insertion in model container 19.23/8.62 [2019-03-28 12:34:18,013 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.23/8.62 [2019-03-28 12:34:18,013 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:16" (3/5) ... 19.23/8.62 [2019-03-28 12:34:18,014 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@653f0b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:18, skipping insertion in model container 19.23/8.62 [2019-03-28 12:34:18,014 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.23/8.62 [2019-03-28 12:34:18,014 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:17" (4/5) ... 19.23/8.62 [2019-03-28 12:34:18,014 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@653f0b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:18, skipping insertion in model container 19.23/8.62 [2019-03-28 12:34:18,014 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.23/8.62 [2019-03-28 12:34:18,015 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:18" (5/5) ... 19.23/8.62 [2019-03-28 12:34:18,016 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.23/8.62 [2019-03-28 12:34:18,037 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.23/8.62 [2019-03-28 12:34:18,037 INFO L374 BuchiCegarLoop]: Interprodecural is true 19.23/8.62 [2019-03-28 12:34:18,038 INFO L375 BuchiCegarLoop]: Hoare is true 19.23/8.62 [2019-03-28 12:34:18,038 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 19.23/8.62 [2019-03-28 12:34:18,038 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 19.23/8.62 [2019-03-28 12:34:18,038 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.23/8.62 [2019-03-28 12:34:18,038 INFO L379 BuchiCegarLoop]: Difference is false 19.23/8.62 [2019-03-28 12:34:18,038 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 19.23/8.62 [2019-03-28 12:34:18,038 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 19.23/8.62 [2019-03-28 12:34:18,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. 19.23/8.62 [2019-03-28 12:34:18,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 19.23/8.62 [2019-03-28 12:34:18,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.23/8.62 [2019-03-28 12:34:18,048 INFO L119 BuchiIsEmpty]: Starting construction of run 19.23/8.62 [2019-03-28 12:34:18,052 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 19.23/8.62 [2019-03-28 12:34:18,052 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 19.23/8.62 [2019-03-28 12:34:18,052 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 19.23/8.62 [2019-03-28 12:34:18,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. 19.23/8.62 [2019-03-28 12:34:18,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 19.23/8.62 [2019-03-28 12:34:18,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.23/8.62 [2019-03-28 12:34:18,055 INFO L119 BuchiIsEmpty]: Starting construction of run 19.23/8.62 [2019-03-28 12:34:18,055 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 19.23/8.62 [2019-03-28 12:34:18,055 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 19.23/8.62 [2019-03-28 12:34:18,060 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue [145] ULTIMATE.startENTRY-->L22: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 23#L22true [94] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 5#L22-2true [120] L22-2-->L9-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_bubbleSort_~i~0_1 (+ v_ULTIMATE.start_bubbleSort_~array_size_1 (- 1))) (= |v_ULTIMATE.start_bubbleSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_bubbleSort_~array_size_1 |v_ULTIMATE.start_bubbleSort_#in~array_size_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_bubbleSort_~numbers.offset_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_bubbleSort_~numbers.base_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_bubbleSort_#in~array_size=|v_ULTIMATE.start_bubbleSort_#in~array_size_1|, ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_1, ULTIMATE.start_bubbleSort_#in~numbers.offset=|v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_1, ULTIMATE.start_bubbleSort_~temp~0=v_ULTIMATE.start_bubbleSort_~temp~0_1, ULTIMATE.start_bubbleSort_#t~mem4=|v_ULTIMATE.start_bubbleSort_#t~mem4_1|, ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_1, ULTIMATE.start_bubbleSort_#t~mem5=|v_ULTIMATE.start_bubbleSort_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_1|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_1|, ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_1|, ULTIMATE.start_bubbleSort_#in~numbers.base=|v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_bubbleSort_~array_size=v_ULTIMATE.start_bubbleSort_~array_size_1, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_bubbleSort_#in~array_size, ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#in~numbers.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_bubbleSort_~numbers.base, ULTIMATE.start_bubbleSort_~temp~0, ULTIMATE.start_bubbleSort_#t~mem4, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_#t~mem5, ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3, ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_#in~numbers.base, ULTIMATE.start_bubbleSort_~j~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_bubbleSort_~array_size, ULTIMATE.start_bubbleSort_#t~post0] 3#L9-3true 19.23/8.62 [2019-03-28 12:34:18,061 INFO L796 eck$LassoCheckResult]: Loop: 3#L9-3true [68] L9-3-->L10-3: Formula: (and (= v_ULTIMATE.start_bubbleSort_~j~0_3 1) (<= 0 v_ULTIMATE.start_bubbleSort_~i~0_5)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~j~0] 15#L10-3true [147] L10-3-->L9-3: Formula: (and (< v_ULTIMATE.start_bubbleSort_~i~0_12 v_ULTIMATE.start_bubbleSort_~j~0_20) (= (+ v_ULTIMATE.start_bubbleSort_~i~0_11 1) v_ULTIMATE.start_bubbleSort_~i~0_12)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_12, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_20} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_11, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_20, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#t~post0] 3#L9-3true 19.23/8.62 [2019-03-28 12:34:18,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.62 [2019-03-28 12:34:18,061 INFO L82 PathProgramCache]: Analyzing trace with hash 172170, now seen corresponding path program 1 times 19.23/8.62 [2019-03-28 12:34:18,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.62 [2019-03-28 12:34:18,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.62 [2019-03-28 12:34:18,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:18,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:18,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.62 [2019-03-28 12:34:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.62 [2019-03-28 12:34:18,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.62 [2019-03-28 12:34:18,099 INFO L82 PathProgramCache]: Analyzing trace with hash 3216, now seen corresponding path program 1 times 19.23/8.62 [2019-03-28 12:34:18,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.62 [2019-03-28 12:34:18,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.62 [2019-03-28 12:34:18,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:18,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:18,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.62 [2019-03-28 12:34:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.62 [2019-03-28 12:34:18,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.62 [2019-03-28 12:34:18,106 INFO L82 PathProgramCache]: Analyzing trace with hash 165457625, now seen corresponding path program 1 times 19.23/8.62 [2019-03-28 12:34:18,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.62 [2019-03-28 12:34:18,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.62 [2019-03-28 12:34:18,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:18,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:18,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.62 [2019-03-28 12:34:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.62 [2019-03-28 12:34:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.62 [2019-03-28 12:34:18,156 INFO L216 LassoAnalysis]: Preferences: 19.23/8.62 [2019-03-28 12:34:18,157 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.23/8.62 [2019-03-28 12:34:18,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.23/8.62 [2019-03-28 12:34:18,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.23/8.62 [2019-03-28 12:34:18,158 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.23/8.62 [2019-03-28 12:34:18,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.23/8.62 [2019-03-28 12:34:18,158 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.23/8.62 [2019-03-28 12:34:18,158 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.23/8.62 [2019-03-28 12:34:18,158 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 19.23/8.62 [2019-03-28 12:34:18,159 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.23/8.62 [2019-03-28 12:34:18,159 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.23/8.62 [2019-03-28 12:34:18,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.62 [2019-03-28 12:34:18,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.62 [2019-03-28 12:34:18,240 INFO L300 LassoAnalysis]: Preprocessing complete. 19.23/8.62 [2019-03-28 12:34:18,241 INFO L412 LassoAnalysis]: Checking for nontermination... 19.23/8.62 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.23/8.62 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.23/8.62 Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.23/8.62 [2019-03-28 12:34:18,248 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.23/8.62 [2019-03-28 12:34:18,249 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.23/8.62 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.23/8.62 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.23/8.62 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.23/8.62 [2019-03-28 12:34:18,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.23/8.62 [2019-03-28 12:34:18,283 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.23/8.62 [2019-03-28 12:34:18,319 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.23/8.62 [2019-03-28 12:34:18,321 INFO L216 LassoAnalysis]: Preferences: 19.23/8.62 [2019-03-28 12:34:18,322 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.23/8.62 [2019-03-28 12:34:18,322 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.23/8.62 [2019-03-28 12:34:18,322 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.23/8.62 [2019-03-28 12:34:18,322 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.23/8.62 [2019-03-28 12:34:18,322 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.23/8.62 [2019-03-28 12:34:18,322 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.23/8.62 [2019-03-28 12:34:18,322 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.23/8.62 [2019-03-28 12:34:18,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop 19.23/8.62 [2019-03-28 12:34:18,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.23/8.62 [2019-03-28 12:34:18,323 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.23/8.62 [2019-03-28 12:34:18,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.62 [2019-03-28 12:34:18,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.62 [2019-03-28 12:34:18,383 INFO L300 LassoAnalysis]: Preprocessing complete. 19.23/8.62 [2019-03-28 12:34:18,389 INFO L497 LassoAnalysis]: Using template 'affine'. 19.23/8.62 [2019-03-28 12:34:18,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.23/8.62 Termination analysis: LINEAR_WITH_GUESSES 19.23/8.62 Number of strict supporting invariants: 0 19.23/8.62 Number of non-strict supporting invariants: 1 19.23/8.62 Consider only non-deceasing supporting invariants: true 19.23/8.62 Simplify termination arguments: true 19.23/8.62 Simplify supporting invariants: trueOverapproximate stem: false 19.23/8.62 [2019-03-28 12:34:18,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.23/8.62 [2019-03-28 12:34:18,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.23/8.62 [2019-03-28 12:34:18,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.23/8.62 [2019-03-28 12:34:18,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.23/8.62 [2019-03-28 12:34:18,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.23/8.62 [2019-03-28 12:34:18,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.23/8.62 [2019-03-28 12:34:18,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.23/8.62 [2019-03-28 12:34:18,403 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.23/8.62 [2019-03-28 12:34:18,410 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.23/8.62 [2019-03-28 12:34:18,410 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 19.23/8.62 [2019-03-28 12:34:18,412 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.23/8.62 [2019-03-28 12:34:18,412 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.23/8.62 [2019-03-28 12:34:18,413 INFO L518 LassoAnalysis]: Proved termination. 19.23/8.62 [2019-03-28 12:34:18,413 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.23/8.62 Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 19.23/8.62 Supporting invariants [] 19.23/8.62 [2019-03-28 12:34:18,415 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.23/8.62 [2019-03-28 12:34:18,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.62 [2019-03-28 12:34:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.23/8.62 [2019-03-28 12:34:18,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core 19.23/8.62 [2019-03-28 12:34:18,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.23/8.62 [2019-03-28 12:34:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.23/8.62 [2019-03-28 12:34:18,463 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 19.23/8.62 [2019-03-28 12:34:18,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.23/8.62 [2019-03-28 12:34:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.23/8.62 [2019-03-28 12:34:18,486 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 19.23/8.62 [2019-03-28 12:34:18,489 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 19.23/8.62 [2019-03-28 12:34:18,490 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 25 states. Second operand 3 states. 19.23/8.62 [2019-03-28 12:34:18,608 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 25 states.. Second operand 3 states. Result 70 states and 115 transitions. Complement of second has 4 states. 19.23/8.62 [2019-03-28 12:34:18,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 19.23/8.62 [2019-03-28 12:34:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 19.23/8.62 [2019-03-28 12:34:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. 19.23/8.62 [2019-03-28 12:34:18,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 3 letters. Loop has 2 letters. 19.23/8.62 [2019-03-28 12:34:18,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.23/8.62 [2019-03-28 12:34:18,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 5 letters. Loop has 2 letters. 19.23/8.62 [2019-03-28 12:34:18,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.23/8.62 [2019-03-28 12:34:18,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 3 letters. Loop has 4 letters. 19.23/8.62 [2019-03-28 12:34:18,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.23/8.62 [2019-03-28 12:34:18,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 115 transitions. 19.23/8.62 [2019-03-28 12:34:18,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 19.23/8.62 [2019-03-28 12:34:18,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 34 states and 43 transitions. 19.23/8.63 [2019-03-28 12:34:18,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 19.23/8.63 [2019-03-28 12:34:18,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 19.23/8.63 [2019-03-28 12:34:18,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. 19.23/8.63 [2019-03-28 12:34:18,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.23/8.63 [2019-03-28 12:34:18,630 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. 19.23/8.63 [2019-03-28 12:34:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. 19.23/8.63 [2019-03-28 12:34:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. 19.23/8.63 [2019-03-28 12:34:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. 19.23/8.63 [2019-03-28 12:34:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. 19.23/8.63 [2019-03-28 12:34:18,634 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. 19.23/8.63 [2019-03-28 12:34:18,634 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. 19.23/8.63 [2019-03-28 12:34:18,634 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 19.23/8.63 [2019-03-28 12:34:18,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. 19.23/8.63 [2019-03-28 12:34:18,635 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 19.23/8.63 [2019-03-28 12:34:18,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.23/8.63 [2019-03-28 12:34:18,636 INFO L119 BuchiIsEmpty]: Starting construction of run 19.23/8.63 [2019-03-28 12:34:18,636 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] 19.23/8.63 [2019-03-28 12:34:18,637 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] 19.23/8.63 [2019-03-28 12:34:18,637 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L22: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 153#L22 [94] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 147#L22-2 [119] L22-2-->L9-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_bubbleSort_~i~0_1 (+ v_ULTIMATE.start_bubbleSort_~array_size_1 (- 1))) (= |v_ULTIMATE.start_bubbleSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_bubbleSort_~array_size_1 |v_ULTIMATE.start_bubbleSort_#in~array_size_1|) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_bubbleSort_~numbers.offset_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (= v_ULTIMATE.start_bubbleSort_~numbers.base_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_bubbleSort_#in~array_size=|v_ULTIMATE.start_bubbleSort_#in~array_size_1|, ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_1, ULTIMATE.start_bubbleSort_#in~numbers.offset=|v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_1, ULTIMATE.start_bubbleSort_~temp~0=v_ULTIMATE.start_bubbleSort_~temp~0_1, ULTIMATE.start_bubbleSort_#t~mem4=|v_ULTIMATE.start_bubbleSort_#t~mem4_1|, ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_1, ULTIMATE.start_bubbleSort_#t~mem5=|v_ULTIMATE.start_bubbleSort_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_1|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_1|, ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_1|, ULTIMATE.start_bubbleSort_#in~numbers.base=|v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_bubbleSort_~array_size=v_ULTIMATE.start_bubbleSort_~array_size_1, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_bubbleSort_#in~array_size, ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#in~numbers.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_bubbleSort_~numbers.base, ULTIMATE.start_bubbleSort_~temp~0, ULTIMATE.start_bubbleSort_#t~mem4, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_#t~mem5, ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3, ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_#in~numbers.base, ULTIMATE.start_bubbleSort_~j~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_bubbleSort_~array_size, ULTIMATE.start_bubbleSort_#t~post0] 134#L9-3 19.23/8.63 [2019-03-28 12:34:18,637 INFO L796 eck$LassoCheckResult]: Loop: 134#L9-3 [68] L9-3-->L10-3: Formula: (and (= v_ULTIMATE.start_bubbleSort_~j~0_3 1) (<= 0 v_ULTIMATE.start_bubbleSort_~i~0_5)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~j~0] 135#L10-3 [147] L10-3-->L9-3: Formula: (and (< v_ULTIMATE.start_bubbleSort_~i~0_12 v_ULTIMATE.start_bubbleSort_~j~0_20) (= (+ v_ULTIMATE.start_bubbleSort_~i~0_11 1) v_ULTIMATE.start_bubbleSort_~i~0_12)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_12, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_20} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_11, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_20, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_4|} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#t~post0] 134#L9-3 19.23/8.63 [2019-03-28 12:34:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.63 [2019-03-28 12:34:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash 172169, now seen corresponding path program 1 times 19.23/8.63 [2019-03-28 12:34:18,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.63 [2019-03-28 12:34:18,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.63 [2019-03-28 12:34:18,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:18,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:18,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.63 [2019-03-28 12:34:18,654 INFO L82 PathProgramCache]: Analyzing trace with hash 3216, now seen corresponding path program 2 times 19.23/8.63 [2019-03-28 12:34:18,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.63 [2019-03-28 12:34:18,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.63 [2019-03-28 12:34:18,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:18,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:18,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.63 [2019-03-28 12:34:18,661 INFO L82 PathProgramCache]: Analyzing trace with hash 165456664, now seen corresponding path program 1 times 19.23/8.63 [2019-03-28 12:34:18,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.63 [2019-03-28 12:34:18,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.63 [2019-03-28 12:34:18,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:18,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:18,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:18,703 INFO L216 LassoAnalysis]: Preferences: 19.23/8.63 [2019-03-28 12:34:18,703 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.23/8.63 [2019-03-28 12:34:18,703 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.23/8.63 [2019-03-28 12:34:18,703 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.23/8.63 [2019-03-28 12:34:18,703 INFO L127 ssoRankerPreferences]: Use exernal solver: true 19.23/8.63 [2019-03-28 12:34:18,703 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.23/8.63 [2019-03-28 12:34:18,703 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.23/8.63 [2019-03-28 12:34:18,704 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.23/8.63 [2019-03-28 12:34:18,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 19.23/8.63 [2019-03-28 12:34:18,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.23/8.63 [2019-03-28 12:34:18,704 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.23/8.63 [2019-03-28 12:34:18,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:18,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:18,749 INFO L300 LassoAnalysis]: Preprocessing complete. 19.23/8.63 [2019-03-28 12:34:18,750 INFO L412 LassoAnalysis]: Checking for nontermination... 19.23/8.63 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.23/8.63 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.23/8.63 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.23/8.63 [2019-03-28 12:34:18,753 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 19.23/8.63 [2019-03-28 12:34:18,754 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.23/8.63 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.23/8.63 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 19.23/8.63 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.23/8.63 [2019-03-28 12:34:18,785 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 19.23/8.63 [2019-03-28 12:34:18,785 INFO L163 nArgumentSynthesizer]: Using integer mode. 19.23/8.63 [2019-03-28 12:34:18,817 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 19.23/8.63 [2019-03-28 12:34:18,819 INFO L216 LassoAnalysis]: Preferences: 19.23/8.63 [2019-03-28 12:34:18,820 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.23/8.63 [2019-03-28 12:34:18,820 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.23/8.63 [2019-03-28 12:34:18,820 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.23/8.63 [2019-03-28 12:34:18,820 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.23/8.63 [2019-03-28 12:34:18,820 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.23/8.63 [2019-03-28 12:34:18,820 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.23/8.63 [2019-03-28 12:34:18,820 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.23/8.63 [2019-03-28 12:34:18,820 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop 19.23/8.63 [2019-03-28 12:34:18,821 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.23/8.63 [2019-03-28 12:34:18,821 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.23/8.63 [2019-03-28 12:34:18,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:18,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:18,871 INFO L300 LassoAnalysis]: Preprocessing complete. 19.23/8.63 [2019-03-28 12:34:18,872 INFO L497 LassoAnalysis]: Using template 'affine'. 19.23/8.63 [2019-03-28 12:34:18,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.23/8.63 Termination analysis: LINEAR_WITH_GUESSES 19.23/8.63 Number of strict supporting invariants: 0 19.23/8.63 Number of non-strict supporting invariants: 1 19.23/8.63 Consider only non-deceasing supporting invariants: true 19.23/8.63 Simplify termination arguments: true 19.23/8.63 Simplify supporting invariants: trueOverapproximate stem: false 19.23/8.63 [2019-03-28 12:34:18,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.23/8.63 [2019-03-28 12:34:18,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.23/8.63 [2019-03-28 12:34:18,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.23/8.63 [2019-03-28 12:34:18,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.23/8.63 [2019-03-28 12:34:18,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.23/8.63 [2019-03-28 12:34:18,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.23/8.63 [2019-03-28 12:34:18,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.23/8.63 [2019-03-28 12:34:18,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.23/8.63 [2019-03-28 12:34:18,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.23/8.63 Termination analysis: LINEAR_WITH_GUESSES 19.23/8.63 Number of strict supporting invariants: 0 19.23/8.63 Number of non-strict supporting invariants: 1 19.23/8.63 Consider only non-deceasing supporting invariants: true 19.23/8.63 Simplify termination arguments: true 19.23/8.63 Simplify supporting invariants: trueOverapproximate stem: false 19.23/8.63 [2019-03-28 12:34:18,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.23/8.63 [2019-03-28 12:34:18,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.23/8.63 [2019-03-28 12:34:18,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.23/8.63 [2019-03-28 12:34:18,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.23/8.63 [2019-03-28 12:34:18,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.23/8.63 [2019-03-28 12:34:18,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.23/8.63 [2019-03-28 12:34:18,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.23/8.63 [2019-03-28 12:34:18,882 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.23/8.63 [2019-03-28 12:34:18,885 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 19.23/8.63 [2019-03-28 12:34:18,885 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 19.23/8.63 [2019-03-28 12:34:18,886 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.23/8.63 [2019-03-28 12:34:18,886 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 19.23/8.63 [2019-03-28 12:34:18,886 INFO L518 LassoAnalysis]: Proved termination. 19.23/8.63 [2019-03-28 12:34:18,886 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.23/8.63 Ranking function f(ULTIMATE.start_bubbleSort_~i~0) = 2*ULTIMATE.start_bubbleSort_~i~0 + 1 19.23/8.63 Supporting invariants [] 19.23/8.63 [2019-03-28 12:34:18,886 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 19.23/8.63 [2019-03-28 12:34:18,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.63 [2019-03-28 12:34:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.23/8.63 [2019-03-28 12:34:18,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core 19.23/8.63 [2019-03-28 12:34:18,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.23/8.63 [2019-03-28 12:34:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.23/8.63 [2019-03-28 12:34:18,920 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core 19.23/8.63 [2019-03-28 12:34:18,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.23/8.63 [2019-03-28 12:34:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.23/8.63 [2019-03-28 12:34:18,947 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization 19.23/8.63 [2019-03-28 12:34:18,947 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 19.23/8.63 [2019-03-28 12:34:18,947 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 33 states and 42 transitions. cyclomatic complexity: 12 Second operand 3 states. 19.23/8.63 [2019-03-28 12:34:18,978 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 33 states and 42 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 44 states and 56 transitions. Complement of second has 4 states. 19.23/8.63 [2019-03-28 12:34:18,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states 19.23/8.63 [2019-03-28 12:34:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 19.23/8.63 [2019-03-28 12:34:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. 19.23/8.63 [2019-03-28 12:34:18,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. 19.23/8.63 [2019-03-28 12:34:18,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.23/8.63 [2019-03-28 12:34:18,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. 19.23/8.63 [2019-03-28 12:34:18,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.23/8.63 [2019-03-28 12:34:18,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. 19.23/8.63 [2019-03-28 12:34:18,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.23/8.63 [2019-03-28 12:34:18,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 56 transitions. 19.23/8.63 [2019-03-28 12:34:18,988 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 19.23/8.63 [2019-03-28 12:34:18,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 56 transitions. 19.23/8.63 [2019-03-28 12:34:18,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 19.23/8.63 [2019-03-28 12:34:18,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 19.23/8.63 [2019-03-28 12:34:18,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 56 transitions. 19.23/8.63 [2019-03-28 12:34:18,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.23/8.63 [2019-03-28 12:34:18,989 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 56 transitions. 19.23/8.63 [2019-03-28 12:34:18,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 56 transitions. 19.23/8.63 [2019-03-28 12:34:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 23. 19.23/8.63 [2019-03-28 12:34:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 19.23/8.63 [2019-03-28 12:34:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. 19.23/8.63 [2019-03-28 12:34:18,992 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. 19.23/8.63 [2019-03-28 12:34:18,993 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. 19.23/8.63 [2019-03-28 12:34:18,993 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 19.23/8.63 [2019-03-28 12:34:18,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. 19.23/8.63 [2019-03-28 12:34:18,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 19.23/8.63 [2019-03-28 12:34:18,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.23/8.63 [2019-03-28 12:34:18,994 INFO L119 BuchiIsEmpty]: Starting construction of run 19.23/8.63 [2019-03-28 12:34:18,994 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 19.23/8.63 [2019-03-28 12:34:18,994 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 19.23/8.63 [2019-03-28 12:34:18,995 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L22: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 263#L22 [94] L22-->L22-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 259#L22-2 [120] L22-2-->L9-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_bubbleSort_~i~0_1 (+ v_ULTIMATE.start_bubbleSort_~array_size_1 (- 1))) (= |v_ULTIMATE.start_bubbleSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_bubbleSort_~array_size_1 |v_ULTIMATE.start_bubbleSort_#in~array_size_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_bubbleSort_~numbers.offset_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_bubbleSort_~numbers.base_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_bubbleSort_#in~array_size=|v_ULTIMATE.start_bubbleSort_#in~array_size_1|, ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_1, ULTIMATE.start_bubbleSort_#in~numbers.offset=|v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_1, ULTIMATE.start_bubbleSort_~temp~0=v_ULTIMATE.start_bubbleSort_~temp~0_1, ULTIMATE.start_bubbleSort_#t~mem4=|v_ULTIMATE.start_bubbleSort_#t~mem4_1|, ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_1, ULTIMATE.start_bubbleSort_#t~mem5=|v_ULTIMATE.start_bubbleSort_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_1|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_1|, ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_1|, ULTIMATE.start_bubbleSort_#in~numbers.base=|v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_bubbleSort_~array_size=v_ULTIMATE.start_bubbleSort_~array_size_1, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_bubbleSort_#in~array_size, ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#in~numbers.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_bubbleSort_~numbers.base, ULTIMATE.start_bubbleSort_~temp~0, ULTIMATE.start_bubbleSort_#t~mem4, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_#t~mem5, ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3, ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_#in~numbers.base, ULTIMATE.start_bubbleSort_~j~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_bubbleSort_~array_size, ULTIMATE.start_bubbleSort_#t~post0] 247#L9-3 [68] L9-3-->L10-3: Formula: (and (= v_ULTIMATE.start_bubbleSort_~j~0_3 1) (<= 0 v_ULTIMATE.start_bubbleSort_~i~0_5)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~j~0] 249#L10-3 19.23/8.63 [2019-03-28 12:34:18,995 INFO L796 eck$LassoCheckResult]: Loop: 249#L10-3 [84] L10-3-->L11: Formula: (<= v_ULTIMATE.start_bubbleSort_~j~0_5 v_ULTIMATE.start_bubbleSort_~i~0_7) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_7, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_7, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_5} AuxVars[] AssignedVars[] 251#L11 [90] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_bubbleSort_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_3 .cse1))) (and (= 1 (select |v_#valid_5| v_ULTIMATE.start_bubbleSort_~numbers.base_3)) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_bubbleSort_~numbers.base_3)) (<= 4 .cse0) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_bubbleSort_~numbers.base_3) (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_3 .cse1 (- 4))) |v_ULTIMATE.start_bubbleSort_#t~mem2_2|)))) InVars {ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_3, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_3} OutVars{ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_3, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem2] 260#L11-1 [86] L11-1-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_bubbleSort_~j~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 .cse1))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_bubbleSort_~numbers.base_6) .cse0) |v_ULTIMATE.start_bubbleSort_#t~mem3_2|) (= (select |v_#valid_7| v_ULTIMATE.start_bubbleSort_~numbers.base_6) 1) (<= (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 .cse1 4) (select |v_#length_5| v_ULTIMATE.start_bubbleSort_~numbers.base_6))))) InVars {ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_6} OutVars{ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_5, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_6} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem3] 255#L11-2 [110] L11-2-->L10-2: Formula: (>= |v_ULTIMATE.start_bubbleSort_#t~mem3_6| |v_ULTIMATE.start_bubbleSort_#t~mem2_6|) InVars {ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_6|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_6|} OutVars{ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_5|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3] 253#L10-2 [85] L10-2-->L10-3: Formula: (= v_ULTIMATE.start_bubbleSort_~j~0_18 (+ v_ULTIMATE.start_bubbleSort_~j~0_19 1)) InVars {ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_19} OutVars{ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_18} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_~j~0] 249#L10-3 19.23/8.63 [2019-03-28 12:34:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.63 [2019-03-28 12:34:18,996 INFO L82 PathProgramCache]: Analyzing trace with hash 5337338, now seen corresponding path program 1 times 19.23/8.63 [2019-03-28 12:34:18,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.63 [2019-03-28 12:34:18,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.63 [2019-03-28 12:34:18,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:18,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:18,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:19,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.63 [2019-03-28 12:34:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash 108972246, now seen corresponding path program 1 times 19.23/8.63 [2019-03-28 12:34:19,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.63 [2019-03-28 12:34:19,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.63 [2019-03-28 12:34:19,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:19,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.63 [2019-03-28 12:34:19,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1484393341, now seen corresponding path program 1 times 19.23/8.63 [2019-03-28 12:34:19,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.63 [2019-03-28 12:34:19,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.63 [2019-03-28 12:34:19,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.23/8.63 [2019-03-28 12:34:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.23/8.63 [2019-03-28 12:34:19,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.23/8.63 [2019-03-28 12:34:19,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 19.23/8.63 [2019-03-28 12:34:19,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 19.23/8.63 [2019-03-28 12:34:19,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 19.23/8.63 [2019-03-28 12:34:19,140 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 9 Second operand 5 states. 19.23/8.63 [2019-03-28 12:34:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.23/8.63 [2019-03-28 12:34:19,199 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. 19.23/8.63 [2019-03-28 12:34:19,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 19.23/8.63 [2019-03-28 12:34:19,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. 19.23/8.63 [2019-03-28 12:34:19,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 19.23/8.63 [2019-03-28 12:34:19,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 23 states and 29 transitions. 19.23/8.63 [2019-03-28 12:34:19,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 19.23/8.63 [2019-03-28 12:34:19,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 19.23/8.63 [2019-03-28 12:34:19,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. 19.23/8.63 [2019-03-28 12:34:19,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 19.23/8.63 [2019-03-28 12:34:19,204 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. 19.23/8.63 [2019-03-28 12:34:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. 19.23/8.63 [2019-03-28 12:34:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 19.23/8.63 [2019-03-28 12:34:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 19.23/8.63 [2019-03-28 12:34:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. 19.23/8.63 [2019-03-28 12:34:19,206 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. 19.23/8.63 [2019-03-28 12:34:19,206 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. 19.23/8.63 [2019-03-28 12:34:19,206 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 19.23/8.63 [2019-03-28 12:34:19,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. 19.23/8.63 [2019-03-28 12:34:19,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 19.23/8.63 [2019-03-28 12:34:19,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.23/8.63 [2019-03-28 12:34:19,207 INFO L119 BuchiIsEmpty]: Starting construction of run 19.23/8.63 [2019-03-28 12:34:19,208 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 19.23/8.63 [2019-03-28 12:34:19,208 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 19.23/8.63 [2019-03-28 12:34:19,208 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY [145] ULTIMATE.startENTRY-->L22: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_20| 0 0) |v_#valid_19|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_20|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_3, #valid=|v_#valid_19|, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, ULTIMATE.start_main_~numbers~0.base, #valid, ULTIMATE.start_main_~numbers~0.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 332#L22 [102] L22-->L22-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 328#L22-2 [120] L22-2-->L9-3: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~numbers~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_bubbleSort_~i~0_1 (+ v_ULTIMATE.start_bubbleSort_~array_size_1 (- 1))) (= |v_ULTIMATE.start_bubbleSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_main_~numbers~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_bubbleSort_~array_size_1 |v_ULTIMATE.start_bubbleSort_#in~array_size_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1| v_ULTIMATE.start_main_~numbers~0.offset_2) (= v_ULTIMATE.start_bubbleSort_~numbers.offset_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1| v_ULTIMATE.start_main_~numbers~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_bubbleSort_~numbers.base_1 |v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_bubbleSort_#in~array_size=|v_ULTIMATE.start_bubbleSort_#in~array_size_1|, ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_1, ULTIMATE.start_bubbleSort_#in~numbers.offset=|v_ULTIMATE.start_bubbleSort_#in~numbers.offset_1|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_1, ULTIMATE.start_bubbleSort_~temp~0=v_ULTIMATE.start_bubbleSort_~temp~0_1, ULTIMATE.start_bubbleSort_#t~mem4=|v_ULTIMATE.start_bubbleSort_#t~mem4_1|, ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_1, ULTIMATE.start_bubbleSort_#t~mem5=|v_ULTIMATE.start_bubbleSort_#t~mem5_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_1|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_1|, ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_1|, ULTIMATE.start_bubbleSort_#in~numbers.base=|v_ULTIMATE.start_bubbleSort_#in~numbers.base_1|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_1, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_main_~numbers~0.base=v_ULTIMATE.start_main_~numbers~0.base_2, ULTIMATE.start_main_~numbers~0.offset=v_ULTIMATE.start_main_~numbers~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_bubbleSort_~array_size=v_ULTIMATE.start_bubbleSort_~array_size_1, ULTIMATE.start_bubbleSort_#t~post0=|v_ULTIMATE.start_bubbleSort_#t~post0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_bubbleSort_#in~array_size, ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_#in~numbers.offset, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_bubbleSort_~numbers.base, ULTIMATE.start_bubbleSort_~temp~0, ULTIMATE.start_bubbleSort_#t~mem4, ULTIMATE.start_bubbleSort_~numbers.offset, ULTIMATE.start_bubbleSort_#t~mem5, ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3, ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_#in~numbers.base, ULTIMATE.start_bubbleSort_~j~0, #valid, ULTIMATE.start_main_~numbers~0.base, ULTIMATE.start_main_~numbers~0.offset, #length, ULTIMATE.start_bubbleSort_~array_size, ULTIMATE.start_bubbleSort_#t~post0] 316#L9-3 [68] L9-3-->L10-3: Formula: (and (= v_ULTIMATE.start_bubbleSort_~j~0_3 1) (<= 0 v_ULTIMATE.start_bubbleSort_~i~0_5)) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_~j~0] 318#L10-3 19.23/8.63 [2019-03-28 12:34:19,209 INFO L796 eck$LassoCheckResult]: Loop: 318#L10-3 [84] L10-3-->L11: Formula: (<= v_ULTIMATE.start_bubbleSort_~j~0_5 v_ULTIMATE.start_bubbleSort_~i~0_7) InVars {ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_7, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_5} OutVars{ULTIMATE.start_bubbleSort_~i~0=v_ULTIMATE.start_bubbleSort_~i~0_7, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_5} AuxVars[] AssignedVars[] 320#L11 [90] L11-->L11-1: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_bubbleSort_~j~0_6))) (let ((.cse0 (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_3 .cse1))) (and (= 1 (select |v_#valid_5| v_ULTIMATE.start_bubbleSort_~numbers.base_3)) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_bubbleSort_~numbers.base_3)) (<= 4 .cse0) (= (select (select |v_#memory_int_1| v_ULTIMATE.start_bubbleSort_~numbers.base_3) (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_3 .cse1 (- 4))) |v_ULTIMATE.start_bubbleSort_#t~mem2_2|)))) InVars {ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_3, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_3} OutVars{ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_3, ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_6, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_3} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem2] 329#L11-1 [86] L11-1-->L11-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_bubbleSort_~j~0_8))) (let ((.cse0 (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 .cse1))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_bubbleSort_~numbers.base_6) .cse0) |v_ULTIMATE.start_bubbleSort_#t~mem3_2|) (= (select |v_#valid_7| v_ULTIMATE.start_bubbleSort_~numbers.base_6) 1) (<= (+ v_ULTIMATE.start_bubbleSort_~numbers.offset_5 .cse1 4) (select |v_#length_5| v_ULTIMATE.start_bubbleSort_~numbers.base_6))))) InVars {ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_5, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_6} OutVars{ULTIMATE.start_bubbleSort_~numbers.offset=v_ULTIMATE.start_bubbleSort_~numbers.offset_5, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_8, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_bubbleSort_~numbers.base=v_ULTIMATE.start_bubbleSort_~numbers.base_6} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem3] 324#L11-2 [110] L11-2-->L10-2: Formula: (>= |v_ULTIMATE.start_bubbleSort_#t~mem3_6| |v_ULTIMATE.start_bubbleSort_#t~mem2_6|) InVars {ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_6|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_6|} OutVars{ULTIMATE.start_bubbleSort_#t~mem2=|v_ULTIMATE.start_bubbleSort_#t~mem2_5|, ULTIMATE.start_bubbleSort_#t~mem3=|v_ULTIMATE.start_bubbleSort_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~mem2, ULTIMATE.start_bubbleSort_#t~mem3] 322#L10-2 [85] L10-2-->L10-3: Formula: (= v_ULTIMATE.start_bubbleSort_~j~0_18 (+ v_ULTIMATE.start_bubbleSort_~j~0_19 1)) InVars {ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_19} OutVars{ULTIMATE.start_bubbleSort_#t~post1=|v_ULTIMATE.start_bubbleSort_#t~post1_2|, ULTIMATE.start_bubbleSort_~j~0=v_ULTIMATE.start_bubbleSort_~j~0_18} AuxVars[] AssignedVars[ULTIMATE.start_bubbleSort_#t~post1, ULTIMATE.start_bubbleSort_~j~0] 318#L10-3 19.23/8.63 [2019-03-28 12:34:19,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.63 [2019-03-28 12:34:19,209 INFO L82 PathProgramCache]: Analyzing trace with hash 5345026, now seen corresponding path program 1 times 19.23/8.63 [2019-03-28 12:34:19,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.63 [2019-03-28 12:34:19,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.63 [2019-03-28 12:34:19,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.63 [2019-03-28 12:34:19,222 INFO L82 PathProgramCache]: Analyzing trace with hash 108972246, now seen corresponding path program 2 times 19.23/8.63 [2019-03-28 12:34:19,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.63 [2019-03-28 12:34:19,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.63 [2019-03-28 12:34:19,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.63 [2019-03-28 12:34:19,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1752993163, now seen corresponding path program 1 times 19.23/8.63 [2019-03-28 12:34:19,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.23/8.63 [2019-03-28 12:34:19,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.23/8.63 [2019-03-28 12:34:19,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.23/8.63 [2019-03-28 12:34:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.23/8.63 [2019-03-28 12:34:19,442 INFO L216 LassoAnalysis]: Preferences: 19.23/8.63 [2019-03-28 12:34:19,442 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.23/8.63 [2019-03-28 12:34:19,442 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.23/8.63 [2019-03-28 12:34:19,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.23/8.63 [2019-03-28 12:34:19,443 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.23/8.63 [2019-03-28 12:34:19,443 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.23/8.63 [2019-03-28 12:34:19,443 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.23/8.63 [2019-03-28 12:34:19,443 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.23/8.63 [2019-03-28 12:34:19,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 19.23/8.63 [2019-03-28 12:34:19,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.23/8.63 [2019-03-28 12:34:19,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.23/8.63 [2019-03-28 12:34:19,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:19,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:19,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:19,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:19,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:19,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:19,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:19,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:19,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:19,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:19,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:19,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.23/8.63 [2019-03-28 12:34:19,821 INFO L300 LassoAnalysis]: Preprocessing complete. 19.23/8.63 [2019-03-28 12:34:19,822 INFO L497 LassoAnalysis]: Using template 'affine'. 19.23/8.63 [2019-03-28 12:34:19,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.23/8.63 Termination analysis: LINEAR_WITH_GUESSES 19.23/8.63 Number of strict supporting invariants: 0 19.23/8.63 Number of non-strict supporting invariants: 1 19.23/8.63 Consider only non-deceasing supporting invariants: true 19.23/8.63 Simplify termination arguments: true 19.23/8.63 Simplify supporting invariants: trueOverapproximate stem: false 19.23/8.63 [2019-03-28 12:34:19,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.23/8.63 [2019-03-28 12:34:19,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.23/8.63 [2019-03-28 12:34:19,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.23/8.63 [2019-03-28 12:34:19,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.23/8.63 [2019-03-28 12:34:19,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.23/8.63 [2019-03-28 12:34:19,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.23/8.63 [2019-03-28 12:34:19,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.23/8.63 [2019-03-28 12:34:19,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.23/8.63 [2019-03-28 12:34:19,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.23/8.63 Termination analysis: LINEAR_WITH_GUESSES 19.23/8.63 Number of strict supporting invariants: 0 19.23/8.63 Number of non-strict supporting invariants: 1 19.23/8.63 Consider only non-deceasing supporting invariants: true 19.23/8.63 Simplify termination arguments: true 19.23/8.63 Simplify supporting invariants: trueOverapproximate stem: false 19.23/8.63 [2019-03-28 12:34:19,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.23/8.63 [2019-03-28 12:34:19,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.23/8.63 [2019-03-28 12:34:19,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.23/8.63 [2019-03-28 12:34:19,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.23/8.63 [2019-03-28 12:34:19,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.23/8.63 [2019-03-28 12:34:19,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.23/8.63 [2019-03-28 12:34:19,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.23/8.63 [2019-03-28 12:34:19,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.23/8.63 [2019-03-28 12:34:19,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.23/8.63 Termination analysis: LINEAR_WITH_GUESSES 19.23/8.63 Number of strict supporting invariants: 0 19.23/8.63 Number of non-strict supporting invariants: 1 19.23/8.63 Consider only non-deceasing supporting invariants: true 19.23/8.63 Simplify termination arguments: true 19.23/8.63 Simplify supporting invariants: trueOverapproximate stem: false 19.23/8.63 [2019-03-28 12:34:19,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.23/8.63 [2019-03-28 12:34:19,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.23/8.63 [2019-03-28 12:34:19,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.23/8.63 [2019-03-28 12:34:19,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.23/8.63 [2019-03-28 12:34:19,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.23/8.63 [2019-03-28 12:34:19,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.23/8.63 [2019-03-28 12:34:19,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.23/8.63 [2019-03-28 12:34:19,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.23/8.63 [2019-03-28 12:34:19,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.23/8.63 Termination analysis: LINEAR_WITH_GUESSES 19.23/8.63 Number of strict supporting invariants: 0 19.23/8.63 Number of non-strict supporting invariants: 1 19.23/8.63 Consider only non-deceasing supporting invariants: true 19.23/8.63 Simplify termination arguments: true 19.23/8.63 Simplify supporting invariants: trueOverapproximate stem: false 19.23/8.63 [2019-03-28 12:34:19,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.23/8.63 [2019-03-28 12:34:19,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.23/8.63 [2019-03-28 12:34:19,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.23/8.63 [2019-03-28 12:34:19,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.23/8.63 [2019-03-28 12:34:19,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.23/8.63 [2019-03-28 12:34:19,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.23/8.63 [2019-03-28 12:34:19,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.23/8.63 [2019-03-28 12:34:19,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.23/8.63 [2019-03-28 12:34:19,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.23/8.63 Termination analysis: LINEAR_WITH_GUESSES 19.23/8.63 Number of strict supporting invariants: 0 19.23/8.63 Number of non-strict supporting invariants: 1 19.23/8.63 Consider only non-deceasing supporting invariants: true 19.23/8.63 Simplify termination arguments: true 19.23/8.63 Simplify supporting invariants: trueOverapproximate stem: false 19.23/8.63 [2019-03-28 12:34:19,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.23/8.63 [2019-03-28 12:34:19,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.23/8.63 [2019-03-28 12:34:19,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.23/8.63 [2019-03-28 12:34:19,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.23/8.63 [2019-03-28 12:34:19,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.23/8.63 [2019-03-28 12:34:19,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.23/8.63 [2019-03-28 12:34:19,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.23/8.63 [2019-03-28 12:34:19,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.23/8.63 Termination analysis: LINEAR_WITH_GUESSES 19.23/8.63 Number of strict supporting invariants: 0 19.23/8.63 Number of non-strict supporting invariants: 1 19.23/8.63 Consider only non-deceasing supporting invariants: true 19.23/8.63 Simplify termination arguments: true 19.23/8.63 Simplify supporting invariants: trueOverapproximate stem: false 19.23/8.63 [2019-03-28 12:34:19,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.23/8.63 [2019-03-28 12:34:19,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.23/8.63 [2019-03-28 12:34:19,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.23/8.63 [2019-03-28 12:34:19,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.23/8.63 [2019-03-28 12:34:19,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.23/8.63 [2019-03-28 12:34:19,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.23/8.63 [2019-03-28 12:34:19,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.23/8.63 [2019-03-28 12:34:19,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.23/8.63 [2019-03-28 12:34:19,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.23/8.63 Termination analysis: LINEAR_WITH_GUESSES 19.23/8.63 Number of strict supporting invariants: 0 19.23/8.63 Number of non-strict supporting invariants: 1 19.23/8.63 Consider only non-deceasing supporting invariants: true 19.23/8.63 Simplify termination arguments: true 19.23/8.63 Simplify supporting invariants: trueOverapproximate stem: false 19.23/8.63 [2019-03-28 12:34:19,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.23/8.63 [2019-03-28 12:34:19,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.23/8.63 [2019-03-28 12:34:19,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.23/8.63 [2019-03-28 12:34:19,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.23/8.63 [2019-03-28 12:34:19,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.23/8.63 [2019-03-28 12:34:19,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.23/8.63 [2019-03-28 12:34:19,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.23/8.63 [2019-03-28 12:34:19,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.23/8.63 [2019-03-28 12:34:19,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.23/8.63 Termination analysis: LINEAR_WITH_GUESSES 19.23/8.63 Number of strict supporting invariants: 0 19.23/8.63 Number of non-strict supporting invariants: 1 19.23/8.63 Consider only non-deceasing supporting invariants: true 19.23/8.63 Simplify termination arguments: true 19.23/8.63 Simplify supporting invariants: trueOverapproximate stem: false 19.23/8.63 [2019-03-28 12:34:19,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.23/8.63 [2019-03-28 12:34:19,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.23/8.63 [2019-03-28 12:34:19,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.23/8.63 [2019-03-28 12:34:19,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.23/8.63 [2019-03-28 12:34:19,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.23/8.63 [2019-03-28 12:34:19,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.23/8.63 [2019-03-28 12:34:19,908 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.23/8.63 [2019-03-28 12:34:19,940 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 19.23/8.63 [2019-03-28 12:34:19,940 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. 19.23/8.63 [2019-03-28 12:34:19,941 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.23/8.63 [2019-03-28 12:34:19,943 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 19.23/8.63 [2019-03-28 12:34:19,943 INFO L518 LassoAnalysis]: Proved termination. 19.23/8.63 [2019-03-28 12:34:19,943 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.23/8.63 Ranking function f(ULTIMATE.start_bubbleSort_~i~0, ULTIMATE.start_bubbleSort_~j~0) = 2*ULTIMATE.start_bubbleSort_~i~0 - 2*ULTIMATE.start_bubbleSort_~j~0 + 1 19.23/8.63 Supporting invariants [] 19.23/8.63 [2019-03-28 12:34:19,954 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed 19.23/8.63 [2019-03-28 12:34:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.23/8.63 [2019-03-28 12:34:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.23/8.63 [2019-03-28 12:34:19,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core 19.23/8.63 [2019-03-28 12:34:19,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.23/8.63 [2019-03-28 12:34:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.23/8.63 [2019-03-28 12:34:19,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core 19.23/8.63 [2019-03-28 12:34:19,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.23/8.63 [2019-03-28 12:34:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.23/8.63 [2019-03-28 12:34:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.23/8.63 [2019-03-28 12:34:20,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core 19.23/8.63 [2019-03-28 12:34:20,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.23/8.63 [2019-03-28 12:34:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.23/8.63 [2019-03-28 12:34:20,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core 19.23/8.63 [2019-03-28 12:34:20,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.23/8.63 [2019-03-28 12:34:20,110 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization 19.23/8.63 [2019-03-28 12:34:20,110 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 19.23/8.63 [2019-03-28 12:34:20,111 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 23 states and 29 transitions. cyclomatic complexity: 8 Second operand 3 states. 19.23/8.63 [2019-03-28 12:34:20,176 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 23 states and 29 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 41 states and 50 transitions. Complement of second has 6 states. 19.23/8.63 [2019-03-28 12:34:20,176 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 19.23/8.63 [2019-03-28 12:34:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. 19.23/8.63 [2019-03-28 12:34:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. 19.23/8.63 [2019-03-28 12:34:20,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 4 letters. Loop has 5 letters. 19.23/8.63 [2019-03-28 12:34:20,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.23/8.63 [2019-03-28 12:34:20,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 9 letters. Loop has 5 letters. 19.23/8.63 [2019-03-28 12:34:20,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.23/8.63 [2019-03-28 12:34:20,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 4 letters. Loop has 10 letters. 19.23/8.63 [2019-03-28 12:34:20,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.23/8.63 [2019-03-28 12:34:20,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 50 transitions. 19.23/8.63 [2019-03-28 12:34:20,183 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.23/8.63 [2019-03-28 12:34:20,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. 19.23/8.63 [2019-03-28 12:34:20,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 19.23/8.63 [2019-03-28 12:34:20,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 19.23/8.63 [2019-03-28 12:34:20,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 19.23/8.63 [2019-03-28 12:34:20,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.23/8.63 [2019-03-28 12:34:20,184 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.23/8.63 [2019-03-28 12:34:20,184 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.23/8.63 [2019-03-28 12:34:20,184 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.23/8.63 [2019-03-28 12:34:20,184 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 19.23/8.63 [2019-03-28 12:34:20,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 19.23/8.63 [2019-03-28 12:34:20,185 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.23/8.63 [2019-03-28 12:34:20,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 19.23/8.63 [2019-03-28 12:34:20,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:34:20 BasicIcfg 19.23/8.63 [2019-03-28 12:34:20,191 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 19.23/8.63 [2019-03-28 12:34:20,192 INFO L168 Benchmark]: Toolchain (without parser) took 4013.94 ms. Allocated memory was 649.6 MB in the beginning and 760.2 MB in the end (delta: 110.6 MB). Free memory was 564.9 MB in the beginning and 492.0 MB in the end (delta: 72.9 MB). Peak memory consumption was 183.5 MB. Max. memory is 50.3 GB. 19.23/8.63 [2019-03-28 12:34:20,194 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.23/8.63 [2019-03-28 12:34:20,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.50 ms. Allocated memory was 649.6 MB in the beginning and 686.8 MB in the end (delta: 37.2 MB). Free memory was 564.9 MB in the beginning and 652.2 MB in the end (delta: -87.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 19.23/8.63 [2019-03-28 12:34:20,195 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.16 ms. Allocated memory is still 686.8 MB. Free memory was 652.2 MB in the beginning and 648.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 19.23/8.63 [2019-03-28 12:34:20,195 INFO L168 Benchmark]: Boogie Preprocessor took 26.76 ms. Allocated memory is still 686.8 MB. Free memory was 648.3 MB in the beginning and 647.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 19.23/8.63 [2019-03-28 12:34:20,196 INFO L168 Benchmark]: RCFGBuilder took 345.40 ms. Allocated memory is still 686.8 MB. Free memory was 647.2 MB in the beginning and 626.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. 19.23/8.63 [2019-03-28 12:34:20,196 INFO L168 Benchmark]: BlockEncodingV2 took 127.69 ms. Allocated memory is still 686.8 MB. Free memory was 626.2 MB in the beginning and 617.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 19.23/8.63 [2019-03-28 12:34:20,197 INFO L168 Benchmark]: TraceAbstraction took 969.60 ms. Allocated memory is still 686.8 MB. Free memory was 616.4 MB in the beginning and 526.8 MB in the end (delta: 89.7 MB). Peak memory consumption was 89.7 MB. Max. memory is 50.3 GB. 19.23/8.63 [2019-03-28 12:34:20,197 INFO L168 Benchmark]: BuchiAutomizer took 2184.08 ms. Allocated memory was 686.8 MB in the beginning and 760.2 MB in the end (delta: 73.4 MB). Free memory was 526.8 MB in the beginning and 492.0 MB in the end (delta: 34.8 MB). Peak memory consumption was 108.2 MB. Max. memory is 50.3 GB. 19.23/8.63 [2019-03-28 12:34:20,202 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 19.23/8.63 --- Results --- 19.23/8.63 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 19.23/8.63 - StatisticsResult: Initial Icfg 19.23/8.63 33 locations, 38 edges 19.23/8.63 - StatisticsResult: Encoded RCFG 19.23/8.63 25 locations, 41 edges 19.23/8.63 * Results from de.uni_freiburg.informatik.ultimate.core: 19.23/8.63 - StatisticsResult: Toolchain Benchmarks 19.23/8.63 Benchmark results are: 19.23/8.63 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.23/8.63 * CACSL2BoogieTranslator took 311.50 ms. Allocated memory was 649.6 MB in the beginning and 686.8 MB in the end (delta: 37.2 MB). Free memory was 564.9 MB in the beginning and 652.2 MB in the end (delta: -87.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 19.23/8.63 * Boogie Procedure Inliner took 43.16 ms. Allocated memory is still 686.8 MB. Free memory was 652.2 MB in the beginning and 648.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 19.23/8.63 * Boogie Preprocessor took 26.76 ms. Allocated memory is still 686.8 MB. Free memory was 648.3 MB in the beginning and 647.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 19.23/8.63 * RCFGBuilder took 345.40 ms. Allocated memory is still 686.8 MB. Free memory was 647.2 MB in the beginning and 626.2 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 50.3 GB. 19.23/8.63 * BlockEncodingV2 took 127.69 ms. Allocated memory is still 686.8 MB. Free memory was 626.2 MB in the beginning and 617.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 19.23/8.63 * TraceAbstraction took 969.60 ms. Allocated memory is still 686.8 MB. Free memory was 616.4 MB in the beginning and 526.8 MB in the end (delta: 89.7 MB). Peak memory consumption was 89.7 MB. Max. memory is 50.3 GB. 19.23/8.63 * BuchiAutomizer took 2184.08 ms. Allocated memory was 686.8 MB in the beginning and 760.2 MB in the end (delta: 73.4 MB). Free memory was 526.8 MB in the beginning and 492.0 MB in the end (delta: 34.8 MB). Peak memory consumption was 108.2 MB. Max. memory is 50.3 GB. 19.23/8.63 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 19.23/8.63 - GenericResult: Unfinished Backtranslation 19.23/8.63 unknown boogie variable #length 19.23/8.63 - GenericResult: Unfinished Backtranslation 19.23/8.63 unknown boogie variable #length 19.23/8.63 - GenericResult: Unfinished Backtranslation 19.23/8.63 unknown boogie variable #length 19.23/8.63 - GenericResult: Unfinished Backtranslation 19.23/8.63 unknown boogie variable #length 19.23/8.63 - GenericResult: Unfinished Backtranslation 19.23/8.63 unknown boogie variable #length 19.23/8.63 - GenericResult: Unfinished Backtranslation 19.23/8.63 unknown boogie variable #length 19.23/8.63 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 19.23/8.63 - PositiveResult [Line: 12]: pointer dereference always succeeds 19.23/8.63 For all program executions holds that pointer dereference always succeeds at this location 19.23/8.63 - PositiveResult [Line: 13]: pointer dereference always succeeds 19.23/8.63 For all program executions holds that pointer dereference always succeeds at this location 19.23/8.63 - PositiveResult [Line: 13]: pointer dereference always succeeds 19.23/8.63 For all program executions holds that pointer dereference always succeeds at this location 19.23/8.63 - PositiveResult [Line: 11]: pointer dereference always succeeds 19.23/8.63 For all program executions holds that pointer dereference always succeeds at this location 19.23/8.63 - PositiveResult [Line: 11]: pointer dereference always succeeds 19.23/8.63 For all program executions holds that pointer dereference always succeeds at this location 19.23/8.63 - PositiveResult [Line: 13]: pointer dereference always succeeds 19.23/8.63 For all program executions holds that pointer dereference always succeeds at this location 19.23/8.63 - PositiveResult [Line: 13]: pointer dereference always succeeds 19.23/8.63 For all program executions holds that pointer dereference always succeeds at this location 19.23/8.63 - PositiveResult [Line: 11]: pointer dereference always succeeds 19.23/8.63 For all program executions holds that pointer dereference always succeeds at this location 19.23/8.63 - PositiveResult [Line: 11]: pointer dereference always succeeds 19.23/8.63 For all program executions holds that pointer dereference always succeeds at this location 19.23/8.63 - PositiveResult [Line: 14]: pointer dereference always succeeds 19.23/8.63 For all program executions holds that pointer dereference always succeeds at this location 19.23/8.63 - PositiveResult [Line: 14]: pointer dereference always succeeds 19.23/8.63 For all program executions holds that pointer dereference always succeeds at this location 19.23/8.63 - PositiveResult [Line: 12]: pointer dereference always succeeds 19.23/8.63 For all program executions holds that pointer dereference always succeeds at this location 19.23/8.63 - AllSpecificationsHoldResult: All specifications hold 19.23/8.63 12 specifications checked. All of them hold 19.23/8.63 - InvariantResult [Line: 9]: Loop Invariant 19.23/8.63 [2019-03-28 12:34:20,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.23/8.63 [2019-03-28 12:34:20,210 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.23/8.63 Derived loop invariant: (\valid[numbers] == 1 && numbers == 0) && 4 * i + 4 <= unknown-#length-unknown[numbers] 19.23/8.63 - InvariantResult [Line: 10]: Loop Invariant 19.23/8.63 [2019-03-28 12:34:20,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.23/8.63 [2019-03-28 12:34:20,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.23/8.63 [2019-03-28 12:34:20,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.23/8.63 [2019-03-28 12:34:20,212 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.23/8.63 Derived loop invariant: (((8 <= numbers + 4 * j && \valid[numbers] == 1) && numbers == 0) && 4 * i + 4 <= unknown-#length-unknown[numbers]) || (((\valid[numbers] == 1 && j == 1) && numbers == 0) && 4 * i + 4 <= unknown-#length-unknown[numbers]) 19.23/8.63 - StatisticsResult: Ultimate Automizer benchmark data 19.23/8.63 CFG has 1 procedures, 25 locations, 12 error locations. SAFE Result, 0.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 122 SDslu, 18 SDs, 0 SdLazy, 135 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=2, 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: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 65 HoareAnnotationTreeSize, 2 FomulaSimplifications, 60 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 19.23/8.63 - StatisticsResult: Constructed decomposition of program 19.23/8.63 Your program was decomposed into 4 terminating modules (1 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function 2 * i + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * i + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * i + -2 * j + 1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. 19.23/8.63 - StatisticsResult: Timing statistics 19.23/8.63 BüchiAutomizer plugin needed 2.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 71 SDtfs, 189 SDslu, 72 SDs, 0 SdLazy, 178 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp99 ukn98 mio100 lsp92 div100 bol100 ite100 ukn100 eq166 hnf91 smp89 dnf100 smp100 tf107 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s 19.23/8.63 - TerminationAnalysisResult: Termination proven 19.23/8.63 Buchi Automizer proved that your program is terminating 19.23/8.63 RESULT: Ultimate proved your program to be correct! 19.23/8.63 !SESSION 2019-03-28 12:34:12.872 ----------------------------------------------- 19.23/8.63 eclipse.buildId=unknown 19.23/8.63 java.version=1.8.0_181 19.23/8.63 java.vendor=Oracle Corporation 19.23/8.63 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 19.23/8.63 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 19.23/8.63 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 19.23/8.63 19.23/8.63 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:34:20.438 19.23/8.63 !MESSAGE The workspace will exit with unsaved changes in this session. 19.23/8.63 Received shutdown request... 19.23/8.63 Ultimate: 19.23/8.63 GTK+ Version Check 19.23/8.63 EOF