20.40/9.14 NO 20.40/9.14 20.40/9.14 Ultimate: Cannot open display: 20.40/9.14 This is Ultimate 0.1.24-8dc7c08-m 20.40/9.14 [2019-03-28 12:46:00,562 INFO L170 SettingsManager]: Resetting all preferences to default values... 20.40/9.14 [2019-03-28 12:46:00,564 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 20.40/9.14 [2019-03-28 12:46:00,576 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 20.40/9.14 [2019-03-28 12:46:00,576 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 20.40/9.14 [2019-03-28 12:46:00,577 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 20.40/9.14 [2019-03-28 12:46:00,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 20.40/9.14 [2019-03-28 12:46:00,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 20.40/9.14 [2019-03-28 12:46:00,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 20.40/9.14 [2019-03-28 12:46:00,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 20.40/9.14 [2019-03-28 12:46:00,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 20.40/9.14 [2019-03-28 12:46:00,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 20.40/9.14 [2019-03-28 12:46:00,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 20.40/9.14 [2019-03-28 12:46:00,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 20.40/9.14 [2019-03-28 12:46:00,586 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 20.40/9.14 [2019-03-28 12:46:00,587 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 20.40/9.14 [2019-03-28 12:46:00,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 20.40/9.14 [2019-03-28 12:46:00,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 20.40/9.14 [2019-03-28 12:46:00,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 20.40/9.14 [2019-03-28 12:46:00,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 20.40/9.14 [2019-03-28 12:46:00,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 20.40/9.14 [2019-03-28 12:46:00,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 20.40/9.14 [2019-03-28 12:46:00,597 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 20.40/9.14 [2019-03-28 12:46:00,597 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 20.40/9.14 [2019-03-28 12:46:00,597 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 20.40/9.14 [2019-03-28 12:46:00,598 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 20.40/9.14 [2019-03-28 12:46:00,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 20.40/9.14 [2019-03-28 12:46:00,600 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 20.40/9.14 [2019-03-28 12:46:00,600 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 20.40/9.14 [2019-03-28 12:46:00,600 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 20.40/9.14 [2019-03-28 12:46:00,601 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 20.40/9.14 [2019-03-28 12:46:00,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 20.40/9.14 [2019-03-28 12:46:00,603 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 20.40/9.14 [2019-03-28 12:46:00,603 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 20.40/9.14 [2019-03-28 12:46:00,604 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 20.40/9.14 [2019-03-28 12:46:00,604 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 20.40/9.14 [2019-03-28 12:46:00,604 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 20.40/9.14 [2019-03-28 12:46:00,605 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 20.40/9.14 [2019-03-28 12:46:00,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 20.40/9.14 [2019-03-28 12:46:00,606 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 20.40/9.14 [2019-03-28 12:46:00,621 INFO L110 SettingsManager]: Loading preferences was successful 20.40/9.14 [2019-03-28 12:46:00,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 20.40/9.14 [2019-03-28 12:46:00,622 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 20.40/9.14 [2019-03-28 12:46:00,622 INFO L133 SettingsManager]: * Rewrite not-equals=true 20.40/9.14 [2019-03-28 12:46:00,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 20.40/9.14 [2019-03-28 12:46:00,623 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 20.40/9.14 [2019-03-28 12:46:00,623 INFO L133 SettingsManager]: * Use SBE=true 20.40/9.14 [2019-03-28 12:46:00,623 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 20.40/9.14 [2019-03-28 12:46:00,623 INFO L133 SettingsManager]: * Use old map elimination=false 20.40/9.14 [2019-03-28 12:46:00,624 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 20.40/9.14 [2019-03-28 12:46:00,624 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 20.40/9.14 [2019-03-28 12:46:00,624 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 20.40/9.14 [2019-03-28 12:46:00,624 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 20.40/9.14 [2019-03-28 12:46:00,624 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 20.40/9.14 [2019-03-28 12:46:00,624 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 20.40/9.14 [2019-03-28 12:46:00,625 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 20.40/9.14 [2019-03-28 12:46:00,625 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 20.40/9.14 [2019-03-28 12:46:00,625 INFO L133 SettingsManager]: * Check division by zero=IGNORE 20.40/9.14 [2019-03-28 12:46:00,625 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 20.40/9.14 [2019-03-28 12:46:00,625 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 20.40/9.14 [2019-03-28 12:46:00,625 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 20.40/9.14 [2019-03-28 12:46:00,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 20.40/9.14 [2019-03-28 12:46:00,626 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 20.40/9.14 [2019-03-28 12:46:00,626 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 20.40/9.14 [2019-03-28 12:46:00,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.40/9.14 [2019-03-28 12:46:00,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 20.40/9.14 [2019-03-28 12:46:00,627 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 20.40/9.14 [2019-03-28 12:46:00,627 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 20.40/9.14 [2019-03-28 12:46:00,627 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 20.40/9.14 [2019-03-28 12:46:00,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 20.40/9.14 [2019-03-28 12:46:00,665 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 20.40/9.14 [2019-03-28 12:46:00,669 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 20.40/9.14 [2019-03-28 12:46:00,671 INFO L271 PluginConnector]: Initializing CDTParser... 20.40/9.14 [2019-03-28 12:46:00,671 INFO L276 PluginConnector]: CDTParser initialized 20.40/9.14 [2019-03-28 12:46:00,672 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 20.40/9.14 [2019-03-28 12:46:00,734 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/b29ded4b0b8e4cefa136039efb56856d/FLAGc79852655 20.40/9.14 [2019-03-28 12:46:01,075 INFO L307 CDTParser]: Found 1 translation units. 20.40/9.14 [2019-03-28 12:46:01,075 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 20.40/9.14 [2019-03-28 12:46:01,076 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 20.40/9.14 [2019-03-28 12:46:01,082 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/b29ded4b0b8e4cefa136039efb56856d/FLAGc79852655 20.40/9.14 [2019-03-28 12:46:01,477 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/b29ded4b0b8e4cefa136039efb56856d 20.40/9.14 [2019-03-28 12:46:01,488 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 20.40/9.14 [2019-03-28 12:46:01,490 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 20.40/9.14 [2019-03-28 12:46:01,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 20.40/9.14 [2019-03-28 12:46:01,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 20.40/9.14 [2019-03-28 12:46:01,495 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 20.40/9.14 [2019-03-28 12:46:01,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:01" (1/1) ... 20.40/9.14 [2019-03-28 12:46:01,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7708fc40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01, skipping insertion in model container 20.40/9.14 [2019-03-28 12:46:01,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:01" (1/1) ... 20.40/9.14 [2019-03-28 12:46:01,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 20.40/9.14 [2019-03-28 12:46:01,524 INFO L176 MainTranslator]: Built tables and reachable declarations 20.40/9.14 [2019-03-28 12:46:01,686 INFO L206 PostProcessor]: Analyzing one entry point: main 20.40/9.14 [2019-03-28 12:46:01,699 INFO L191 MainTranslator]: Completed pre-run 20.40/9.14 [2019-03-28 12:46:01,717 INFO L206 PostProcessor]: Analyzing one entry point: main 20.40/9.14 [2019-03-28 12:46:01,794 INFO L195 MainTranslator]: Completed translation 20.40/9.14 [2019-03-28 12:46:01,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01 WrapperNode 20.40/9.14 [2019-03-28 12:46:01,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 20.40/9.14 [2019-03-28 12:46:01,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 20.40/9.14 [2019-03-28 12:46:01,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 20.40/9.14 [2019-03-28 12:46:01,796 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 20.40/9.14 [2019-03-28 12:46:01,806 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:46:01" (1/1) ... 20.40/9.14 [2019-03-28 12:46:01,816 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:46:01" (1/1) ... 20.40/9.14 [2019-03-28 12:46:01,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 20.40/9.14 [2019-03-28 12:46:01,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 20.40/9.14 [2019-03-28 12:46:01,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 20.40/9.14 [2019-03-28 12:46:01,839 INFO L276 PluginConnector]: Boogie Preprocessor initialized 20.40/9.14 [2019-03-28 12:46:01,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 20.40/9.14 [2019-03-28 12:46:01,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 20.40/9.14 [2019-03-28 12:46:01,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 20.40/9.14 [2019-03-28 12:46:01,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 20.40/9.14 [2019-03-28 12:46:01,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 20.40/9.14 [2019-03-28 12:46:01,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 20.40/9.14 [2019-03-28 12:46:01,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 20.40/9.14 [2019-03-28 12:46:01,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 20.40/9.14 [2019-03-28 12:46:01,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 20.40/9.14 [2019-03-28 12:46:01,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... 20.40/9.14 [2019-03-28 12:46:01,865 INFO L276 PluginConnector]: RCFGBuilder initialized 20.40/9.14 [2019-03-28 12:46:01,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (1/1) ... 20.40/9.14 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 20.40/9.14 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 20.40/9.14 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 20.40/9.14 [2019-03-28 12:46:01,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 20.40/9.14 [2019-03-28 12:46:01,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 20.40/9.14 [2019-03-28 12:46:01,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 20.40/9.14 [2019-03-28 12:46:01,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 20.40/9.14 [2019-03-28 12:46:01,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 20.40/9.14 [2019-03-28 12:46:01,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 20.40/9.14 [2019-03-28 12:46:02,192 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 20.40/9.14 [2019-03-28 12:46:02,193 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. 20.40/9.14 [2019-03-28 12:46:02,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:02 BoogieIcfgContainer 20.40/9.14 [2019-03-28 12:46:02,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 20.40/9.14 [2019-03-28 12:46:02,195 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 20.40/9.14 [2019-03-28 12:46:02,195 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 20.40/9.14 [2019-03-28 12:46:02,197 INFO L276 PluginConnector]: BlockEncodingV2 initialized 20.40/9.14 [2019-03-28 12:46:02,198 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:02" (1/1) ... 20.40/9.14 [2019-03-28 12:46:02,215 INFO L313 BlockEncoder]: Initial Icfg 44 locations, 49 edges 20.40/9.14 [2019-03-28 12:46:02,217 INFO L258 BlockEncoder]: Using Remove infeasible edges 20.40/9.14 [2019-03-28 12:46:02,217 INFO L263 BlockEncoder]: Using Maximize final states 20.40/9.14 [2019-03-28 12:46:02,218 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 20.40/9.14 [2019-03-28 12:46:02,218 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 20.40/9.14 [2019-03-28 12:46:02,220 INFO L296 BlockEncoder]: Using Remove sink states 20.40/9.14 [2019-03-28 12:46:02,221 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 20.40/9.14 [2019-03-28 12:46:02,221 INFO L179 BlockEncoder]: Using Rewrite not-equals 20.40/9.14 [2019-03-28 12:46:02,247 INFO L185 BlockEncoder]: Using Use SBE 20.40/9.14 [2019-03-28 12:46:02,281 INFO L200 BlockEncoder]: SBE split 24 edges 20.40/9.14 [2019-03-28 12:46:02,286 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 20.40/9.14 [2019-03-28 12:46:02,288 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.40/9.14 [2019-03-28 12:46:02,305 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding 20.40/9.14 [2019-03-28 12:46:02,308 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 20.40/9.14 [2019-03-28 12:46:02,310 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 20.40/9.14 [2019-03-28 12:46:02,310 INFO L71 MaximizeFinalStates]: 0 new accepting states 20.40/9.14 [2019-03-28 12:46:02,311 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 20.40/9.14 [2019-03-28 12:46:02,311 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 20.40/9.14 [2019-03-28 12:46:02,312 INFO L313 BlockEncoder]: Encoded RCFG 39 locations, 67 edges 20.40/9.14 [2019-03-28 12:46:02,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:02 BasicIcfg 20.40/9.14 [2019-03-28 12:46:02,313 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 20.40/9.14 [2019-03-28 12:46:02,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 20.40/9.14 [2019-03-28 12:46:02,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... 20.40/9.14 [2019-03-28 12:46:02,317 INFO L276 PluginConnector]: TraceAbstraction initialized 20.40/9.14 [2019-03-28 12:46:02,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:46:01" (1/4) ... 20.40/9.14 [2019-03-28 12:46:02,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a270f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:02, skipping insertion in model container 20.40/9.14 [2019-03-28 12:46:02,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (2/4) ... 20.40/9.14 [2019-03-28 12:46:02,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a270f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:02, skipping insertion in model container 20.40/9.14 [2019-03-28 12:46:02,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:02" (3/4) ... 20.40/9.14 [2019-03-28 12:46:02,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a270f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:02, skipping insertion in model container 20.40/9.14 [2019-03-28 12:46:02,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:02" (4/4) ... 20.40/9.14 [2019-03-28 12:46:02,322 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.40/9.14 [2019-03-28 12:46:02,333 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 20.40/9.14 [2019-03-28 12:46:02,342 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. 20.40/9.14 [2019-03-28 12:46:02,359 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. 20.40/9.14 [2019-03-28 12:46:02,389 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.40/9.14 [2019-03-28 12:46:02,389 INFO L382 AbstractCegarLoop]: Interprodecural is true 20.40/9.14 [2019-03-28 12:46:02,390 INFO L383 AbstractCegarLoop]: Hoare is true 20.40/9.14 [2019-03-28 12:46:02,390 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 20.40/9.14 [2019-03-28 12:46:02,390 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 20.40/9.14 [2019-03-28 12:46:02,390 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.40/9.14 [2019-03-28 12:46:02,390 INFO L387 AbstractCegarLoop]: Difference is false 20.40/9.14 [2019-03-28 12:46:02,390 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 20.40/9.14 [2019-03-28 12:46:02,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 20.40/9.14 [2019-03-28 12:46:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. 20.40/9.14 [2019-03-28 12:46:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 20.40/9.14 [2019-03-28 12:46:02,412 INFO L394 BasicCegarLoop]: Found error trace 20.40/9.14 [2019-03-28 12:46:02,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 20.40/9.14 [2019-03-28 12:46:02,414 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== 20.40/9.14 [2019-03-28 12:46:02,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:02,419 INFO L82 PathProgramCache]: Analyzing trace with hash 135498, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:02,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:02,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:02,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:02,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:02,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.40/9.14 [2019-03-28 12:46:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.40/9.14 [2019-03-28 12:46:02,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.40/9.14 [2019-03-28 12:46:02,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.40/9.14 [2019-03-28 12:46:02,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.40/9.14 [2019-03-28 12:46:02,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.40/9.14 [2019-03-28 12:46:02,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.40/9.14 [2019-03-28 12:46:02,602 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. 20.40/9.14 [2019-03-28 12:46:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.40/9.14 [2019-03-28 12:46:02,755 INFO L93 Difference]: Finished difference Result 39 states and 67 transitions. 20.40/9.14 [2019-03-28 12:46:02,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.40/9.14 [2019-03-28 12:46:02,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 20.40/9.14 [2019-03-28 12:46:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.40/9.14 [2019-03-28 12:46:02,771 INFO L225 Difference]: With dead ends: 39 20.40/9.14 [2019-03-28 12:46:02,772 INFO L226 Difference]: Without dead ends: 29 20.40/9.14 [2019-03-28 12:46:02,775 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 20.40/9.14 [2019-03-28 12:46:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 20.40/9.14 [2019-03-28 12:46:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 20.40/9.14 [2019-03-28 12:46:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 20.40/9.14 [2019-03-28 12:46:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. 20.40/9.14 [2019-03-28 12:46:02,817 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 47 transitions. Word has length 3 20.40/9.14 [2019-03-28 12:46:02,817 INFO L84 Accepts]: Finished accepts. word is rejected. 20.40/9.14 [2019-03-28 12:46:02,817 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 47 transitions. 20.40/9.14 [2019-03-28 12:46:02,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.40/9.14 [2019-03-28 12:46:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 47 transitions. 20.40/9.14 [2019-03-28 12:46:02,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 20.40/9.14 [2019-03-28 12:46:02,818 INFO L394 BasicCegarLoop]: Found error trace 20.40/9.14 [2019-03-28 12:46:02,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 20.40/9.14 [2019-03-28 12:46:02,818 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== 20.40/9.14 [2019-03-28 12:46:02,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:02,819 INFO L82 PathProgramCache]: Analyzing trace with hash 135500, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:02,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:02,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:02,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:02,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:02,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.40/9.14 [2019-03-28 12:46:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.40/9.14 [2019-03-28 12:46:02,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.40/9.14 [2019-03-28 12:46:02,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 20.40/9.14 [2019-03-28 12:46:02,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 20.40/9.14 [2019-03-28 12:46:02,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.40/9.14 [2019-03-28 12:46:02,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.40/9.14 [2019-03-28 12:46:02,854 INFO L87 Difference]: Start difference. First operand 29 states and 47 transitions. Second operand 3 states. 20.40/9.14 [2019-03-28 12:46:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.40/9.14 [2019-03-28 12:46:02,927 INFO L93 Difference]: Finished difference Result 29 states and 47 transitions. 20.40/9.14 [2019-03-28 12:46:02,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.40/9.14 [2019-03-28 12:46:02,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 20.40/9.14 [2019-03-28 12:46:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 20.40/9.14 [2019-03-28 12:46:02,928 INFO L225 Difference]: With dead ends: 29 20.40/9.14 [2019-03-28 12:46:02,928 INFO L226 Difference]: Without dead ends: 0 20.40/9.14 [2019-03-28 12:46:02,929 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 20.40/9.14 [2019-03-28 12:46:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 20.40/9.14 [2019-03-28 12:46:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 20.40/9.14 [2019-03-28 12:46:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 20.40/9.14 [2019-03-28 12:46:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 20.40/9.14 [2019-03-28 12:46:02,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 20.40/9.14 [2019-03-28 12:46:02,931 INFO L84 Accepts]: Finished accepts. word is rejected. 20.40/9.14 [2019-03-28 12:46:02,931 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 20.40/9.14 [2019-03-28 12:46:02,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 20.40/9.14 [2019-03-28 12:46:02,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 20.40/9.14 [2019-03-28 12:46:02,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 20.40/9.14 [2019-03-28 12:46:02,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 20.40/9.14 [2019-03-28 12:46:02,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,954 INFO L448 ceAbstractionStarter]: For program point L6-6(lines 6 18) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,954 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,956 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,956 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 5 19) the Hoare annotation is: (and (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base))) 20.40/9.14 [2019-03-28 12:46:02,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 5) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 5) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,957 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,957 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,957 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,957 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,958 INFO L448 ceAbstractionStarter]: For program point L7-1(lines 7 15) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,958 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,958 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,958 INFO L448 ceAbstractionStarter]: For program point L5-1(lines 5 19) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,958 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 7) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,958 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,958 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,959 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,959 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,959 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,959 INFO L448 ceAbstractionStarter]: For program point L10-1(lines 10 14) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,959 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,959 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,959 INFO L448 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,960 INFO L448 ceAbstractionStarter]: For program point L6-2(line 6) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,960 INFO L448 ceAbstractionStarter]: For program point L6-3(line 6) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,960 INFO L448 ceAbstractionStarter]: For program point L6-4(line 6) no Hoare annotation was computed. 20.40/9.14 [2019-03-28 12:46:02,960 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 20.40/9.14 [2019-03-28 12:46:02,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.40/9.14 [2019-03-28 12:46:02,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.40/9.14 [2019-03-28 12:46:02,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:02 BasicIcfg 20.40/9.14 [2019-03-28 12:46:02,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 20.40/9.14 [2019-03-28 12:46:02,978 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 20.40/9.14 [2019-03-28 12:46:02,979 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 20.40/9.14 [2019-03-28 12:46:02,982 INFO L276 PluginConnector]: BuchiAutomizer initialized 20.40/9.14 [2019-03-28 12:46:02,983 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.40/9.14 [2019-03-28 12:46:02,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:46:01" (1/5) ... 20.40/9.14 [2019-03-28 12:46:02,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@256cdcaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:02, skipping insertion in model container 20.40/9.14 [2019-03-28 12:46:02,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.40/9.14 [2019-03-28 12:46:02,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:01" (2/5) ... 20.40/9.14 [2019-03-28 12:46:02,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@256cdcaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:02, skipping insertion in model container 20.40/9.14 [2019-03-28 12:46:02,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.40/9.14 [2019-03-28 12:46:02,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:02" (3/5) ... 20.40/9.14 [2019-03-28 12:46:02,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@256cdcaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:02, skipping insertion in model container 20.40/9.14 [2019-03-28 12:46:02,985 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.40/9.14 [2019-03-28 12:46:02,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:02" (4/5) ... 20.40/9.14 [2019-03-28 12:46:02,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@256cdcaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:02, skipping insertion in model container 20.40/9.14 [2019-03-28 12:46:02,985 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 20.40/9.14 [2019-03-28 12:46:02,986 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:02" (5/5) ... 20.40/9.14 [2019-03-28 12:46:02,987 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 20.40/9.14 [2019-03-28 12:46:03,008 INFO L133 ementStrategyFactory]: Using default assertion order modulation 20.40/9.14 [2019-03-28 12:46:03,009 INFO L374 BuchiCegarLoop]: Interprodecural is true 20.40/9.14 [2019-03-28 12:46:03,009 INFO L375 BuchiCegarLoop]: Hoare is true 20.40/9.14 [2019-03-28 12:46:03,009 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 20.40/9.14 [2019-03-28 12:46:03,009 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 20.40/9.14 [2019-03-28 12:46:03,009 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 20.40/9.14 [2019-03-28 12:46:03,009 INFO L379 BuchiCegarLoop]: Difference is false 20.40/9.14 [2019-03-28 12:46:03,009 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 20.40/9.14 [2019-03-28 12:46:03,010 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 20.40/9.14 [2019-03-28 12:46:03,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. 20.40/9.14 [2019-03-28 12:46:03,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 20.40/9.14 [2019-03-28 12:46:03,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.40/9.14 [2019-03-28 12:46:03,021 INFO L119 BuchiIsEmpty]: Starting construction of run 20.40/9.14 [2019-03-28 12:46:03,025 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 20.40/9.14 [2019-03-28 12:46:03,025 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 20.40/9.14 [2019-03-28 12:46:03,026 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 20.40/9.14 [2019-03-28 12:46:03,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. 20.40/9.14 [2019-03-28 12:46:03,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 20.40/9.14 [2019-03-28 12:46:03,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.40/9.14 [2019-03-28 12:46:03,029 INFO L119 BuchiIsEmpty]: Starting construction of run 20.40/9.14 [2019-03-28 12:46:03,029 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 20.40/9.14 [2019-03-28 12:46:03,029 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 20.40/9.14 [2019-03-28 12:46:03,034 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue [105] 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] 10#L-1true [151] L-1-->L17-1: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 19#L17-1true 20.40/9.14 [2019-03-28 12:46:03,035 INFO L796 eck$LassoCheckResult]: Loop: 19#L17-1true [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 16#L5-1true [156] L5-1-->L6: Formula: (< |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 21#L6true [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 17#L6-1true [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 40#L6-2true [123] L6-2-->L6-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 30#L6-6true [107] L6-6-->L17: Formula: (not |v_ULTIMATE.start_main_#t~short4_9|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 22#L17true [97] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_22 0)) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_21| v_ULTIMATE.start_main_~x~0.base_31)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} AuxVars[] AssignedVars[#memory_int] 19#L17-1true 20.40/9.14 [2019-03-28 12:46:03,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:03,036 INFO L82 PathProgramCache]: Analyzing trace with hash 4367, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:03,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:03,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:03,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:03,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:03,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1164205675, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:03,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:03,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:03,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.40/9.14 [2019-03-28 12:46:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.40/9.14 [2019-03-28 12:46:03,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.40/9.14 [2019-03-28 12:46:03,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 20.40/9.14 [2019-03-28 12:46:03,085 INFO L811 eck$LassoCheckResult]: loop already infeasible 20.40/9.14 [2019-03-28 12:46:03,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 20.40/9.14 [2019-03-28 12:46:03,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 20.40/9.14 [2019-03-28 12:46:03,087 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. 20.40/9.14 [2019-03-28 12:46:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.40/9.14 [2019-03-28 12:46:03,203 INFO L93 Difference]: Finished difference Result 41 states and 69 transitions. 20.40/9.14 [2019-03-28 12:46:03,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 20.40/9.14 [2019-03-28 12:46:03,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 69 transitions. 20.40/9.14 [2019-03-28 12:46:03,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 20.40/9.14 [2019-03-28 12:46:03,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 21 states and 29 transitions. 20.40/9.14 [2019-03-28 12:46:03,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 20.40/9.14 [2019-03-28 12:46:03,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 20.40/9.14 [2019-03-28 12:46:03,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. 20.40/9.14 [2019-03-28 12:46:03,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 20.40/9.14 [2019-03-28 12:46:03,213 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. 20.40/9.14 [2019-03-28 12:46:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. 20.40/9.14 [2019-03-28 12:46:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 20.40/9.14 [2019-03-28 12:46:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 20.40/9.14 [2019-03-28 12:46:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. 20.40/9.14 [2019-03-28 12:46:03,216 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. 20.40/9.14 [2019-03-28 12:46:03,216 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. 20.40/9.14 [2019-03-28 12:46:03,217 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 20.40/9.14 [2019-03-28 12:46:03,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. 20.40/9.14 [2019-03-28 12:46:03,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 20.40/9.14 [2019-03-28 12:46:03,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.40/9.14 [2019-03-28 12:46:03,218 INFO L119 BuchiIsEmpty]: Starting construction of run 20.40/9.14 [2019-03-28 12:46:03,218 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 20.40/9.14 [2019-03-28 12:46:03,219 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 20.40/9.14 [2019-03-28 12:46:03,219 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY [105] 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] 103#L-1 [151] L-1-->L17-1: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 92#L17-1 20.40/9.14 [2019-03-28 12:46:03,220 INFO L796 eck$LassoCheckResult]: Loop: 92#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 93#L5-1 [156] L5-1-->L6: Formula: (< |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 97#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 89#L6-1 [163] L6-1-->L6-2: Formula: (and (> 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) (not |v_ULTIMATE.start_main_#t~short4_2|)) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 91#L6-2 [123] L6-2-->L6-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 108#L6-6 [107] L6-6-->L17: Formula: (not |v_ULTIMATE.start_main_#t~short4_9|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 98#L17 [97] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_22 0)) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_21| v_ULTIMATE.start_main_~x~0.base_31)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} AuxVars[] AssignedVars[#memory_int] 92#L17-1 20.40/9.14 [2019-03-28 12:46:03,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 4367, now seen corresponding path program 2 times 20.40/9.14 [2019-03-28 12:46:03,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:03,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:03,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:03,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1164235466, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:03,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:03,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:03,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:03,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash -407890436, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:03,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:03,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:03,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:03,412 INFO L216 LassoAnalysis]: Preferences: 20.40/9.14 [2019-03-28 12:46:03,414 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.40/9.14 [2019-03-28 12:46:03,414 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.40/9.14 [2019-03-28 12:46:03,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.40/9.14 [2019-03-28 12:46:03,414 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.40/9.14 [2019-03-28 12:46:03,415 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.40/9.14 [2019-03-28 12:46:03,415 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.40/9.14 [2019-03-28 12:46:03,415 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.40/9.14 [2019-03-28 12:46:03,415 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 20.40/9.14 [2019-03-28 12:46:03,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.40/9.14 [2019-03-28 12:46:03,416 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.40/9.14 [2019-03-28 12:46:03,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:03,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:03,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:03,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:03,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:03,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:03,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:03,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:03,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:03,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:03,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:03,754 INFO L300 LassoAnalysis]: Preprocessing complete. 20.40/9.14 [2019-03-28 12:46:03,760 INFO L497 LassoAnalysis]: Using template 'affine'. 20.40/9.14 [2019-03-28 12:46:03,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:03,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:03,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.40/9.14 [2019-03-28 12:46:03,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:03,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:03,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:03,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:03,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:03,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:03,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:03,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:03,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:03,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:03,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:03,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:03,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:03,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:03,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:03,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:03,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.40/9.14 [2019-03-28 12:46:03,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:03,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:03,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:03,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:03,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:03,807 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.40/9.14 [2019-03-28 12:46:03,813 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.40/9.14 [2019-03-28 12:46:03,814 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 20.40/9.14 [2019-03-28 12:46:03,816 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.40/9.14 [2019-03-28 12:46:03,816 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.40/9.14 [2019-03-28 12:46:03,816 INFO L518 LassoAnalysis]: Proved termination. 20.40/9.14 [2019-03-28 12:46:03,817 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.40/9.14 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 20.40/9.14 Supporting invariants [] 20.40/9.14 [2019-03-28 12:46:03,827 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 20.40/9.14 [2019-03-28 12:46:03,830 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.40/9.14 [2019-03-28 12:46:03,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.40/9.14 [2019-03-28 12:46:03,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core 20.40/9.14 [2019-03-28 12:46:03,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.40/9.14 [2019-03-28 12:46:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.40/9.14 [2019-03-28 12:46:03,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core 20.40/9.14 [2019-03-28 12:46:03,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.40/9.14 [2019-03-28 12:46:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.40/9.14 [2019-03-28 12:46:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.40/9.14 [2019-03-28 12:46:03,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core 20.40/9.14 [2019-03-28 12:46:03,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.40/9.14 [2019-03-28 12:46:03,996 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 20.40/9.14 [2019-03-28 12:46:03,997 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 20.40/9.14 [2019-03-28 12:46:04,002 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 20.40/9.14 [2019-03-28 12:46:04,002 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 20.40/9.14 [2019-03-28 12:46:04,003 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 20.40/9.14 [2019-03-28 12:46:04,039 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 6 predicates after loop cannibalization 20.40/9.14 [2019-03-28 12:46:04,042 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 6 loop predicates 20.40/9.14 [2019-03-28 12:46:04,043 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 29 transitions. cyclomatic complexity: 9 Second operand 5 states. 20.40/9.14 [2019-03-28 12:46:04,484 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 29 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 178 states and 225 transitions. Complement of second has 26 states. 20.40/9.14 [2019-03-28 12:46:04,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 11 non-accepting loop states 2 accepting loop states 20.40/9.14 [2019-03-28 12:46:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 20.40/9.14 [2019-03-28 12:46:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. 20.40/9.14 [2019-03-28 12:46:04,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 131 transitions. Stem has 2 letters. Loop has 7 letters. 20.40/9.14 [2019-03-28 12:46:04,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.40/9.14 [2019-03-28 12:46:04,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 131 transitions. Stem has 9 letters. Loop has 7 letters. 20.40/9.14 [2019-03-28 12:46:04,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.40/9.14 [2019-03-28 12:46:04,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 131 transitions. Stem has 2 letters. Loop has 14 letters. 20.40/9.14 [2019-03-28 12:46:04,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.40/9.14 [2019-03-28 12:46:04,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 178 states and 225 transitions. 20.40/9.14 [2019-03-28 12:46:04,505 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 20.40/9.14 [2019-03-28 12:46:04,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 178 states to 118 states and 151 transitions. 20.40/9.14 [2019-03-28 12:46:04,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 20.40/9.14 [2019-03-28 12:46:04,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 20.40/9.14 [2019-03-28 12:46:04,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 151 transitions. 20.40/9.14 [2019-03-28 12:46:04,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.40/9.14 [2019-03-28 12:46:04,508 INFO L706 BuchiCegarLoop]: Abstraction has 118 states and 151 transitions. 20.40/9.14 [2019-03-28 12:46:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 151 transitions. 20.40/9.14 [2019-03-28 12:46:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 83. 20.40/9.14 [2019-03-28 12:46:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. 20.40/9.14 [2019-03-28 12:46:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. 20.40/9.14 [2019-03-28 12:46:04,515 INFO L729 BuchiCegarLoop]: Abstraction has 83 states and 110 transitions. 20.40/9.14 [2019-03-28 12:46:04,516 INFO L609 BuchiCegarLoop]: Abstraction has 83 states and 110 transitions. 20.40/9.14 [2019-03-28 12:46:04,516 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 20.40/9.14 [2019-03-28 12:46:04,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 110 transitions. 20.40/9.14 [2019-03-28 12:46:04,518 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 20.40/9.14 [2019-03-28 12:46:04,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.40/9.14 [2019-03-28 12:46:04,518 INFO L119 BuchiIsEmpty]: Starting construction of run 20.40/9.14 [2019-03-28 12:46:04,518 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 20.40/9.14 [2019-03-28 12:46:04,518 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 20.40/9.14 [2019-03-28 12:46:04,519 INFO L794 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY [105] 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] 442#L-1 [150] L-1-->L17-1: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 417#L17-1 20.40/9.14 [2019-03-28 12:46:04,519 INFO L796 eck$LassoCheckResult]: Loop: 417#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 418#L5-1 [156] L5-1-->L6: Formula: (< |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 492#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 490#L6-1 [163] L6-1-->L6-2: Formula: (and (> 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) (not |v_ULTIMATE.start_main_#t~short4_2|)) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 488#L6-2 [123] L6-2-->L6-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 486#L6-6 [107] L6-6-->L17: Formula: (not |v_ULTIMATE.start_main_#t~short4_9|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 485#L17 [97] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_22 0)) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_21| v_ULTIMATE.start_main_~x~0.base_31)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} AuxVars[] AssignedVars[#memory_int] 417#L17-1 20.40/9.14 [2019-03-28 12:46:04,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:04,520 INFO L82 PathProgramCache]: Analyzing trace with hash 4366, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:04,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:04,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:04,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:04,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:04,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:04,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1164235466, now seen corresponding path program 2 times 20.40/9.14 [2019-03-28 12:46:04,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:04,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:04,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:04,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:04,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:04,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:04,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2144266525, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:04,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:04,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:04,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:04,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:04,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:04,657 INFO L216 LassoAnalysis]: Preferences: 20.40/9.14 [2019-03-28 12:46:04,657 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 20.40/9.14 [2019-03-28 12:46:04,657 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 20.40/9.14 [2019-03-28 12:46:04,657 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 20.40/9.14 [2019-03-28 12:46:04,657 INFO L127 ssoRankerPreferences]: Use exernal solver: false 20.40/9.14 [2019-03-28 12:46:04,657 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 20.40/9.14 [2019-03-28 12:46:04,657 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 20.40/9.14 [2019-03-28 12:46:04,658 INFO L130 ssoRankerPreferences]: Path of dumped script: 20.40/9.14 [2019-03-28 12:46:04,658 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 20.40/9.14 [2019-03-28 12:46:04,658 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 20.40/9.14 [2019-03-28 12:46:04,658 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 20.40/9.14 [2019-03-28 12:46:04,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:04,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:04,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:04,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:04,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:04,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:04,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:04,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:04,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:04,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:04,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 20.40/9.14 [2019-03-28 12:46:04,859 INFO L300 LassoAnalysis]: Preprocessing complete. 20.40/9.14 [2019-03-28 12:46:04,859 INFO L497 LassoAnalysis]: Using template 'affine'. 20.40/9.14 [2019-03-28 12:46:04,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:04,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:04,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.40/9.14 [2019-03-28 12:46:04,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:04,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:04,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:04,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:04,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:04,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:04,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:04,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:04,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.40/9.14 [2019-03-28 12:46:04,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:04,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:04,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:04,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:04,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:04,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:04,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:04,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:04,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.40/9.14 [2019-03-28 12:46:04,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:04,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:04,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:04,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:04,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:04,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:04,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:04,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:04,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.40/9.14 [2019-03-28 12:46:04,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:04,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:04,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:04,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:04,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:04,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:04,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:04,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:04,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:04,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:04,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:04,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:04,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:04,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:04,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:04,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:04,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.40/9.14 [2019-03-28 12:46:04,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:04,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:04,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:04,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:04,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:04,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:04,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:04,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:04,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.40/9.14 [2019-03-28 12:46:04,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:04,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:04,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:04,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:04,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:04,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:04,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:04,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:04,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.40/9.14 [2019-03-28 12:46:04,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:04,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:04,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:04,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:04,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:04,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:04,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:04,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:04,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.40/9.14 [2019-03-28 12:46:04,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:04,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:04,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:04,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:04,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:04,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:04,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:04,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:04,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:04,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:04,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:04,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:04,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:04,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:04,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:04,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:04,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:04,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:04,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:04,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:04,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:04,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:04,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:04,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:04,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:04,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:04,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:04,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:04,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:04,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 20.40/9.14 [2019-03-28 12:46:04,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 20.40/9.14 Termination analysis: LINEAR_WITH_GUESSES 20.40/9.14 Number of strict supporting invariants: 0 20.40/9.14 Number of non-strict supporting invariants: 1 20.40/9.14 Consider only non-deceasing supporting invariants: true 20.40/9.14 Simplify termination arguments: true 20.40/9.14 Simplify supporting invariants: trueOverapproximate stem: false 20.40/9.14 [2019-03-28 12:46:04,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. 20.40/9.14 [2019-03-28 12:46:04,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 20.40/9.14 [2019-03-28 12:46:04,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 20.40/9.14 [2019-03-28 12:46:04,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 20.40/9.14 [2019-03-28 12:46:04,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 20.40/9.14 [2019-03-28 12:46:04,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 20.40/9.14 [2019-03-28 12:46:04,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 20.40/9.14 [2019-03-28 12:46:04,931 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 20.40/9.14 [2019-03-28 12:46:04,933 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 20.40/9.14 [2019-03-28 12:46:04,933 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. 20.40/9.14 [2019-03-28 12:46:04,934 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 20.40/9.14 [2019-03-28 12:46:04,934 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 20.40/9.14 [2019-03-28 12:46:04,934 INFO L518 LassoAnalysis]: Proved termination. 20.40/9.14 [2019-03-28 12:46:04,934 INFO L520 LassoAnalysis]: Termination argument consisting of: 20.40/9.14 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 20.40/9.14 Supporting invariants [] 20.40/9.14 [2019-03-28 12:46:04,942 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 20.40/9.14 [2019-03-28 12:46:04,943 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 20.40/9.14 [2019-03-28 12:46:04,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.40/9.14 [2019-03-28 12:46:04,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core 20.40/9.14 [2019-03-28 12:46:04,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.40/9.14 [2019-03-28 12:46:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.40/9.14 [2019-03-28 12:46:04,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core 20.40/9.14 [2019-03-28 12:46:04,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.40/9.14 [2019-03-28 12:46:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.40/9.14 [2019-03-28 12:46:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.40/9.14 [2019-03-28 12:46:05,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core 20.40/9.14 [2019-03-28 12:46:05,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... 20.40/9.14 [2019-03-28 12:46:05,057 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 20.40/9.14 [2019-03-28 12:46:05,058 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 20.40/9.14 [2019-03-28 12:46:05,060 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 20.40/9.14 [2019-03-28 12:46:05,060 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 20.40/9.14 [2019-03-28 12:46:05,061 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 20.40/9.14 [2019-03-28 12:46:05,096 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 6 predicates after loop cannibalization 20.40/9.14 [2019-03-28 12:46:05,097 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 6 loop predicates 20.40/9.14 [2019-03-28 12:46:05,097 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 83 states and 110 transitions. cyclomatic complexity: 31 Second operand 5 states. 20.40/9.14 [2019-03-28 12:46:05,453 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 83 states and 110 transitions. cyclomatic complexity: 31. Second operand 5 states. Result 240 states and 306 transitions. Complement of second has 26 states. 20.40/9.14 [2019-03-28 12:46:05,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 11 non-accepting loop states 2 accepting loop states 20.40/9.14 [2019-03-28 12:46:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 20.40/9.14 [2019-03-28 12:46:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. 20.40/9.14 [2019-03-28 12:46:05,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 131 transitions. Stem has 2 letters. Loop has 7 letters. 20.40/9.14 [2019-03-28 12:46:05,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.40/9.14 [2019-03-28 12:46:05,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 131 transitions. Stem has 9 letters. Loop has 7 letters. 20.40/9.14 [2019-03-28 12:46:05,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.40/9.14 [2019-03-28 12:46:05,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 131 transitions. Stem has 2 letters. Loop has 14 letters. 20.40/9.14 [2019-03-28 12:46:05,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. 20.40/9.14 [2019-03-28 12:46:05,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 240 states and 306 transitions. 20.40/9.14 [2019-03-28 12:46:05,467 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 20.40/9.14 [2019-03-28 12:46:05,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 240 states to 180 states and 232 transitions. 20.40/9.14 [2019-03-28 12:46:05,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 20.40/9.14 [2019-03-28 12:46:05,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 20.40/9.14 [2019-03-28 12:46:05,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 232 transitions. 20.40/9.14 [2019-03-28 12:46:05,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.40/9.14 [2019-03-28 12:46:05,471 INFO L706 BuchiCegarLoop]: Abstraction has 180 states and 232 transitions. 20.40/9.14 [2019-03-28 12:46:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 232 transitions. 20.40/9.14 [2019-03-28 12:46:05,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 83. 20.40/9.14 [2019-03-28 12:46:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. 20.40/9.14 [2019-03-28 12:46:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. 20.40/9.14 [2019-03-28 12:46:05,478 INFO L729 BuchiCegarLoop]: Abstraction has 83 states and 110 transitions. 20.40/9.14 [2019-03-28 12:46:05,478 INFO L609 BuchiCegarLoop]: Abstraction has 83 states and 110 transitions. 20.40/9.14 [2019-03-28 12:46:05,478 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 20.40/9.14 [2019-03-28 12:46:05,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 110 transitions. 20.40/9.14 [2019-03-28 12:46:05,479 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 20.40/9.14 [2019-03-28 12:46:05,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.40/9.14 [2019-03-28 12:46:05,479 INFO L119 BuchiIsEmpty]: Starting construction of run 20.40/9.14 [2019-03-28 12:46:05,480 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 20.40/9.14 [2019-03-28 12:46:05,480 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 20.40/9.14 [2019-03-28 12:46:05,480 INFO L794 eck$LassoCheckResult]: Stem: 892#ULTIMATE.startENTRY [105] 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] 888#L-1 [151] L-1-->L17-1: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 889#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 929#L5-1 [157] L5-1-->L6: Formula: (> |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 934#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 933#L6-1 [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 862#L6-2 20.40/9.14 [2019-03-28 12:46:05,481 INFO L796 eck$LassoCheckResult]: Loop: 862#L6-2 [122] L6-2-->L6-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 900#L6-3 [119] L6-3-->L6-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~x~0.base_10)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_7| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 895#L6-4 [169] L6-4-->L6-6: Formula: (and (> |v_ULTIMATE.start_main_#t~mem3_3| 35) (not |v_ULTIMATE.start_main_#t~short4_4|)) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 897#L6-6 [107] L6-6-->L17: Formula: (not |v_ULTIMATE.start_main_#t~short4_9|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 875#L17 [97] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= (store |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_14| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_22 0)) |v_#memory_int_13|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_21| v_ULTIMATE.start_main_~x~0.base_31)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_21|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, #valid=|v_#valid_23|} AuxVars[] AssignedVars[#memory_int] 865#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 866#L5-1 [157] L5-1-->L6: Formula: (> |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 869#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 861#L6-1 [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 862#L6-2 20.40/9.14 [2019-03-28 12:46:05,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash -259086155, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:05,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:05,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:05,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:05,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:05,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1901561177, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:05,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:05,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:05,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.40/9.14 [2019-03-28 12:46:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.40/9.14 [2019-03-28 12:46:05,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.40/9.14 [2019-03-28 12:46:05,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 20.40/9.14 [2019-03-28 12:46:05,519 INFO L811 eck$LassoCheckResult]: loop already infeasible 20.40/9.14 [2019-03-28 12:46:05,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 20.40/9.14 [2019-03-28 12:46:05,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 20.40/9.14 [2019-03-28 12:46:05,519 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. cyclomatic complexity: 31 Second operand 4 states. 20.40/9.14 [2019-03-28 12:46:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.40/9.14 [2019-03-28 12:46:05,568 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. 20.40/9.14 [2019-03-28 12:46:05,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 20.40/9.14 [2019-03-28 12:46:05,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 79 transitions. 20.40/9.14 [2019-03-28 12:46:05,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 20.40/9.14 [2019-03-28 12:46:05,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 69 transitions. 20.40/9.14 [2019-03-28 12:46:05,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 20.40/9.14 [2019-03-28 12:46:05,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 20.40/9.14 [2019-03-28 12:46:05,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 69 transitions. 20.40/9.14 [2019-03-28 12:46:05,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.40/9.14 [2019-03-28 12:46:05,576 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 69 transitions. 20.40/9.14 [2019-03-28 12:46:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 69 transitions. 20.40/9.14 [2019-03-28 12:46:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. 20.40/9.14 [2019-03-28 12:46:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. 20.40/9.14 [2019-03-28 12:46:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. 20.40/9.14 [2019-03-28 12:46:05,579 INFO L729 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. 20.40/9.14 [2019-03-28 12:46:05,579 INFO L609 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. 20.40/9.14 [2019-03-28 12:46:05,579 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 20.40/9.14 [2019-03-28 12:46:05,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. 20.40/9.14 [2019-03-28 12:46:05,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 20.40/9.14 [2019-03-28 12:46:05,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.40/9.14 [2019-03-28 12:46:05,580 INFO L119 BuchiIsEmpty]: Starting construction of run 20.40/9.14 [2019-03-28 12:46:05,581 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 20.40/9.14 [2019-03-28 12:46:05,581 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.40/9.14 [2019-03-28 12:46:05,581 INFO L794 eck$LassoCheckResult]: Stem: 1040#ULTIMATE.startENTRY [105] 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] 1038#L-1 [151] L-1-->L17-1: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 1039#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1023#L5-1 [157] L5-1-->L6: Formula: (> |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1050#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1058#L6-1 [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1015#L6-2 20.40/9.14 [2019-03-28 12:46:05,582 INFO L796 eck$LassoCheckResult]: Loop: 1015#L6-2 [122] L6-2-->L6-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1048#L6-3 [119] L6-3-->L6-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~x~0.base_10)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_7| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1045#L6-4 [168] L6-4-->L6-6: Formula: (and (<= |v_ULTIMATE.start_main_#t~mem3_3| 35) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1046#L6-6 [106] L6-6-->L7: Formula: |v_ULTIMATE.start_main_#t~short4_7| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_7|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_4|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1054#L7 [77] L7-->L7-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10)) (= (select |v_#valid_11| v_ULTIMATE.start_main_~x~0.base_13) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_9| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_11|} OutVars{#valid=|v_#valid_11|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1052#L7-1 [75] L7-1-->L8: Formula: (< |v_ULTIMATE.start_main_#t~mem5_4| 0) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1033#L8 [100] L8-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_16)) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 (- 5)))) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_16) 1)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_13|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#memory_int] 1019#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1020#L5-1 [156] L5-1-->L6: Formula: (< |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1024#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1014#L6-1 [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1015#L6-2 20.40/9.14 [2019-03-28 12:46:05,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:05,582 INFO L82 PathProgramCache]: Analyzing trace with hash -259086155, now seen corresponding path program 2 times 20.40/9.14 [2019-03-28 12:46:05,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:05,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:05,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:05,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1239417515, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:05,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:05,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:05,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:05,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:05,609 INFO L82 PathProgramCache]: Analyzing trace with hash 302031223, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:05,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:05,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:05,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 20.40/9.14 [2019-03-28 12:46:05,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 20.40/9.14 [2019-03-28 12:46:05,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 20.40/9.14 [2019-03-28 12:46:05,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 20.40/9.14 [2019-03-28 12:46:05,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 20.40/9.14 [2019-03-28 12:46:05,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 20.40/9.14 [2019-03-28 12:46:05,731 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. cyclomatic complexity: 19 Second operand 5 states. 20.40/9.14 [2019-03-28 12:46:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 20.40/9.14 [2019-03-28 12:46:05,848 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. 20.40/9.14 [2019-03-28 12:46:05,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 20.40/9.14 [2019-03-28 12:46:05,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 112 transitions. 20.40/9.14 [2019-03-28 12:46:05,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 20.40/9.14 [2019-03-28 12:46:05,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 112 transitions. 20.40/9.14 [2019-03-28 12:46:05,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 20.40/9.14 [2019-03-28 12:46:05,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 20.40/9.14 [2019-03-28 12:46:05,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 112 transitions. 20.40/9.14 [2019-03-28 12:46:05,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 20.40/9.14 [2019-03-28 12:46:05,856 INFO L706 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. 20.40/9.14 [2019-03-28 12:46:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 112 transitions. 20.40/9.14 [2019-03-28 12:46:05,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. 20.40/9.14 [2019-03-28 12:46:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. 20.40/9.14 [2019-03-28 12:46:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. 20.40/9.14 [2019-03-28 12:46:05,861 INFO L729 BuchiCegarLoop]: Abstraction has 69 states and 93 transitions. 20.40/9.14 [2019-03-28 12:46:05,862 INFO L609 BuchiCegarLoop]: Abstraction has 69 states and 93 transitions. 20.40/9.14 [2019-03-28 12:46:05,862 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 20.40/9.14 [2019-03-28 12:46:05,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 93 transitions. 20.40/9.14 [2019-03-28 12:46:05,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 20.40/9.14 [2019-03-28 12:46:05,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 20.40/9.14 [2019-03-28 12:46:05,863 INFO L119 BuchiIsEmpty]: Starting construction of run 20.40/9.14 [2019-03-28 12:46:05,863 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 20.40/9.14 [2019-03-28 12:46:05,863 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 20.40/9.14 [2019-03-28 12:46:05,864 INFO L794 eck$LassoCheckResult]: Stem: 1187#ULTIMATE.startENTRY [105] 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] 1185#L-1 [151] L-1-->L17-1: Formula: (and (< |v_ULTIMATE.start_main_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_1|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem1, #length, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 1186#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1217#L5-1 [156] L5-1-->L6: Formula: (< |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1216#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1214#L6-1 [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1210#L6-2 20.40/9.14 [2019-03-28 12:46:05,864 INFO L796 eck$LassoCheckResult]: Loop: 1210#L6-2 [122] L6-2-->L6-3: Formula: |v_ULTIMATE.start_main_#t~short4_3| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_3|} AuxVars[] AssignedVars[] 1207#L6-3 [119] L6-3-->L6-4: Formula: (and (= |v_ULTIMATE.start_main_#t~mem3_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_main_~x~0.base_10)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_7| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_9|} OutVars{#valid=|v_#valid_9|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1205#L6-4 [168] L6-4-->L6-6: Formula: (and (<= |v_ULTIMATE.start_main_#t~mem3_3| 35) |v_ULTIMATE.start_main_#t~short4_4|) InVars {ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_4|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1203#L6-6 [106] L6-6-->L7: Formula: |v_ULTIMATE.start_main_#t~short4_7| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_7|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_4|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_6|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 1201#L7 [77] L7-->L7-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10)) (= (select |v_#valid_11| v_ULTIMATE.start_main_~x~0.base_13) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_9| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, #valid=|v_#valid_11|} OutVars{#valid=|v_#valid_11|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1199#L7-1 [75] L7-1-->L8: Formula: (< |v_ULTIMATE.start_main_#t~mem5_4| 0) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_4|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 1177#L8 [100] L8-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_11| v_ULTIMATE.start_main_~x~0.base_16)) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_16 (store (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12 (- 5)))) (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select |v_#valid_13| v_ULTIMATE.start_main_~x~0.base_16) 1)) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_13|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #length=|v_#length_11|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#memory_int] 1178#L17-1 [91] L17-1-->L5-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_3| v_ULTIMATE.start_main_~x~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem1_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4)) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_2|, #length=|v_#length_3|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1215#L5-1 [156] L5-1-->L6: Formula: (< |v_ULTIMATE.start_main_#t~mem1_6| 0) InVars {ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_6|} OutVars{ULTIMATE.start_main_#t~mem1=|v_ULTIMATE.start_main_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem1] 1213#L6 [94] L6-->L6-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_5| v_ULTIMATE.start_main_~x~0.base_7)) (= (select (select |v_#memory_int_2| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6) |v_ULTIMATE.start_main_#t~mem2_2|) (= (select |v_#valid_7| v_ULTIMATE.start_main_~x~0.base_7) 1) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 1209#L6-1 [162] L6-1-->L6-2: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem2_3| 5)) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 1210#L6-2 20.40/9.14 [2019-03-28 12:46:05,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:05,865 INFO L82 PathProgramCache]: Analyzing trace with hash -259087116, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:05,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:05,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:05,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:05,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1239417515, now seen corresponding path program 2 times 20.40/9.14 [2019-03-28 12:46:05,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:05,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:05,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:05,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 20.40/9.14 [2019-03-28 12:46:05,890 INFO L82 PathProgramCache]: Analyzing trace with hash 807589848, now seen corresponding path program 1 times 20.40/9.14 [2019-03-28 12:46:05,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 20.40/9.14 [2019-03-28 12:46:05,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 20.40/9.14 [2019-03-28 12:46:05,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 20.40/9.14 [2019-03-28 12:46:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 20.40/9.14 [2019-03-28 12:46:06,085 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 20.40/9.14 [2019-03-28 12:46:06,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:06 BasicIcfg 20.40/9.14 [2019-03-28 12:46:06,156 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 20.40/9.14 [2019-03-28 12:46:06,157 INFO L168 Benchmark]: Toolchain (without parser) took 4668.15 ms. Allocated memory was 649.6 MB in the beginning and 750.3 MB in the end (delta: 100.7 MB). Free memory was 558.4 MB in the beginning and 373.8 MB in the end (delta: 184.6 MB). Peak memory consumption was 285.3 MB. Max. memory is 50.3 GB. 20.40/9.14 [2019-03-28 12:46:06,158 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.40/9.14 [2019-03-28 12:46:06,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.02 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 558.4 MB in the beginning and 641.1 MB in the end (delta: -82.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. 20.40/9.14 [2019-03-28 12:46:06,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.79 ms. Allocated memory is still 674.8 MB. Free memory was 641.1 MB in the beginning and 638.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 20.40/9.14 [2019-03-28 12:46:06,160 INFO L168 Benchmark]: Boogie Preprocessor took 25.73 ms. Allocated memory is still 674.8 MB. Free memory was 638.0 MB in the beginning and 636.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 20.40/9.14 [2019-03-28 12:46:06,160 INFO L168 Benchmark]: RCFGBuilder took 329.68 ms. Allocated memory is still 674.8 MB. Free memory was 636.6 MB in the beginning and 614.2 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. 20.40/9.14 [2019-03-28 12:46:06,161 INFO L168 Benchmark]: BlockEncodingV2 took 117.94 ms. Allocated memory is still 674.8 MB. Free memory was 614.2 MB in the beginning and 604.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 20.40/9.14 [2019-03-28 12:46:06,161 INFO L168 Benchmark]: TraceAbstraction took 664.31 ms. Allocated memory is still 674.8 MB. Free memory was 604.8 MB in the beginning and 548.3 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 50.3 GB. 20.40/9.14 [2019-03-28 12:46:06,162 INFO L168 Benchmark]: BuchiAutomizer took 3177.98 ms. Allocated memory was 674.8 MB in the beginning and 750.3 MB in the end (delta: 75.5 MB). Free memory was 547.0 MB in the beginning and 373.8 MB in the end (delta: 173.2 MB). Peak memory consumption was 248.7 MB. Max. memory is 50.3 GB. 20.40/9.14 [2019-03-28 12:46:06,166 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 20.40/9.14 --- Results --- 20.40/9.14 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 20.40/9.14 - StatisticsResult: Initial Icfg 20.40/9.14 44 locations, 49 edges 20.40/9.14 - StatisticsResult: Encoded RCFG 20.40/9.14 39 locations, 67 edges 20.40/9.14 * Results from de.uni_freiburg.informatik.ultimate.core: 20.40/9.14 - StatisticsResult: Toolchain Benchmarks 20.40/9.14 Benchmark results are: 20.40/9.14 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.1 MB. There was no memory consumed. Max. memory is 50.3 GB. 20.40/9.14 * CACSL2BoogieTranslator took 304.02 ms. Allocated memory was 649.6 MB in the beginning and 674.8 MB in the end (delta: 25.2 MB). Free memory was 558.4 MB in the beginning and 641.1 MB in the end (delta: -82.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. 20.40/9.14 * Boogie Procedure Inliner took 42.79 ms. Allocated memory is still 674.8 MB. Free memory was 641.1 MB in the beginning and 638.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 20.40/9.14 * Boogie Preprocessor took 25.73 ms. Allocated memory is still 674.8 MB. Free memory was 638.0 MB in the beginning and 636.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 20.40/9.14 * RCFGBuilder took 329.68 ms. Allocated memory is still 674.8 MB. Free memory was 636.6 MB in the beginning and 614.2 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 50.3 GB. 20.40/9.14 * BlockEncodingV2 took 117.94 ms. Allocated memory is still 674.8 MB. Free memory was 614.2 MB in the beginning and 604.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 20.40/9.14 * TraceAbstraction took 664.31 ms. Allocated memory is still 674.8 MB. Free memory was 604.8 MB in the beginning and 548.3 MB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 50.3 GB. 20.40/9.14 * BuchiAutomizer took 3177.98 ms. Allocated memory was 674.8 MB in the beginning and 750.3 MB in the end (delta: 75.5 MB). Free memory was 547.0 MB in the beginning and 373.8 MB in the end (delta: 173.2 MB). Peak memory consumption was 248.7 MB. Max. memory is 50.3 GB. 20.40/9.14 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 20.40/9.14 - GenericResult: Unfinished Backtranslation 20.40/9.14 unknown boogie variable #length 20.40/9.14 - GenericResult: Unfinished Backtranslation 20.40/9.14 unknown boogie variable #length 20.40/9.14 - GenericResult: Unfinished Backtranslation 20.40/9.14 unknown boogie variable #memory_int 20.40/9.14 - GenericResult: Unfinished Backtranslation 20.40/9.14 unknown boogie variable #memory_int 20.40/9.14 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 20.40/9.14 - PositiveResult [Line: 7]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 6]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 13]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 13]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 6]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 17]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 8]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 7]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 17]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 13]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 10]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 5]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 10]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 8]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 6]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 13]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 11]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 6]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 5]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - PositiveResult [Line: 11]: pointer dereference always succeeds 20.40/9.14 For all program executions holds that pointer dereference always succeeds at this location 20.40/9.14 - AllSpecificationsHoldResult: All specifications hold 20.40/9.14 20 specifications checked. All of them hold 20.40/9.14 - InvariantResult [Line: 5]: Loop Invariant 20.40/9.14 [2019-03-28 12:46:06,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.40/9.14 [2019-03-28 12:46:06,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 20.40/9.14 Derived loop invariant: (\valid[x] == 1 && x == 0) && 4 == unknown-#length-unknown[x] 20.40/9.14 - StatisticsResult: Ultimate Automizer benchmark data 20.40/9.14 CFG has 1 procedures, 39 locations, 20 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14 SDtfs, 68 SDslu, 1 SDs, 0 SdLazy, 61 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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=39occurred 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 20.40/9.14 - StatisticsResult: Constructed decomposition of program 20.40/9.14 Your program was decomposed into 5 terminating modules (3 trivial, 0 deterministic, 2 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 15 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 15 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 69 locations. 20.40/9.14 - StatisticsResult: Timing statistics 20.40/9.14 BüchiAutomizer plugin needed 3.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.5s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 154 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 240 SDslu, 333 SDs, 0 SdLazy, 694 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp92 ukn80 mio100 lsp41 div100 bol100 ite100 ukn100 eq179 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 20.40/9.14 - TerminationAnalysisResult: Nontermination possible 20.40/9.14 Buchi Automizer proved that your program is nonterminating for some inputs 20.40/9.14 - FixpointNonTerminationResult [Line: 6]: Nontermination argument in form of an infinite program execution. 20.40/9.14 Nontermination argument in form of an infinite execution 20.40/9.14 State at position 0 is 20.40/9.14 {NULL=0} 20.40/9.14 State at position 1 is 20.40/9.14 {org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@7f385355=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@37bc211b=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2912d7c3=0, NULL=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d7d0abf=-1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d7d0abf=0, NULL=0, x=-1, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@7ec0809f=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@16623266=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@65a0cc64=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2aa8b146=0} 20.40/9.14 - StatisticsResult: NonterminationArgumentStatistics 20.40/9.14 Fixpoint 20.40/9.14 - NonterminatingLassoResult [Line: 6]: Nonterminating execution 20.40/9.14 Found a nonterminating execution for the following lasso shaped sequence of statements. 20.40/9.14 Stem: 20.40/9.14 [L4] int* x = alloca(sizeof(int)); 20.40/9.14 [L5] EXPR \read(*x) 20.40/9.14 [L5] COND TRUE *x != 0 20.40/9.14 [L6] EXPR \read(*x) 20.40/9.14 [L6] -5 <= *x && *x <= 35 20.40/9.14 Loop: 20.40/9.14 [L6] -5 <= *x && *x <= 35 20.40/9.14 [L6] EXPR \read(*x) 20.40/9.14 [L6] -5 <= *x && *x <= 35 20.40/9.14 [L6] COND TRUE -5 <= *x && *x <= 35 20.40/9.14 [L7] EXPR \read(*x) 20.40/9.14 [L7] COND TRUE *x < 0 20.40/9.14 [L8] *x = -5 20.40/9.14 [L5] EXPR \read(*x) 20.40/9.14 [L5] COND TRUE *x != 0 20.40/9.14 [L6] EXPR \read(*x) 20.40/9.14 [L6] -5 <= *x && *x <= 35 20.40/9.14 End of lasso representation. 20.40/9.14 RESULT: Ultimate proved your program to be incorrect! 20.40/9.14 !SESSION 2019-03-28 12:45:58.211 ----------------------------------------------- 20.40/9.14 eclipse.buildId=unknown 20.40/9.14 java.version=1.8.0_181 20.40/9.14 java.vendor=Oracle Corporation 20.40/9.14 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 20.40/9.14 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 20.40/9.14 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 20.40/9.14 20.40/9.14 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:46:06.410 20.40/9.14 !MESSAGE The workspace will exit with unsaved changes in this session. 20.40/9.14 Received shutdown request... 20.40/9.14 Ultimate: 20.40/9.14 GTK+ Version Check 20.40/9.14 EOF