15.19/7.05 YES 15.19/7.05 15.19/7.06 Ultimate: Cannot open display: 15.19/7.06 This is Ultimate 0.1.24-8dc7c08-m 15.19/7.06 [2019-03-28 12:32:45,500 INFO L170 SettingsManager]: Resetting all preferences to default values... 15.19/7.06 [2019-03-28 12:32:45,503 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 15.19/7.06 [2019-03-28 12:32:45,515 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 15.19/7.06 [2019-03-28 12:32:45,515 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 15.19/7.06 [2019-03-28 12:32:45,516 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 15.19/7.06 [2019-03-28 12:32:45,517 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 15.19/7.06 [2019-03-28 12:32:45,519 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 15.19/7.06 [2019-03-28 12:32:45,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 15.19/7.06 [2019-03-28 12:32:45,521 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 15.19/7.06 [2019-03-28 12:32:45,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 15.19/7.06 [2019-03-28 12:32:45,522 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 15.19/7.06 [2019-03-28 12:32:45,523 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 15.19/7.06 [2019-03-28 12:32:45,524 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 15.19/7.06 [2019-03-28 12:32:45,525 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 15.19/7.06 [2019-03-28 12:32:45,525 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 15.19/7.06 [2019-03-28 12:32:45,526 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 15.19/7.06 [2019-03-28 12:32:45,528 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 15.19/7.06 [2019-03-28 12:32:45,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 15.19/7.06 [2019-03-28 12:32:45,531 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 15.19/7.06 [2019-03-28 12:32:45,532 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 15.19/7.06 [2019-03-28 12:32:45,533 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 15.19/7.06 [2019-03-28 12:32:45,535 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 15.19/7.06 [2019-03-28 12:32:45,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 15.19/7.06 [2019-03-28 12:32:45,536 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 15.19/7.06 [2019-03-28 12:32:45,537 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 15.19/7.06 [2019-03-28 12:32:45,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 15.19/7.06 [2019-03-28 12:32:45,538 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 15.19/7.06 [2019-03-28 12:32:45,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 15.19/7.06 [2019-03-28 12:32:45,539 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 15.19/7.06 [2019-03-28 12:32:45,540 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 15.19/7.06 [2019-03-28 12:32:45,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 15.19/7.06 [2019-03-28 12:32:45,541 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 15.19/7.06 [2019-03-28 12:32:45,541 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 15.19/7.06 [2019-03-28 12:32:45,542 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 15.19/7.06 [2019-03-28 12:32:45,542 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 15.19/7.06 [2019-03-28 12:32:45,542 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 15.19/7.06 [2019-03-28 12:32:45,543 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 15.19/7.06 [2019-03-28 12:32:45,544 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 15.19/7.06 [2019-03-28 12:32:45,544 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 15.19/7.06 [2019-03-28 12:32:45,559 INFO L110 SettingsManager]: Loading preferences was successful 15.19/7.06 [2019-03-28 12:32:45,559 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 15.19/7.06 [2019-03-28 12:32:45,560 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 15.19/7.06 [2019-03-28 12:32:45,561 INFO L133 SettingsManager]: * Rewrite not-equals=true 15.19/7.06 [2019-03-28 12:32:45,561 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 15.19/7.06 [2019-03-28 12:32:45,561 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 15.19/7.06 [2019-03-28 12:32:45,561 INFO L133 SettingsManager]: * Use SBE=true 15.19/7.06 [2019-03-28 12:32:45,561 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 15.19/7.06 [2019-03-28 12:32:45,562 INFO L133 SettingsManager]: * Use old map elimination=false 15.19/7.06 [2019-03-28 12:32:45,562 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 15.19/7.06 [2019-03-28 12:32:45,562 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 15.19/7.06 [2019-03-28 12:32:45,562 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 15.19/7.06 [2019-03-28 12:32:45,562 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 15.19/7.06 [2019-03-28 12:32:45,563 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 15.19/7.06 [2019-03-28 12:32:45,563 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 15.19/7.06 [2019-03-28 12:32:45,563 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 15.19/7.06 [2019-03-28 12:32:45,563 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 15.19/7.06 [2019-03-28 12:32:45,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE 15.19/7.06 [2019-03-28 12:32:45,564 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 15.19/7.06 [2019-03-28 12:32:45,564 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 15.19/7.06 [2019-03-28 12:32:45,564 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 15.19/7.06 [2019-03-28 12:32:45,564 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 15.19/7.06 [2019-03-28 12:32:45,564 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 15.19/7.06 [2019-03-28 12:32:45,564 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 15.19/7.06 [2019-03-28 12:32:45,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 15.19/7.06 [2019-03-28 12:32:45,565 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 15.19/7.06 [2019-03-28 12:32:45,565 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 15.19/7.06 [2019-03-28 12:32:45,565 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 15.19/7.06 [2019-03-28 12:32:45,565 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 15.19/7.06 [2019-03-28 12:32:45,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 15.19/7.06 [2019-03-28 12:32:45,606 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 15.19/7.06 [2019-03-28 12:32:45,610 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 15.19/7.06 [2019-03-28 12:32:45,611 INFO L271 PluginConnector]: Initializing CDTParser... 15.19/7.06 [2019-03-28 12:32:45,611 INFO L276 PluginConnector]: CDTParser initialized 15.19/7.06 [2019-03-28 12:32:45,612 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 15.19/7.06 [2019-03-28 12:32:45,676 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/64822dd9be5e4a50b276a302865bd789/FLAGfc714d570 15.19/7.06 [2019-03-28 12:32:46,014 INFO L307 CDTParser]: Found 1 translation units. 15.19/7.06 [2019-03-28 12:32:46,015 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 15.19/7.06 [2019-03-28 12:32:46,021 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/64822dd9be5e4a50b276a302865bd789/FLAGfc714d570 15.19/7.06 [2019-03-28 12:32:46,428 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/64822dd9be5e4a50b276a302865bd789 15.19/7.06 [2019-03-28 12:32:46,440 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 15.19/7.06 [2019-03-28 12:32:46,442 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 15.19/7.06 [2019-03-28 12:32:46,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 15.19/7.06 [2019-03-28 12:32:46,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 15.19/7.06 [2019-03-28 12:32:46,446 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 15.19/7.06 [2019-03-28 12:32:46,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:32:46" (1/1) ... 15.19/7.06 [2019-03-28 12:32:46,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6c0af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:32:46, skipping insertion in model container 15.19/7.06 [2019-03-28 12:32:46,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:32:46" (1/1) ... 15.19/7.06 [2019-03-28 12:32:46,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 15.19/7.06 [2019-03-28 12:32:46,475 INFO L176 MainTranslator]: Built tables and reachable declarations 15.19/7.06 [2019-03-28 12:32:46,632 INFO L206 PostProcessor]: Analyzing one entry point: main 15.19/7.06 [2019-03-28 12:32:46,638 INFO L191 MainTranslator]: Completed pre-run 15.19/7.06 [2019-03-28 12:32:46,657 INFO L206 PostProcessor]: Analyzing one entry point: main 15.19/7.06 [2019-03-28 12:32:46,737 INFO L195 MainTranslator]: Completed translation 15.19/7.06 [2019-03-28 12:32:46,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:32:46 WrapperNode 15.19/7.06 [2019-03-28 12:32:46,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 15.19/7.06 [2019-03-28 12:32:46,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 15.19/7.06 [2019-03-28 12:32:46,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 15.19/7.06 [2019-03-28 12:32:46,739 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 15.19/7.06 [2019-03-28 12:32:46,748 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:32:46" (1/1) ... 15.19/7.06 [2019-03-28 12:32:46,756 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:32:46" (1/1) ... 15.19/7.06 [2019-03-28 12:32:46,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 15.19/7.06 [2019-03-28 12:32:46,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 15.19/7.06 [2019-03-28 12:32:46,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 15.19/7.06 [2019-03-28 12:32:46,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized 15.19/7.06 [2019-03-28 12:32:46,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:32:46" (1/1) ... 15.19/7.06 [2019-03-28 12:32:46,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:32:46" (1/1) ... 15.19/7.06 [2019-03-28 12:32:46,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:32:46" (1/1) ... 15.19/7.06 [2019-03-28 12:32:46,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:32:46" (1/1) ... 15.19/7.06 [2019-03-28 12:32:46,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:32:46" (1/1) ... 15.19/7.06 [2019-03-28 12:32:46,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:32:46" (1/1) ... 15.19/7.06 [2019-03-28 12:32:46,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:32:46" (1/1) ... 15.19/7.06 [2019-03-28 12:32:46,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 15.19/7.06 [2019-03-28 12:32:46,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 15.19/7.06 [2019-03-28 12:32:46,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... 15.19/7.06 [2019-03-28 12:32:46,800 INFO L276 PluginConnector]: RCFGBuilder initialized 15.19/7.06 [2019-03-28 12:32:46,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:32:46" (1/1) ... 15.19/7.06 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 15.19/7.06 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 15.19/7.06 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 15.19/7.06 [2019-03-28 12:32:46,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 15.19/7.06 [2019-03-28 12:32:46,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 15.19/7.06 [2019-03-28 12:32:46,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 15.19/7.06 [2019-03-28 12:32:46,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 15.19/7.06 [2019-03-28 12:32:46,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 15.19/7.06 [2019-03-28 12:32:46,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 15.19/7.06 [2019-03-28 12:32:47,040 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 15.19/7.06 [2019-03-28 12:32:47,041 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 15.19/7.06 [2019-03-28 12:32:47,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:32:47 BoogieIcfgContainer 15.19/7.06 [2019-03-28 12:32:47,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 15.19/7.06 [2019-03-28 12:32:47,044 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 15.19/7.06 [2019-03-28 12:32:47,044 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 15.19/7.06 [2019-03-28 12:32:47,046 INFO L276 PluginConnector]: BlockEncodingV2 initialized 15.19/7.06 [2019-03-28 12:32:47,047 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:32:47" (1/1) ... 15.19/7.06 [2019-03-28 12:32:47,062 INFO L313 BlockEncoder]: Initial Icfg 17 locations, 18 edges 15.19/7.06 [2019-03-28 12:32:47,063 INFO L258 BlockEncoder]: Using Remove infeasible edges 15.19/7.06 [2019-03-28 12:32:47,064 INFO L263 BlockEncoder]: Using Maximize final states 15.19/7.06 [2019-03-28 12:32:47,064 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 15.19/7.06 [2019-03-28 12:32:47,065 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 15.19/7.06 [2019-03-28 12:32:47,066 INFO L296 BlockEncoder]: Using Remove sink states 15.19/7.06 [2019-03-28 12:32:47,067 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 15.19/7.06 [2019-03-28 12:32:47,067 INFO L179 BlockEncoder]: Using Rewrite not-equals 15.19/7.06 [2019-03-28 12:32:47,085 INFO L185 BlockEncoder]: Using Use SBE 15.19/7.06 [2019-03-28 12:32:47,103 INFO L200 BlockEncoder]: SBE split 7 edges 15.19/7.06 [2019-03-28 12:32:47,108 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 15.19/7.06 [2019-03-28 12:32:47,109 INFO L71 MaximizeFinalStates]: 0 new accepting states 15.19/7.06 [2019-03-28 12:32:47,127 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding 15.19/7.06 [2019-03-28 12:32:47,129 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 15.19/7.06 [2019-03-28 12:32:47,131 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 15.19/7.06 [2019-03-28 12:32:47,131 INFO L71 MaximizeFinalStates]: 0 new accepting states 15.19/7.06 [2019-03-28 12:32:47,137 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 15.19/7.06 [2019-03-28 12:32:47,138 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 15.19/7.06 [2019-03-28 12:32:47,138 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 15.19/7.06 [2019-03-28 12:32:47,138 INFO L71 MaximizeFinalStates]: 0 new accepting states 15.19/7.06 [2019-03-28 12:32:47,138 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 15.19/7.06 [2019-03-28 12:32:47,139 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 15.19/7.06 [2019-03-28 12:32:47,139 INFO L313 BlockEncoder]: Encoded RCFG 11 locations, 18 edges 15.19/7.06 [2019-03-28 12:32:47,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:32:47 BasicIcfg 15.19/7.06 [2019-03-28 12:32:47,140 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 15.19/7.06 [2019-03-28 12:32:47,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 15.19/7.06 [2019-03-28 12:32:47,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... 15.19/7.06 [2019-03-28 12:32:47,144 INFO L276 PluginConnector]: TraceAbstraction initialized 15.19/7.06 [2019-03-28 12:32:47,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:32:46" (1/4) ... 15.19/7.06 [2019-03-28 12:32:47,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4119a19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:32:47, skipping insertion in model container 15.19/7.06 [2019-03-28 12:32:47,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:32:46" (2/4) ... 15.19/7.06 [2019-03-28 12:32:47,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4119a19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:32:47, skipping insertion in model container 15.19/7.06 [2019-03-28 12:32:47,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:32:47" (3/4) ... 15.19/7.06 [2019-03-28 12:32:47,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4119a19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:32:47, skipping insertion in model container 15.19/7.06 [2019-03-28 12:32:47,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:32:47" (4/4) ... 15.19/7.06 [2019-03-28 12:32:47,149 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 15.19/7.06 [2019-03-28 12:32:47,159 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 15.19/7.06 [2019-03-28 12:32:47,167 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. 15.19/7.06 [2019-03-28 12:32:47,184 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. 15.19/7.06 [2019-03-28 12:32:47,213 INFO L133 ementStrategyFactory]: Using default assertion order modulation 15.19/7.06 [2019-03-28 12:32:47,214 INFO L382 AbstractCegarLoop]: Interprodecural is true 15.19/7.06 [2019-03-28 12:32:47,214 INFO L383 AbstractCegarLoop]: Hoare is true 15.19/7.06 [2019-03-28 12:32:47,214 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 15.19/7.06 [2019-03-28 12:32:47,215 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 15.19/7.06 [2019-03-28 12:32:47,215 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 15.19/7.06 [2019-03-28 12:32:47,215 INFO L387 AbstractCegarLoop]: Difference is false 15.19/7.06 [2019-03-28 12:32:47,215 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 15.19/7.06 [2019-03-28 12:32:47,215 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 15.19/7.06 [2019-03-28 12:32:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. 15.19/7.06 [2019-03-28 12:32:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 15.19/7.06 [2019-03-28 12:32:47,236 INFO L394 BasicCegarLoop]: Found error trace 15.19/7.06 [2019-03-28 12:32:47,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 15.19/7.06 [2019-03-28 12:32:47,237 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 15.19/7.06 [2019-03-28 12:32:47,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.19/7.06 [2019-03-28 12:32:47,242 INFO L82 PathProgramCache]: Analyzing trace with hash 66149, now seen corresponding path program 1 times 15.19/7.06 [2019-03-28 12:32:47,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.19/7.06 [2019-03-28 12:32:47,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.19/7.06 [2019-03-28 12:32:47,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.19/7.06 [2019-03-28 12:32:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.19/7.06 [2019-03-28 12:32:47,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 15.19/7.06 [2019-03-28 12:32:47,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 15.19/7.06 [2019-03-28 12:32:47,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 15.19/7.06 [2019-03-28 12:32:47,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 15.19/7.06 [2019-03-28 12:32:47,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 15.19/7.06 [2019-03-28 12:32:47,423 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. 15.19/7.06 [2019-03-28 12:32:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 15.19/7.06 [2019-03-28 12:32:47,492 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. 15.19/7.06 [2019-03-28 12:32:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 15.19/7.06 [2019-03-28 12:32:47,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 15.19/7.06 [2019-03-28 12:32:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 15.19/7.06 [2019-03-28 12:32:47,507 INFO L225 Difference]: With dead ends: 11 15.19/7.06 [2019-03-28 12:32:47,508 INFO L226 Difference]: Without dead ends: 8 15.19/7.06 [2019-03-28 12:32:47,511 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 15.19/7.06 [2019-03-28 12:32:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. 15.19/7.06 [2019-03-28 12:32:47,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. 15.19/7.06 [2019-03-28 12:32:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 15.19/7.06 [2019-03-28 12:32:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. 15.19/7.06 [2019-03-28 12:32:47,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 3 15.19/7.06 [2019-03-28 12:32:47,553 INFO L84 Accepts]: Finished accepts. word is rejected. 15.19/7.06 [2019-03-28 12:32:47,553 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 12 transitions. 15.19/7.06 [2019-03-28 12:32:47,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 15.19/7.06 [2019-03-28 12:32:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. 15.19/7.06 [2019-03-28 12:32:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 15.19/7.06 [2019-03-28 12:32:47,554 INFO L394 BasicCegarLoop]: Found error trace 15.19/7.06 [2019-03-28 12:32:47,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 15.19/7.06 [2019-03-28 12:32:47,554 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== 15.19/7.06 [2019-03-28 12:32:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.19/7.06 [2019-03-28 12:32:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash 66151, now seen corresponding path program 1 times 15.19/7.06 [2019-03-28 12:32:47,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.19/7.06 [2019-03-28 12:32:47,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.19/7.06 [2019-03-28 12:32:47,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.19/7.06 [2019-03-28 12:32:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.19/7.06 [2019-03-28 12:32:47,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 15.19/7.06 [2019-03-28 12:32:47,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 15.19/7.06 [2019-03-28 12:32:47,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 15.19/7.06 [2019-03-28 12:32:47,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 15.19/7.06 [2019-03-28 12:32:47,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 15.19/7.06 [2019-03-28 12:32:47,599 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. Second operand 3 states. 15.19/7.06 [2019-03-28 12:32:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 15.19/7.06 [2019-03-28 12:32:47,626 INFO L93 Difference]: Finished difference Result 8 states and 12 transitions. 15.19/7.06 [2019-03-28 12:32:47,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 15.19/7.06 [2019-03-28 12:32:47,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 15.19/7.06 [2019-03-28 12:32:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 15.19/7.06 [2019-03-28 12:32:47,627 INFO L225 Difference]: With dead ends: 8 15.19/7.06 [2019-03-28 12:32:47,627 INFO L226 Difference]: Without dead ends: 0 15.19/7.06 [2019-03-28 12:32:47,628 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 15.19/7.06 [2019-03-28 12:32:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 15.19/7.06 [2019-03-28 12:32:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 15.19/7.06 [2019-03-28 12:32:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 15.19/7.06 [2019-03-28 12:32:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 15.19/7.06 [2019-03-28 12:32:47,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 15.19/7.06 [2019-03-28 12:32:47,629 INFO L84 Accepts]: Finished accepts. word is rejected. 15.19/7.06 [2019-03-28 12:32:47,630 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 15.19/7.06 [2019-03-28 12:32:47,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 15.19/7.06 [2019-03-28 12:32:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 15.19/7.06 [2019-03-28 12:32:47,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 15.19/7.06 [2019-03-28 12:32:47,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 15.19/7.06 [2019-03-28 12:32:47,654 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 15.19/7.06 [2019-03-28 12:32:47,654 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 15.19/7.06 [2019-03-28 12:32:47,655 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 15.19/7.06 [2019-03-28 12:32:47,655 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 15.19/7.06 [2019-03-28 12:32:47,655 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 15.19/7.06 [2019-03-28 12:32:47,655 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 15.19/7.06 [2019-03-28 12:32:47,655 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 15.19/7.06 [2019-03-28 12:32:47,655 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 15.19/7.06 [2019-03-28 12:32:47,655 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 15.19/7.06 [2019-03-28 12:32:47,656 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 15.19/7.06 [2019-03-28 12:32:47,656 INFO L444 ceAbstractionStarter]: At program point L12-3(lines 12 14) the Hoare annotation is: (and (= |ULTIMATE.start_main_~#a~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_main_~#a~0.base|)) (= (select |#length| |ULTIMATE.start_main_~#a~0.base|) 4192)) 15.19/7.06 [2019-03-28 12:32:47,656 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 15.19/7.06 [2019-03-28 12:32:47,664 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 15.19/7.06 [2019-03-28 12:32:47,670 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 15.19/7.06 [2019-03-28 12:32:47,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:32:47 BasicIcfg 15.19/7.06 [2019-03-28 12:32:47,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 15.19/7.06 [2019-03-28 12:32:47,673 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 15.19/7.06 [2019-03-28 12:32:47,673 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 15.19/7.06 [2019-03-28 12:32:47,676 INFO L276 PluginConnector]: BuchiAutomizer initialized 15.19/7.06 [2019-03-28 12:32:47,677 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.19/7.06 [2019-03-28 12:32:47,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:32:46" (1/5) ... 15.19/7.06 [2019-03-28 12:32:47,677 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78895f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:32:47, skipping insertion in model container 15.19/7.06 [2019-03-28 12:32:47,678 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.19/7.06 [2019-03-28 12:32:47,678 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:32:46" (2/5) ... 15.19/7.06 [2019-03-28 12:32:47,678 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78895f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:32:47, skipping insertion in model container 15.19/7.06 [2019-03-28 12:32:47,678 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.19/7.06 [2019-03-28 12:32:47,678 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:32:47" (3/5) ... 15.19/7.06 [2019-03-28 12:32:47,679 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78895f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:32:47, skipping insertion in model container 15.19/7.06 [2019-03-28 12:32:47,679 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.19/7.06 [2019-03-28 12:32:47,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:32:47" (4/5) ... 15.19/7.06 [2019-03-28 12:32:47,679 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78895f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:32:47, skipping insertion in model container 15.19/7.06 [2019-03-28 12:32:47,679 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 15.19/7.06 [2019-03-28 12:32:47,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:32:47" (5/5) ... 15.19/7.06 [2019-03-28 12:32:47,681 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 15.19/7.06 [2019-03-28 12:32:47,703 INFO L133 ementStrategyFactory]: Using default assertion order modulation 15.19/7.06 [2019-03-28 12:32:47,703 INFO L374 BuchiCegarLoop]: Interprodecural is true 15.19/7.06 [2019-03-28 12:32:47,703 INFO L375 BuchiCegarLoop]: Hoare is true 15.19/7.06 [2019-03-28 12:32:47,703 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 15.19/7.06 [2019-03-28 12:32:47,703 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 15.19/7.06 [2019-03-28 12:32:47,703 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 15.19/7.06 [2019-03-28 12:32:47,704 INFO L379 BuchiCegarLoop]: Difference is false 15.19/7.06 [2019-03-28 12:32:47,704 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 15.19/7.06 [2019-03-28 12:32:47,704 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 15.19/7.06 [2019-03-28 12:32:47,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. 15.19/7.06 [2019-03-28 12:32:47,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 15.19/7.06 [2019-03-28 12:32:47,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 15.19/7.06 [2019-03-28 12:32:47,712 INFO L119 BuchiIsEmpty]: Starting construction of run 15.19/7.06 [2019-03-28 12:32:47,716 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 15.19/7.06 [2019-03-28 12:32:47,717 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 15.19/7.06 [2019-03-28 12:32:47,717 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 15.19/7.06 [2019-03-28 12:32:47,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. 15.19/7.06 [2019-03-28 12:32:47,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 15.19/7.06 [2019-03-28 12:32:47,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 15.19/7.06 [2019-03-28 12:32:47,718 INFO L119 BuchiIsEmpty]: Starting construction of run 15.19/7.06 [2019-03-28 12:32:47,719 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 15.19/7.06 [2019-03-28 12:32:47,719 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 15.19/7.06 [2019-03-28 12:32:47,724 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [36] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 3#L-1true [56] L-1-->L12-3: Formula: (and (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1|)) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1| 1) |v_#valid_3|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_~#a~0.base_1| 4192)) (< |v_ULTIMATE.start_main_~#a~0.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_~#a~0.offset_1|) (> |v_ULTIMATE.start_main_~#a~0.base_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_1|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem0=|v_ULTIMATE.start_main_#t~mem0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem0] 11#L12-3true 15.19/7.06 [2019-03-28 12:32:47,725 INFO L796 eck$LassoCheckResult]: Loop: 11#L12-3true [73] L12-3-->L13: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_16| 12))) (and (<= 0 .cse0) (<= 0 (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#a~0.base_22|) .cse0)) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_16| 16) (select |v_#length_10| |v_ULTIMATE.start_main_~#a~0.base_22|)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#a~0.base_22|) 1))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_16|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_22|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_16|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_22|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem0=|v_ULTIMATE.start_main_#t~mem0_13|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem0] 9#L13true [43] L13-->L13-1: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_6| 12))) (and (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#a~0.base_7|) .cse0)) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_6| 16) (select |v_#length_5| |v_ULTIMATE.start_main_~#a~0.base_7|)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#a~0.base_7|) 1) (<= 0 .cse0))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_6|, #length=|v_#length_5|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_7|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_6|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_7|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 7#L13-1true [71] L13-1-->L12-3: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_14| 12))) (and (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_14| 16) (select |v_#length_9| |v_ULTIMATE.start_main_~#a~0.base_19|)) (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#a~0.base_19|) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#a~0.base_19| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#a~0.base_19|) .cse0 (+ |v_ULTIMATE.start_main_#t~mem1_6| (- 1))))) (<= 0 .cse0))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_14|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_19|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|, #length=|v_#length_9|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_14|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_19|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem1] 11#L12-3true 15.19/7.06 [2019-03-28 12:32:47,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.19/7.06 [2019-03-28 12:32:47,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2133, now seen corresponding path program 1 times 15.19/7.06 [2019-03-28 12:32:47,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.19/7.06 [2019-03-28 12:32:47,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.19/7.06 [2019-03-28 12:32:47,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:47,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.19/7.06 [2019-03-28 12:32:47,759 INFO L82 PathProgramCache]: Analyzing trace with hash 101348, now seen corresponding path program 1 times 15.19/7.06 [2019-03-28 12:32:47,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.19/7.06 [2019-03-28 12:32:47,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.19/7.06 [2019-03-28 12:32:47,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:47,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.19/7.06 [2019-03-28 12:32:47,772 INFO L82 PathProgramCache]: Analyzing trace with hash 63615760, now seen corresponding path program 1 times 15.19/7.06 [2019-03-28 12:32:47,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.19/7.06 [2019-03-28 12:32:47,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.19/7.06 [2019-03-28 12:32:47,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:47,925 INFO L216 LassoAnalysis]: Preferences: 15.19/7.06 [2019-03-28 12:32:47,927 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 15.19/7.06 [2019-03-28 12:32:47,927 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 15.19/7.06 [2019-03-28 12:32:47,927 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 15.19/7.06 [2019-03-28 12:32:47,927 INFO L127 ssoRankerPreferences]: Use exernal solver: false 15.19/7.06 [2019-03-28 12:32:47,927 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 15.19/7.06 [2019-03-28 12:32:47,927 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 15.19/7.06 [2019-03-28 12:32:47,928 INFO L130 ssoRankerPreferences]: Path of dumped script: 15.19/7.06 [2019-03-28 12:32:47,928 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 15.19/7.06 [2019-03-28 12:32:47,928 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 15.19/7.06 [2019-03-28 12:32:47,928 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 15.19/7.06 [2019-03-28 12:32:47,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.19/7.06 [2019-03-28 12:32:47,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.19/7.06 [2019-03-28 12:32:47,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.19/7.06 [2019-03-28 12:32:47,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.19/7.06 [2019-03-28 12:32:47,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.19/7.06 [2019-03-28 12:32:48,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.19/7.06 [2019-03-28 12:32:48,183 INFO L300 LassoAnalysis]: Preprocessing complete. 15.19/7.06 [2019-03-28 12:32:48,189 INFO L497 LassoAnalysis]: Using template 'affine'. 15.19/7.06 [2019-03-28 12:32:48,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.19/7.06 [2019-03-28 12:32:48,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.19/7.06 [2019-03-28 12:32:48,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.19/7.06 [2019-03-28 12:32:48,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.19/7.06 [2019-03-28 12:32:48,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.19/7.06 [2019-03-28 12:32:48,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.19/7.06 [2019-03-28 12:32:48,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.19/7.06 [2019-03-28 12:32:48,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.19/7.06 [2019-03-28 12:32:48,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.19/7.06 [2019-03-28 12:32:48,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.19/7.06 [2019-03-28 12:32:48,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,263 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 15.19/7.06 [2019-03-28 12:32:48,268 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 15.19/7.06 [2019-03-28 12:32:48,268 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 15.19/7.06 [2019-03-28 12:32:48,270 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 15.19/7.06 [2019-03-28 12:32:48,271 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 15.19/7.06 [2019-03-28 12:32:48,271 INFO L518 LassoAnalysis]: Proved termination. 15.19/7.06 [2019-03-28 12:32:48,271 INFO L520 LassoAnalysis]: Termination argument consisting of: 15.19/7.06 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~#a~0.base) (+ ULTIMATE.start_main_~#a~0.offset 12))_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~#a~0.base) (+ ULTIMATE.start_main_~#a~0.offset 12))_1 + 1 15.19/7.06 Supporting invariants [] 15.19/7.06 [2019-03-28 12:32:48,276 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed 15.19/7.06 [2019-03-28 12:32:48,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 15.19/7.06 [2019-03-28 12:32:48,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.19/7.06 [2019-03-28 12:32:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.19/7.06 [2019-03-28 12:32:48,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 15.19/7.06 [2019-03-28 12:32:48,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.19/7.06 [2019-03-28 12:32:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.19/7.06 [2019-03-28 12:32:48,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core 15.19/7.06 [2019-03-28 12:32:48,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.19/7.06 [2019-03-28 12:32:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.19/7.06 [2019-03-28 12:32:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:48,406 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 15.19/7.06 [2019-03-28 12:32:48,406 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 15.19/7.06 [2019-03-28 12:32:48,409 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 15.19/7.06 [2019-03-28 12:32:48,410 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states. Second operand 4 states. 15.19/7.06 [2019-03-28 12:32:48,513 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states.. Second operand 4 states. Result 29 states and 57 transitions. Complement of second has 8 states. 15.19/7.06 [2019-03-28 12:32:48,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 15.19/7.06 [2019-03-28 12:32:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 15.19/7.06 [2019-03-28 12:32:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. 15.19/7.06 [2019-03-28 12:32:48,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 3 letters. 15.19/7.06 [2019-03-28 12:32:48,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.19/7.06 [2019-03-28 12:32:48,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 3 letters. 15.19/7.06 [2019-03-28 12:32:48,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.19/7.06 [2019-03-28 12:32:48,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 6 letters. 15.19/7.06 [2019-03-28 12:32:48,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.19/7.06 [2019-03-28 12:32:48,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 57 transitions. 15.19/7.06 [2019-03-28 12:32:48,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 15.19/7.06 [2019-03-28 12:32:48,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 5 states and 5 transitions. 15.19/7.06 [2019-03-28 12:32:48,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 15.19/7.06 [2019-03-28 12:32:48,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 15.19/7.06 [2019-03-28 12:32:48,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 5 transitions. 15.19/7.06 [2019-03-28 12:32:48,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 15.19/7.06 [2019-03-28 12:32:48,533 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. 15.19/7.06 [2019-03-28 12:32:48,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 5 transitions. 15.19/7.06 [2019-03-28 12:32:48,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. 15.19/7.06 [2019-03-28 12:32:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 15.19/7.06 [2019-03-28 12:32:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. 15.19/7.06 [2019-03-28 12:32:48,535 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. 15.19/7.06 [2019-03-28 12:32:48,535 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 5 transitions. 15.19/7.06 [2019-03-28 12:32:48,535 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 15.19/7.06 [2019-03-28 12:32:48,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 5 transitions. 15.19/7.06 [2019-03-28 12:32:48,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 15.19/7.06 [2019-03-28 12:32:48,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 15.19/7.06 [2019-03-28 12:32:48,536 INFO L119 BuchiIsEmpty]: Starting construction of run 15.19/7.06 [2019-03-28 12:32:48,537 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 15.19/7.06 [2019-03-28 12:32:48,537 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 15.19/7.06 [2019-03-28 12:32:48,537 INFO L794 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY [36] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 91#L-1 [55] L-1-->L12-3: Formula: (and (< |v_ULTIMATE.start_main_~#a~0.base_1| 0) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1|)) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#a~0.base_1| 1) |v_#valid_3|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_~#a~0.base_1| 4192)) (< |v_ULTIMATE.start_main_~#a~0.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_~#a~0.offset_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_1|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem0=|v_ULTIMATE.start_main_#t~mem0_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#a~0.offset, ULTIMATE.start_main_~#a~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem0] 92#L12-3 15.19/7.06 [2019-03-28 12:32:48,537 INFO L796 eck$LassoCheckResult]: Loop: 92#L12-3 [73] L12-3-->L13: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_16| 12))) (and (<= 0 .cse0) (<= 0 (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#a~0.base_22|) .cse0)) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_16| 16) (select |v_#length_10| |v_ULTIMATE.start_main_~#a~0.base_22|)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#a~0.base_22|) 1))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_16|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_22|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_7|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_16|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_22|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem0=|v_ULTIMATE.start_main_#t~mem0_13|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem0] 95#L13 [43] L13-->L13-1: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_6| 12))) (and (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#a~0.base_7|) .cse0)) (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_6| 16) (select |v_#length_5| |v_ULTIMATE.start_main_~#a~0.base_7|)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#a~0.base_7|) 1) (<= 0 .cse0))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_6|, #length=|v_#length_5|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_7|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_6|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_7|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 94#L13-1 [71] L13-1-->L12-3: Formula: (let ((.cse0 (+ |v_ULTIMATE.start_main_~#a~0.offset_14| 12))) (and (<= (+ |v_ULTIMATE.start_main_~#a~0.offset_14| 16) (select |v_#length_9| |v_ULTIMATE.start_main_~#a~0.base_19|)) (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#a~0.base_19|) 1) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#a~0.base_19| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#a~0.base_19|) .cse0 (+ |v_ULTIMATE.start_main_#t~mem1_6| (- 1))))) (<= 0 .cse0))) InVars {ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_14|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_19|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|, #length=|v_#length_9|} OutVars{ULTIMATE.start_main_~#a~0.offset=|v_ULTIMATE.start_main_~#a~0.offset_14|, ULTIMATE.start_main_~#a~0.base=|v_ULTIMATE.start_main_~#a~0.base_19|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem1] 92#L12-3 15.19/7.06 [2019-03-28 12:32:48,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.19/7.06 [2019-03-28 12:32:48,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2132, now seen corresponding path program 1 times 15.19/7.06 [2019-03-28 12:32:48,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.19/7.06 [2019-03-28 12:32:48,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.19/7.06 [2019-03-28 12:32:48,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:48,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:48,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:48,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.19/7.06 [2019-03-28 12:32:48,549 INFO L82 PathProgramCache]: Analyzing trace with hash 101348, now seen corresponding path program 2 times 15.19/7.06 [2019-03-28 12:32:48,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.19/7.06 [2019-03-28 12:32:48,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.19/7.06 [2019-03-28 12:32:48,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:48,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:48,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:48,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.19/7.06 [2019-03-28 12:32:48,561 INFO L82 PathProgramCache]: Analyzing trace with hash 63585969, now seen corresponding path program 1 times 15.19/7.06 [2019-03-28 12:32:48,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 15.19/7.06 [2019-03-28 12:32:48,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 15.19/7.06 [2019-03-28 12:32:48,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:48,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:48,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 15.19/7.06 [2019-03-28 12:32:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:48,656 INFO L216 LassoAnalysis]: Preferences: 15.19/7.06 [2019-03-28 12:32:48,656 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 15.19/7.06 [2019-03-28 12:32:48,656 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 15.19/7.06 [2019-03-28 12:32:48,656 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 15.19/7.06 [2019-03-28 12:32:48,657 INFO L127 ssoRankerPreferences]: Use exernal solver: false 15.19/7.06 [2019-03-28 12:32:48,657 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 15.19/7.06 [2019-03-28 12:32:48,657 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 15.19/7.06 [2019-03-28 12:32:48,657 INFO L130 ssoRankerPreferences]: Path of dumped script: 15.19/7.06 [2019-03-28 12:32:48,657 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 15.19/7.06 [2019-03-28 12:32:48,657 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 15.19/7.06 [2019-03-28 12:32:48,657 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 15.19/7.06 [2019-03-28 12:32:48,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.19/7.06 [2019-03-28 12:32:48,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.19/7.06 [2019-03-28 12:32:48,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.19/7.06 [2019-03-28 12:32:48,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.19/7.06 [2019-03-28 12:32:48,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.19/7.06 [2019-03-28 12:32:48,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 15.19/7.06 [2019-03-28 12:32:48,825 INFO L300 LassoAnalysis]: Preprocessing complete. 15.19/7.06 [2019-03-28 12:32:48,825 INFO L497 LassoAnalysis]: Using template 'affine'. 15.19/7.06 [2019-03-28 12:32:48,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.19/7.06 [2019-03-28 12:32:48,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.19/7.06 [2019-03-28 12:32:48,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.19/7.06 [2019-03-28 12:32:48,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.19/7.06 [2019-03-28 12:32:48,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.19/7.06 [2019-03-28 12:32:48,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 15.19/7.06 [2019-03-28 12:32:48,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 15.19/7.06 Termination analysis: LINEAR_WITH_GUESSES 15.19/7.06 Number of strict supporting invariants: 0 15.19/7.06 Number of non-strict supporting invariants: 1 15.19/7.06 Consider only non-deceasing supporting invariants: true 15.19/7.06 Simplify termination arguments: true 15.19/7.06 Simplify supporting invariants: trueOverapproximate stem: false 15.19/7.06 [2019-03-28 12:32:48,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. 15.19/7.06 [2019-03-28 12:32:48,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 15.19/7.06 [2019-03-28 12:32:48,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 15.19/7.06 [2019-03-28 12:32:48,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 15.19/7.06 [2019-03-28 12:32:48,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 15.19/7.06 [2019-03-28 12:32:48,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 15.19/7.06 [2019-03-28 12:32:48,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 15.19/7.06 [2019-03-28 12:32:48,875 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 15.19/7.06 [2019-03-28 12:32:48,877 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 15.19/7.06 [2019-03-28 12:32:48,878 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 15.19/7.06 [2019-03-28 12:32:48,878 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 15.19/7.06 [2019-03-28 12:32:48,878 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 15.19/7.06 [2019-03-28 12:32:48,878 INFO L518 LassoAnalysis]: Proved termination. 15.19/7.06 [2019-03-28 12:32:48,879 INFO L520 LassoAnalysis]: Termination argument consisting of: 15.19/7.06 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~#a~0.base) (+ ULTIMATE.start_main_~#a~0.offset 12))_2) = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~#a~0.base) (+ ULTIMATE.start_main_~#a~0.offset 12))_2 + 1 15.19/7.06 Supporting invariants [] 15.19/7.06 [2019-03-28 12:32:48,884 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed 15.19/7.06 [2019-03-28 12:32:48,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 15.19/7.06 [2019-03-28 12:32:48,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 15.19/7.06 [2019-03-28 12:32:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.19/7.06 [2019-03-28 12:32:48,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core 15.19/7.06 [2019-03-28 12:32:48,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.19/7.06 [2019-03-28 12:32:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 15.19/7.06 [2019-03-28 12:32:48,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core 15.19/7.06 [2019-03-28 12:32:48,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... 15.19/7.06 [2019-03-28 12:32:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 15.19/7.06 [2019-03-28 12:32:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 15.19/7.06 [2019-03-28 12:32:48,995 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 15.19/7.06 [2019-03-28 12:32:48,996 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 15.19/7.06 [2019-03-28 12:32:48,996 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 15.19/7.06 [2019-03-28 12:32:48,996 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1 Second operand 4 states. 15.19/7.06 [2019-03-28 12:32:49,020 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 5 states and 5 transitions. cyclomatic complexity: 1. Second operand 4 states. Result 8 states and 9 transitions. Complement of second has 6 states. 15.19/7.06 [2019-03-28 12:32:49,020 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 15.19/7.06 [2019-03-28 12:32:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 15.19/7.06 [2019-03-28 12:32:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. 15.19/7.06 [2019-03-28 12:32:49,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 3 letters. 15.19/7.06 [2019-03-28 12:32:49,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.19/7.06 [2019-03-28 12:32:49,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. 15.19/7.06 [2019-03-28 12:32:49,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.19/7.06 [2019-03-28 12:32:49,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. 15.19/7.06 [2019-03-28 12:32:49,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. 15.19/7.06 [2019-03-28 12:32:49,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. 15.19/7.06 [2019-03-28 12:32:49,027 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 15.19/7.06 [2019-03-28 12:32:49,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. 15.19/7.06 [2019-03-28 12:32:49,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 15.19/7.06 [2019-03-28 12:32:49,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 15.19/7.06 [2019-03-28 12:32:49,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 15.19/7.06 [2019-03-28 12:32:49,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 15.19/7.06 [2019-03-28 12:32:49,027 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 15.19/7.06 [2019-03-28 12:32:49,028 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 15.19/7.06 [2019-03-28 12:32:49,028 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 15.19/7.06 [2019-03-28 12:32:49,028 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 15.19/7.06 [2019-03-28 12:32:49,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 15.19/7.06 [2019-03-28 12:32:49,028 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 15.19/7.06 [2019-03-28 12:32:49,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 15.19/7.06 [2019-03-28 12:32:49,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:32:49 BasicIcfg 15.19/7.06 [2019-03-28 12:32:49,036 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 15.19/7.06 [2019-03-28 12:32:49,037 INFO L168 Benchmark]: Toolchain (without parser) took 2595.96 ms. Allocated memory was 649.6 MB in the beginning and 672.1 MB in the end (delta: 22.5 MB). Free memory was 563.8 MB in the beginning and 406.0 MB in the end (delta: 157.8 MB). Peak memory consumption was 180.4 MB. Max. memory is 50.3 GB. 15.19/7.06 [2019-03-28 12:32:49,038 INFO L168 Benchmark]: CDTParser took 0.17 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. 15.19/7.06 [2019-03-28 12:32:49,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.31 ms. Allocated memory was 649.6 MB in the beginning and 672.1 MB in the end (delta: 22.5 MB). Free memory was 563.8 MB in the beginning and 638.7 MB in the end (delta: -74.9 MB). Peak memory consumption was 29.7 MB. Max. memory is 50.3 GB. 15.19/7.06 [2019-03-28 12:32:49,040 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.44 ms. Allocated memory is still 672.1 MB. Free memory was 638.7 MB in the beginning and 634.3 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. 15.19/7.06 [2019-03-28 12:32:49,040 INFO L168 Benchmark]: Boogie Preprocessor took 23.20 ms. Allocated memory is still 672.1 MB. Free memory was 634.3 MB in the beginning and 632.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. 15.19/7.06 [2019-03-28 12:32:49,041 INFO L168 Benchmark]: RCFGBuilder took 243.77 ms. Allocated memory is still 672.1 MB. Free memory was 632.9 MB in the beginning and 617.0 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 50.3 GB. 15.19/7.06 [2019-03-28 12:32:49,041 INFO L168 Benchmark]: BlockEncodingV2 took 96.31 ms. Allocated memory is still 672.1 MB. Free memory was 617.0 MB in the beginning and 610.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 15.19/7.06 [2019-03-28 12:32:49,042 INFO L168 Benchmark]: TraceAbstraction took 531.24 ms. Allocated memory is still 672.1 MB. Free memory was 610.3 MB in the beginning and 571.0 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 50.3 GB. 15.19/7.06 [2019-03-28 12:32:49,043 INFO L168 Benchmark]: BuchiAutomizer took 1363.31 ms. Allocated memory is still 672.1 MB. Free memory was 571.0 MB in the beginning and 406.0 MB in the end (delta: 165.1 MB). Peak memory consumption was 165.1 MB. Max. memory is 50.3 GB. 15.19/7.06 [2019-03-28 12:32:49,047 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 15.19/7.06 --- Results --- 15.19/7.06 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 15.19/7.06 - StatisticsResult: Initial Icfg 15.19/7.06 17 locations, 18 edges 15.19/7.06 - StatisticsResult: Encoded RCFG 15.19/7.06 11 locations, 18 edges 15.19/7.06 * Results from de.uni_freiburg.informatik.ultimate.core: 15.19/7.06 - StatisticsResult: Toolchain Benchmarks 15.19/7.06 Benchmark results are: 15.19/7.06 * CDTParser took 0.17 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. 15.19/7.06 * CACSL2BoogieTranslator took 295.31 ms. Allocated memory was 649.6 MB in the beginning and 672.1 MB in the end (delta: 22.5 MB). Free memory was 563.8 MB in the beginning and 638.7 MB in the end (delta: -74.9 MB). Peak memory consumption was 29.7 MB. Max. memory is 50.3 GB. 15.19/7.06 * Boogie Procedure Inliner took 37.44 ms. Allocated memory is still 672.1 MB. Free memory was 638.7 MB in the beginning and 634.3 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. 15.19/7.06 * Boogie Preprocessor took 23.20 ms. Allocated memory is still 672.1 MB. Free memory was 634.3 MB in the beginning and 632.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. 15.19/7.06 * RCFGBuilder took 243.77 ms. Allocated memory is still 672.1 MB. Free memory was 632.9 MB in the beginning and 617.0 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 50.3 GB. 15.19/7.06 * BlockEncodingV2 took 96.31 ms. Allocated memory is still 672.1 MB. Free memory was 617.0 MB in the beginning and 610.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 15.19/7.06 * TraceAbstraction took 531.24 ms. Allocated memory is still 672.1 MB. Free memory was 610.3 MB in the beginning and 571.0 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 50.3 GB. 15.19/7.06 * BuchiAutomizer took 1363.31 ms. Allocated memory is still 672.1 MB. Free memory was 571.0 MB in the beginning and 406.0 MB in the end (delta: 165.1 MB). Peak memory consumption was 165.1 MB. Max. memory is 50.3 GB. 15.19/7.06 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 15.19/7.06 - GenericResult: Unfinished Backtranslation 15.19/7.06 unknown boogie variable #length 15.19/7.06 - GenericResult: Unfinished Backtranslation 15.19/7.06 unknown boogie variable #length 15.19/7.06 - GenericResult: Unfinished Backtranslation 15.19/7.06 unknown boogie variable #memory_int 15.19/7.06 - GenericResult: Unfinished Backtranslation 15.19/7.06 unknown boogie variable #memory_int 15.19/7.06 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 15.19/7.06 - PositiveResult [Line: 12]: pointer dereference always succeeds 15.19/7.06 For all program executions holds that pointer dereference always succeeds at this location 15.19/7.06 - PositiveResult [Line: 13]: pointer dereference always succeeds 15.19/7.06 For all program executions holds that pointer dereference always succeeds at this location 15.19/7.06 - PositiveResult [Line: 13]: pointer dereference always succeeds 15.19/7.06 For all program executions holds that pointer dereference always succeeds at this location 15.19/7.06 - PositiveResult [Line: 13]: pointer dereference always succeeds 15.19/7.06 For all program executions holds that pointer dereference always succeeds at this location 15.19/7.06 - PositiveResult [Line: 12]: pointer dereference always succeeds 15.19/7.06 For all program executions holds that pointer dereference always succeeds at this location 15.19/7.06 - PositiveResult [Line: 13]: pointer dereference always succeeds 15.19/7.06 For all program executions holds that pointer dereference always succeeds at this location 15.19/7.06 - AllSpecificationsHoldResult: All specifications hold 15.19/7.06 6 specifications checked. All of them hold 15.19/7.06 - InvariantResult [Line: 12]: Loop Invariant 15.19/7.06 [2019-03-28 12:32:49,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 15.19/7.06 [2019-03-28 12:32:49,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 15.19/7.06 Derived loop invariant: (a == 0 && 1 == \valid[a]) && unknown-#length-unknown[a] == 4192 15.19/7.06 - StatisticsResult: Ultimate Automizer benchmark data 15.19/7.06 CFG has 1 procedures, 11 locations, 6 error locations. SAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2 SDtfs, 12 SDslu, 1 SDs, 0 SdLazy, 17 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 14 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 15.19/7.06 - StatisticsResult: Constructed decomposition of program 15.19/7.06 Your program was decomposed into 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[a][a + 12] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[a][a + 12] + 1 and consists of 4 locations. 15.19/7.06 - StatisticsResult: Timing statistics 15.19/7.06 BüchiAutomizer plugin needed 1.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 5 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 8 SDtfs, 53 SDslu, 0 SDs, 0 SdLazy, 71 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital87 mio100 ax100 hnf100 lsp93 ukn50 mio100 lsp43 div100 bol100 ite100 ukn100 eq144 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 15.19/7.06 - TerminationAnalysisResult: Termination proven 15.19/7.06 Buchi Automizer proved that your program is terminating 15.19/7.06 RESULT: Ultimate proved your program to be correct! 15.19/7.06 !SESSION 2019-03-28 12:32:43.163 ----------------------------------------------- 15.19/7.06 eclipse.buildId=unknown 15.19/7.06 java.version=1.8.0_181 15.19/7.06 java.vendor=Oracle Corporation 15.19/7.06 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 15.19/7.06 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 15.19/7.06 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 15.19/7.06 15.19/7.06 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:32:49.286 15.19/7.06 !MESSAGE The workspace will exit with unsaved changes in this session. 15.19/7.06 Received shutdown request... 15.19/7.06 Ultimate: 15.19/7.06 GTK+ Version Check 15.19/7.06 EOF