19.72/8.93 YES 19.72/8.93 19.72/8.93 Ultimate: Cannot open display: 19.72/8.93 This is Ultimate 0.1.24-8dc7c08-m 19.72/8.93 [2019-03-28 12:38:00,482 INFO L170 SettingsManager]: Resetting all preferences to default values... 19.72/8.93 [2019-03-28 12:38:00,484 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 19.72/8.93 [2019-03-28 12:38:00,496 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 19.72/8.93 [2019-03-28 12:38:00,496 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 19.72/8.93 [2019-03-28 12:38:00,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 19.72/8.93 [2019-03-28 12:38:00,499 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 19.72/8.93 [2019-03-28 12:38:00,500 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 19.72/8.93 [2019-03-28 12:38:00,502 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 19.72/8.93 [2019-03-28 12:38:00,503 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 19.72/8.93 [2019-03-28 12:38:00,504 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 19.72/8.93 [2019-03-28 12:38:00,504 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 19.72/8.93 [2019-03-28 12:38:00,505 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 19.72/8.93 [2019-03-28 12:38:00,506 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 19.72/8.93 [2019-03-28 12:38:00,507 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 19.72/8.93 [2019-03-28 12:38:00,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 19.72/8.93 [2019-03-28 12:38:00,508 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 19.72/8.93 [2019-03-28 12:38:00,510 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 19.72/8.93 [2019-03-28 12:38:00,512 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 19.72/8.93 [2019-03-28 12:38:00,513 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 19.72/8.93 [2019-03-28 12:38:00,514 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 19.72/8.93 [2019-03-28 12:38:00,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 19.72/8.93 [2019-03-28 12:38:00,517 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 19.72/8.93 [2019-03-28 12:38:00,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 19.72/8.93 [2019-03-28 12:38:00,518 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 19.72/8.93 [2019-03-28 12:38:00,519 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 19.72/8.93 [2019-03-28 12:38:00,519 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 19.72/8.93 [2019-03-28 12:38:00,520 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 19.72/8.93 [2019-03-28 12:38:00,520 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 19.72/8.93 [2019-03-28 12:38:00,521 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 19.72/8.93 [2019-03-28 12:38:00,522 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 19.72/8.93 [2019-03-28 12:38:00,523 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 19.72/8.93 [2019-03-28 12:38:00,524 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 19.72/8.93 [2019-03-28 12:38:00,524 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 19.72/8.93 [2019-03-28 12:38:00,524 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 19.72/8.93 [2019-03-28 12:38:00,525 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 19.72/8.93 [2019-03-28 12:38:00,525 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 19.72/8.93 [2019-03-28 12:38:00,526 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 19.72/8.93 [2019-03-28 12:38:00,526 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 19.72/8.93 [2019-03-28 12:38:00,527 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 19.72/8.93 [2019-03-28 12:38:00,541 INFO L110 SettingsManager]: Loading preferences was successful 19.72/8.93 [2019-03-28 12:38:00,541 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 19.72/8.93 [2019-03-28 12:38:00,542 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 19.72/8.93 [2019-03-28 12:38:00,543 INFO L133 SettingsManager]: * Rewrite not-equals=true 19.72/8.93 [2019-03-28 12:38:00,543 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 19.72/8.93 [2019-03-28 12:38:00,543 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 19.72/8.93 [2019-03-28 12:38:00,543 INFO L133 SettingsManager]: * Use SBE=true 19.72/8.93 [2019-03-28 12:38:00,543 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 19.72/8.93 [2019-03-28 12:38:00,544 INFO L133 SettingsManager]: * Use old map elimination=false 19.72/8.93 [2019-03-28 12:38:00,544 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 19.72/8.93 [2019-03-28 12:38:00,544 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 19.72/8.93 [2019-03-28 12:38:00,544 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 19.72/8.93 [2019-03-28 12:38:00,544 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 19.72/8.93 [2019-03-28 12:38:00,544 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 19.72/8.93 [2019-03-28 12:38:00,545 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 19.72/8.93 [2019-03-28 12:38:00,545 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 19.72/8.93 [2019-03-28 12:38:00,545 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 19.72/8.93 [2019-03-28 12:38:00,545 INFO L133 SettingsManager]: * Check division by zero=IGNORE 19.72/8.93 [2019-03-28 12:38:00,545 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 19.72/8.93 [2019-03-28 12:38:00,546 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 19.72/8.93 [2019-03-28 12:38:00,546 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 19.72/8.93 [2019-03-28 12:38:00,546 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 19.72/8.93 [2019-03-28 12:38:00,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 19.72/8.93 [2019-03-28 12:38:00,546 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 19.72/8.93 [2019-03-28 12:38:00,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.72/8.93 [2019-03-28 12:38:00,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 19.72/8.93 [2019-03-28 12:38:00,547 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 19.72/8.93 [2019-03-28 12:38:00,547 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 19.72/8.93 [2019-03-28 12:38:00,547 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 19.72/8.93 [2019-03-28 12:38:00,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 19.72/8.93 [2019-03-28 12:38:00,587 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 19.72/8.93 [2019-03-28 12:38:00,590 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 19.72/8.93 [2019-03-28 12:38:00,592 INFO L271 PluginConnector]: Initializing CDTParser... 19.72/8.93 [2019-03-28 12:38:00,592 INFO L276 PluginConnector]: CDTParser initialized 19.72/8.93 [2019-03-28 12:38:00,593 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 19.72/8.93 [2019-03-28 12:38:00,661 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/8804b1b4904b4958b1cd56212eadcbd5/FLAG03d05b8ae 19.72/8.93 [2019-03-28 12:38:00,999 INFO L307 CDTParser]: Found 1 translation units. 19.72/8.93 [2019-03-28 12:38:01,000 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 19.72/8.93 [2019-03-28 12:38:01,000 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 19.72/8.93 [2019-03-28 12:38:01,006 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/8804b1b4904b4958b1cd56212eadcbd5/FLAG03d05b8ae 19.72/8.93 [2019-03-28 12:38:01,414 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/8804b1b4904b4958b1cd56212eadcbd5 19.72/8.93 [2019-03-28 12:38:01,426 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 19.72/8.93 [2019-03-28 12:38:01,427 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 19.72/8.93 [2019-03-28 12:38:01,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 19.72/8.93 [2019-03-28 12:38:01,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 19.72/8.93 [2019-03-28 12:38:01,432 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 19.72/8.93 [2019-03-28 12:38:01,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:38:01" (1/1) ... 19.72/8.93 [2019-03-28 12:38:01,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@376b426b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01, skipping insertion in model container 19.72/8.93 [2019-03-28 12:38:01,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:38:01" (1/1) ... 19.72/8.93 [2019-03-28 12:38:01,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 19.72/8.93 [2019-03-28 12:38:01,460 INFO L176 MainTranslator]: Built tables and reachable declarations 19.72/8.93 [2019-03-28 12:38:01,625 INFO L206 PostProcessor]: Analyzing one entry point: main 19.72/8.93 [2019-03-28 12:38:01,637 INFO L191 MainTranslator]: Completed pre-run 19.72/8.93 [2019-03-28 12:38:01,717 INFO L206 PostProcessor]: Analyzing one entry point: main 19.72/8.93 [2019-03-28 12:38:01,734 INFO L195 MainTranslator]: Completed translation 19.72/8.93 [2019-03-28 12:38:01,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01 WrapperNode 19.72/8.93 [2019-03-28 12:38:01,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 19.72/8.93 [2019-03-28 12:38:01,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 19.72/8.93 [2019-03-28 12:38:01,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 19.72/8.93 [2019-03-28 12:38:01,736 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 19.72/8.93 [2019-03-28 12:38:01,746 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:38:01" (1/1) ... 19.72/8.93 [2019-03-28 12:38:01,755 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:38:01" (1/1) ... 19.72/8.93 [2019-03-28 12:38:01,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 19.72/8.93 [2019-03-28 12:38:01,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 19.72/8.93 [2019-03-28 12:38:01,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 19.72/8.93 [2019-03-28 12:38:01,780 INFO L276 PluginConnector]: Boogie Preprocessor initialized 19.72/8.93 [2019-03-28 12:38:01,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 19.72/8.93 [2019-03-28 12:38:01,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 19.72/8.93 [2019-03-28 12:38:01,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 19.72/8.93 [2019-03-28 12:38:01,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 19.72/8.93 [2019-03-28 12:38:01,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 19.72/8.93 [2019-03-28 12:38:01,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 19.72/8.93 [2019-03-28 12:38:01,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 19.72/8.93 [2019-03-28 12:38:01,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 19.72/8.93 [2019-03-28 12:38:01,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 19.72/8.93 [2019-03-28 12:38:01,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... 19.72/8.93 [2019-03-28 12:38:01,806 INFO L276 PluginConnector]: RCFGBuilder initialized 19.72/8.93 [2019-03-28 12:38:01,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (1/1) ... 19.72/8.93 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 19.72/8.93 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 19.72/8.93 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 19.72/8.93 [2019-03-28 12:38:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 19.72/8.93 [2019-03-28 12:38:01,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 19.72/8.93 [2019-03-28 12:38:01,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 19.72/8.93 [2019-03-28 12:38:01,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 19.72/8.93 [2019-03-28 12:38:01,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 19.72/8.93 [2019-03-28 12:38:01,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 19.72/8.93 [2019-03-28 12:38:02,172 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 19.72/8.93 [2019-03-28 12:38:02,173 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 19.72/8.93 [2019-03-28 12:38:02,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:02 BoogieIcfgContainer 19.72/8.93 [2019-03-28 12:38:02,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 19.72/8.93 [2019-03-28 12:38:02,175 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 19.72/8.93 [2019-03-28 12:38:02,175 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 19.72/8.93 [2019-03-28 12:38:02,177 INFO L276 PluginConnector]: BlockEncodingV2 initialized 19.72/8.93 [2019-03-28 12:38:02,178 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:02" (1/1) ... 19.72/8.93 [2019-03-28 12:38:02,195 INFO L313 BlockEncoder]: Initial Icfg 49 locations, 52 edges 19.72/8.93 [2019-03-28 12:38:02,197 INFO L258 BlockEncoder]: Using Remove infeasible edges 19.72/8.93 [2019-03-28 12:38:02,198 INFO L263 BlockEncoder]: Using Maximize final states 19.72/8.93 [2019-03-28 12:38:02,198 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 19.72/8.93 [2019-03-28 12:38:02,199 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 19.72/8.93 [2019-03-28 12:38:02,200 INFO L296 BlockEncoder]: Using Remove sink states 19.72/8.93 [2019-03-28 12:38:02,201 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 19.72/8.93 [2019-03-28 12:38:02,201 INFO L179 BlockEncoder]: Using Rewrite not-equals 19.72/8.93 [2019-03-28 12:38:02,231 INFO L185 BlockEncoder]: Using Use SBE 19.72/8.93 [2019-03-28 12:38:02,264 INFO L200 BlockEncoder]: SBE split 25 edges 19.72/8.93 [2019-03-28 12:38:02,270 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 19.72/8.93 [2019-03-28 12:38:02,272 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.72/8.93 [2019-03-28 12:38:02,298 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 19.72/8.93 [2019-03-28 12:38:02,301 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states 19.72/8.93 [2019-03-28 12:38:02,303 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 19.72/8.93 [2019-03-28 12:38:02,303 INFO L71 MaximizeFinalStates]: 0 new accepting states 19.72/8.93 [2019-03-28 12:38:02,304 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 19.72/8.93 [2019-03-28 12:38:02,305 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 19.72/8.93 [2019-03-28 12:38:02,305 INFO L313 BlockEncoder]: Encoded RCFG 41 locations, 68 edges 19.72/8.93 [2019-03-28 12:38:02,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:02 BasicIcfg 19.72/8.93 [2019-03-28 12:38:02,306 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 19.72/8.93 [2019-03-28 12:38:02,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 19.72/8.93 [2019-03-28 12:38:02,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... 19.72/8.93 [2019-03-28 12:38:02,310 INFO L276 PluginConnector]: TraceAbstraction initialized 19.72/8.93 [2019-03-28 12:38:02,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:38:01" (1/4) ... 19.72/8.93 [2019-03-28 12:38:02,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516d32aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:38:02, skipping insertion in model container 19.72/8.93 [2019-03-28 12:38:02,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (2/4) ... 19.72/8.93 [2019-03-28 12:38:02,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516d32aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:38:02, skipping insertion in model container 19.72/8.93 [2019-03-28 12:38:02,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:02" (3/4) ... 19.72/8.93 [2019-03-28 12:38:02,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516d32aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:02, skipping insertion in model container 19.72/8.93 [2019-03-28 12:38:02,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:02" (4/4) ... 19.72/8.93 [2019-03-28 12:38:02,315 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.72/8.93 [2019-03-28 12:38:02,325 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 19.72/8.93 [2019-03-28 12:38:02,333 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. 19.72/8.93 [2019-03-28 12:38:02,351 INFO L257 AbstractCegarLoop]: Starting to check reachability of 24 error locations. 19.72/8.93 [2019-03-28 12:38:02,380 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.72/8.93 [2019-03-28 12:38:02,381 INFO L382 AbstractCegarLoop]: Interprodecural is true 19.72/8.93 [2019-03-28 12:38:02,381 INFO L383 AbstractCegarLoop]: Hoare is true 19.72/8.93 [2019-03-28 12:38:02,381 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 19.72/8.93 [2019-03-28 12:38:02,381 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 19.72/8.93 [2019-03-28 12:38:02,382 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.72/8.93 [2019-03-28 12:38:02,382 INFO L387 AbstractCegarLoop]: Difference is false 19.72/8.93 [2019-03-28 12:38:02,382 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 19.72/8.93 [2019-03-28 12:38:02,382 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 19.72/8.93 [2019-03-28 12:38:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. 19.72/8.93 [2019-03-28 12:38:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 19.72/8.93 [2019-03-28 12:38:02,404 INFO L394 BasicCegarLoop]: Found error trace 19.72/8.93 [2019-03-28 12:38:02,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 19.72/8.93 [2019-03-28 12:38:02,405 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION]=== 19.72/8.93 [2019-03-28 12:38:02,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.72/8.93 [2019-03-28 12:38:02,410 INFO L82 PathProgramCache]: Analyzing trace with hash 115319, now seen corresponding path program 1 times 19.72/8.93 [2019-03-28 12:38:02,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.72/8.93 [2019-03-28 12:38:02,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.72/8.93 [2019-03-28 12:38:02,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:02,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:02,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.72/8.93 [2019-03-28 12:38:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.72/8.93 [2019-03-28 12:38:02,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.72/8.93 [2019-03-28 12:38:02,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.72/8.93 [2019-03-28 12:38:02,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.72/8.93 [2019-03-28 12:38:02,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.72/8.93 [2019-03-28 12:38:02,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.72/8.93 [2019-03-28 12:38:02,613 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. 19.72/8.93 [2019-03-28 12:38:02,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.72/8.93 [2019-03-28 12:38:02,768 INFO L93 Difference]: Finished difference Result 41 states and 68 transitions. 19.72/8.93 [2019-03-28 12:38:02,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.72/8.93 [2019-03-28 12:38:02,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 19.72/8.93 [2019-03-28 12:38:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.72/8.93 [2019-03-28 12:38:02,785 INFO L225 Difference]: With dead ends: 41 19.72/8.93 [2019-03-28 12:38:02,785 INFO L226 Difference]: Without dead ends: 36 19.72/8.93 [2019-03-28 12:38:02,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.72/8.93 [2019-03-28 12:38:02,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. 19.72/8.93 [2019-03-28 12:38:02,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. 19.72/8.93 [2019-03-28 12:38:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. 19.72/8.93 [2019-03-28 12:38:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. 19.72/8.93 [2019-03-28 12:38:02,830 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 3 19.72/8.93 [2019-03-28 12:38:02,831 INFO L84 Accepts]: Finished accepts. word is rejected. 19.72/8.93 [2019-03-28 12:38:02,832 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. 19.72/8.93 [2019-03-28 12:38:02,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.72/8.93 [2019-03-28 12:38:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. 19.72/8.93 [2019-03-28 12:38:02,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 19.72/8.93 [2019-03-28 12:38:02,832 INFO L394 BasicCegarLoop]: Found error trace 19.72/8.93 [2019-03-28 12:38:02,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 19.72/8.93 [2019-03-28 12:38:02,833 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION]=== 19.72/8.93 [2019-03-28 12:38:02,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.72/8.93 [2019-03-28 12:38:02,833 INFO L82 PathProgramCache]: Analyzing trace with hash 115321, now seen corresponding path program 1 times 19.72/8.93 [2019-03-28 12:38:02,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.72/8.93 [2019-03-28 12:38:02,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.72/8.93 [2019-03-28 12:38:02,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:02,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:02,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.72/8.93 [2019-03-28 12:38:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.72/8.93 [2019-03-28 12:38:02,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.72/8.93 [2019-03-28 12:38:02,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.72/8.93 [2019-03-28 12:38:02,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.72/8.93 [2019-03-28 12:38:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.72/8.93 [2019-03-28 12:38:02,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.72/8.93 [2019-03-28 12:38:02,872 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 3 states. 19.72/8.93 [2019-03-28 12:38:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.72/8.93 [2019-03-28 12:38:02,943 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. 19.72/8.93 [2019-03-28 12:38:02,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.72/8.93 [2019-03-28 12:38:02,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 19.72/8.93 [2019-03-28 12:38:02,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.72/8.93 [2019-03-28 12:38:02,967 INFO L225 Difference]: With dead ends: 41 19.72/8.93 [2019-03-28 12:38:02,967 INFO L226 Difference]: Without dead ends: 36 19.72/8.93 [2019-03-28 12:38:02,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.72/8.93 [2019-03-28 12:38:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. 19.72/8.93 [2019-03-28 12:38:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. 19.72/8.93 [2019-03-28 12:38:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. 19.72/8.93 [2019-03-28 12:38:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. 19.72/8.93 [2019-03-28 12:38:02,974 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 3 19.72/8.93 [2019-03-28 12:38:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. 19.72/8.93 [2019-03-28 12:38:02,974 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. 19.72/8.93 [2019-03-28 12:38:02,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.72/8.93 [2019-03-28 12:38:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. 19.72/8.93 [2019-03-28 12:38:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 19.72/8.93 [2019-03-28 12:38:02,975 INFO L394 BasicCegarLoop]: Found error trace 19.72/8.93 [2019-03-28 12:38:02,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 19.72/8.93 [2019-03-28 12:38:02,975 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION]=== 19.72/8.93 [2019-03-28 12:38:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.72/8.93 [2019-03-28 12:38:02,976 INFO L82 PathProgramCache]: Analyzing trace with hash 115322, now seen corresponding path program 1 times 19.72/8.93 [2019-03-28 12:38:02,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.72/8.93 [2019-03-28 12:38:02,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.72/8.93 [2019-03-28 12:38:02,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:02,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:02,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.72/8.93 [2019-03-28 12:38:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.72/8.93 [2019-03-28 12:38:03,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.72/8.93 [2019-03-28 12:38:03,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.72/8.93 [2019-03-28 12:38:03,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.72/8.93 [2019-03-28 12:38:03,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.72/8.93 [2019-03-28 12:38:03,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.72/8.93 [2019-03-28 12:38:03,011 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 3 states. 19.72/8.93 [2019-03-28 12:38:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.72/8.93 [2019-03-28 12:38:03,105 INFO L93 Difference]: Finished difference Result 36 states and 53 transitions. 19.72/8.93 [2019-03-28 12:38:03,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.72/8.93 [2019-03-28 12:38:03,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 19.72/8.93 [2019-03-28 12:38:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.72/8.93 [2019-03-28 12:38:03,107 INFO L225 Difference]: With dead ends: 36 19.72/8.93 [2019-03-28 12:38:03,107 INFO L226 Difference]: Without dead ends: 31 19.72/8.93 [2019-03-28 12:38:03,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.72/8.93 [2019-03-28 12:38:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. 19.72/8.93 [2019-03-28 12:38:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. 19.72/8.93 [2019-03-28 12:38:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. 19.72/8.93 [2019-03-28 12:38:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. 19.72/8.93 [2019-03-28 12:38:03,112 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 3 19.72/8.93 [2019-03-28 12:38:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. 19.72/8.93 [2019-03-28 12:38:03,112 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. 19.72/8.93 [2019-03-28 12:38:03,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.72/8.93 [2019-03-28 12:38:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. 19.72/8.93 [2019-03-28 12:38:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 19.72/8.93 [2019-03-28 12:38:03,113 INFO L394 BasicCegarLoop]: Found error trace 19.72/8.93 [2019-03-28 12:38:03,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 19.72/8.93 [2019-03-28 12:38:03,113 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION]=== 19.72/8.93 [2019-03-28 12:38:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.72/8.93 [2019-03-28 12:38:03,114 INFO L82 PathProgramCache]: Analyzing trace with hash 3573747, now seen corresponding path program 1 times 19.72/8.93 [2019-03-28 12:38:03,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.72/8.93 [2019-03-28 12:38:03,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.72/8.93 [2019-03-28 12:38:03,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.72/8.93 [2019-03-28 12:38:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.72/8.93 [2019-03-28 12:38:03,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.72/8.93 [2019-03-28 12:38:03,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.72/8.93 [2019-03-28 12:38:03,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.72/8.93 [2019-03-28 12:38:03,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.72/8.93 [2019-03-28 12:38:03,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.72/8.93 [2019-03-28 12:38:03,149 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 3 states. 19.72/8.93 [2019-03-28 12:38:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.72/8.93 [2019-03-28 12:38:03,221 INFO L93 Difference]: Finished difference Result 31 states and 48 transitions. 19.72/8.93 [2019-03-28 12:38:03,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.72/8.93 [2019-03-28 12:38:03,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 19.72/8.93 [2019-03-28 12:38:03,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.72/8.93 [2019-03-28 12:38:03,226 INFO L225 Difference]: With dead ends: 31 19.72/8.93 [2019-03-28 12:38:03,226 INFO L226 Difference]: Without dead ends: 24 19.72/8.93 [2019-03-28 12:38:03,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.72/8.93 [2019-03-28 12:38:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 19.72/8.93 [2019-03-28 12:38:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 19.72/8.93 [2019-03-28 12:38:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 19.72/8.93 [2019-03-28 12:38:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. 19.72/8.93 [2019-03-28 12:38:03,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 4 19.72/8.93 [2019-03-28 12:38:03,232 INFO L84 Accepts]: Finished accepts. word is rejected. 19.72/8.93 [2019-03-28 12:38:03,232 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. 19.72/8.93 [2019-03-28 12:38:03,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.72/8.93 [2019-03-28 12:38:03,232 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. 19.72/8.93 [2019-03-28 12:38:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 19.72/8.93 [2019-03-28 12:38:03,232 INFO L394 BasicCegarLoop]: Found error trace 19.72/8.93 [2019-03-28 12:38:03,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 19.72/8.93 [2019-03-28 12:38:03,233 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION]=== 19.72/8.93 [2019-03-28 12:38:03,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.72/8.93 [2019-03-28 12:38:03,233 INFO L82 PathProgramCache]: Analyzing trace with hash 3573745, now seen corresponding path program 1 times 19.72/8.93 [2019-03-28 12:38:03,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.72/8.93 [2019-03-28 12:38:03,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.72/8.93 [2019-03-28 12:38:03,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.72/8.93 [2019-03-28 12:38:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.72/8.93 [2019-03-28 12:38:03,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 19.72/8.93 [2019-03-28 12:38:03,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 19.72/8.93 [2019-03-28 12:38:03,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 19.72/8.93 [2019-03-28 12:38:03,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 19.72/8.93 [2019-03-28 12:38:03,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.72/8.93 [2019-03-28 12:38:03,273 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. 19.72/8.93 [2019-03-28 12:38:03,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 19.72/8.93 [2019-03-28 12:38:03,325 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. 19.72/8.93 [2019-03-28 12:38:03,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 19.72/8.93 [2019-03-28 12:38:03,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 19.72/8.93 [2019-03-28 12:38:03,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 19.72/8.93 [2019-03-28 12:38:03,326 INFO L225 Difference]: With dead ends: 24 19.72/8.93 [2019-03-28 12:38:03,326 INFO L226 Difference]: Without dead ends: 0 19.72/8.93 [2019-03-28 12:38:03,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 19.72/8.93 [2019-03-28 12:38:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 19.72/8.93 [2019-03-28 12:38:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 19.72/8.93 [2019-03-28 12:38:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 19.72/8.93 [2019-03-28 12:38:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 19.72/8.93 [2019-03-28 12:38:03,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 19.72/8.93 [2019-03-28 12:38:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. 19.72/8.93 [2019-03-28 12:38:03,328 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 19.72/8.93 [2019-03-28 12:38:03,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 19.72/8.93 [2019-03-28 12:38:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 19.72/8.93 [2019-03-28 12:38:03,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 19.72/8.93 [2019-03-28 12:38:03,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 19.72/8.93 [2019-03-28 12:38:03,359 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,359 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,359 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,360 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,360 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 21) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,361 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 14) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,361 INFO L444 ceAbstractionStarter]: At program point L15-4(lines 15 21) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0)) 19.72/8.93 [2019-03-28 12:38:03,361 INFO L448 ceAbstractionStarter]: For program point L15-5(lines 15 21) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,361 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,361 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,362 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,362 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,362 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,362 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,362 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,362 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,362 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 19) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,362 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,363 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,363 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,363 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,363 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,363 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,363 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,363 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,364 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,364 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,364 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,364 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,365 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 19.72/8.93 [2019-03-28 12:38:03,365 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 19.72/8.93 [2019-03-28 12:38:03,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.72/8.93 [2019-03-28 12:38:03,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.72/8.93 [2019-03-28 12:38:03,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.72/8.93 [2019-03-28 12:38:03,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.72/8.93 [2019-03-28 12:38:03,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:03 BasicIcfg 19.72/8.93 [2019-03-28 12:38:03,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 19.72/8.93 [2019-03-28 12:38:03,385 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 19.72/8.93 [2019-03-28 12:38:03,385 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 19.72/8.93 [2019-03-28 12:38:03,389 INFO L276 PluginConnector]: BuchiAutomizer initialized 19.72/8.93 [2019-03-28 12:38:03,389 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.72/8.93 [2019-03-28 12:38:03,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:38:01" (1/5) ... 19.72/8.93 [2019-03-28 12:38:03,390 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@aead6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:38:03, skipping insertion in model container 19.72/8.93 [2019-03-28 12:38:03,390 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.72/8.93 [2019-03-28 12:38:03,391 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:38:01" (2/5) ... 19.72/8.93 [2019-03-28 12:38:03,391 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@aead6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:38:03, skipping insertion in model container 19.72/8.93 [2019-03-28 12:38:03,391 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.72/8.93 [2019-03-28 12:38:03,391 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:38:02" (3/5) ... 19.72/8.93 [2019-03-28 12:38:03,391 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@aead6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:03, skipping insertion in model container 19.72/8.93 [2019-03-28 12:38:03,392 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.72/8.93 [2019-03-28 12:38:03,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:38:02" (4/5) ... 19.72/8.93 [2019-03-28 12:38:03,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@aead6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:03, skipping insertion in model container 19.72/8.93 [2019-03-28 12:38:03,393 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 19.72/8.93 [2019-03-28 12:38:03,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:38:03" (5/5) ... 19.72/8.93 [2019-03-28 12:38:03,394 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 19.72/8.93 [2019-03-28 12:38:03,416 INFO L133 ementStrategyFactory]: Using default assertion order modulation 19.72/8.93 [2019-03-28 12:38:03,416 INFO L374 BuchiCegarLoop]: Interprodecural is true 19.72/8.93 [2019-03-28 12:38:03,416 INFO L375 BuchiCegarLoop]: Hoare is true 19.72/8.93 [2019-03-28 12:38:03,416 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 19.72/8.93 [2019-03-28 12:38:03,417 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 19.72/8.93 [2019-03-28 12:38:03,417 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 19.72/8.93 [2019-03-28 12:38:03,417 INFO L379 BuchiCegarLoop]: Difference is false 19.72/8.93 [2019-03-28 12:38:03,417 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 19.72/8.93 [2019-03-28 12:38:03,417 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 19.72/8.93 [2019-03-28 12:38:03,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. 19.72/8.93 [2019-03-28 12:38:03,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 19.72/8.93 [2019-03-28 12:38:03,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.72/8.93 [2019-03-28 12:38:03,429 INFO L119 BuchiIsEmpty]: Starting construction of run 19.72/8.93 [2019-03-28 12:38:03,434 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 19.72/8.93 [2019-03-28 12:38:03,434 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 19.72/8.93 [2019-03-28 12:38:03,434 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 19.72/8.93 [2019-03-28 12:38:03,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states. 19.72/8.93 [2019-03-28 12:38:03,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 19.72/8.93 [2019-03-28 12:38:03,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 19.72/8.93 [2019-03-28 12:38:03,437 INFO L119 BuchiIsEmpty]: Starting construction of run 19.72/8.93 [2019-03-28 12:38:03,438 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 19.72/8.93 [2019-03-28 12:38:03,438 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 19.72/8.93 [2019-03-28 12:38:03,444 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue [84] 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] 17#L-1true [153] L-1-->L9: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1) |v_#valid_3|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem2, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset] 14#L9true [112] L9-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_4| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|) (= 1 (select |v_#valid_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_4|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 11#L9-1true [106] L9-1-->L10: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 19#L10true [75] L10-->L11: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem2_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= (select |v_#valid_10| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_8|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 36#L11true [129] L11-->L15-4: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem2_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_6|} OutVars{ULTIMATE.start_test_fun_#t~mem2=|v_ULTIMATE.start_test_fun_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem2] 37#L15-4true 19.72/8.93 [2019-03-28 12:38:03,445 INFO L796 eck$LassoCheckResult]: Loop: 37#L15-4true [88] L15-4-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 42#L15-1true [94] L15-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem5_2|)) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 41#L15-2true [93] L15-2-->L16: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem5_6| |v_ULTIMATE.start_test_fun_#t~mem4_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5] 5#L16true [99] L16-->L16-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_16|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 3#L16-1true [141] L16-1-->L20: Formula: (> |v_ULTIMATE.start_test_fun_#t~mem6_6| 0) InVars {ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 16#L20true [115] L20-->L20-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= 1 (select |v_#valid_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, #valid=|v_#valid_28|} OutVars{#valid=|v_#valid_28|, #memory_int=|v_#memory_int_11|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 13#L20-1true [109] L20-1-->L20-2: Formula: (and (= (select |v_#valid_30| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) 1) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_22| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11)) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, #valid=|v_#valid_30|} OutVars{#valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_22|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 10#L20-2true [207] L20-2-->L15-4: Formula: (and (= (select |v_#valid_45| v_ULTIMATE.start_test_fun_~y_ref~0.base_27) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_20 4) (select |v_#length_31| v_ULTIMATE.start_test_fun_~y_ref~0.base_27)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_20) (= |v_#memory_int_19| (store |v_#memory_int_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_27 (store (select |v_#memory_int_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_27) v_ULTIMATE.start_test_fun_~y_ref~0.offset_20 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| |v_ULTIMATE.start_test_fun_#t~mem8_6|))))) InVars {#valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_31|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_20} OutVars{#valid=|v_#valid_45|, #memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_27, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_20} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9] 37#L15-4true 19.72/8.93 [2019-03-28 12:38:03,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.72/8.93 [2019-03-28 12:38:03,446 INFO L82 PathProgramCache]: Analyzing trace with hash -857875306, now seen corresponding path program 1 times 19.72/8.93 [2019-03-28 12:38:03,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.72/8.93 [2019-03-28 12:38:03,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.72/8.93 [2019-03-28 12:38:03,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.72/8.93 [2019-03-28 12:38:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.72/8.93 [2019-03-28 12:38:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.72/8.93 [2019-03-28 12:38:03,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1520254005, now seen corresponding path program 1 times 19.72/8.93 [2019-03-28 12:38:03,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.72/8.93 [2019-03-28 12:38:03,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.72/8.93 [2019-03-28 12:38:03,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.72/8.93 [2019-03-28 12:38:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.72/8.93 [2019-03-28 12:38:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.72/8.93 [2019-03-28 12:38:03,527 INFO L82 PathProgramCache]: Analyzing trace with hash 364098506, now seen corresponding path program 1 times 19.72/8.93 [2019-03-28 12:38:03,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 19.72/8.93 [2019-03-28 12:38:03,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 19.72/8.93 [2019-03-28 12:38:03,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 19.72/8.93 [2019-03-28 12:38:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.72/8.93 [2019-03-28 12:38:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.72/8.93 [2019-03-28 12:38:03,882 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 19.72/8.93 [2019-03-28 12:38:03,993 INFO L216 LassoAnalysis]: Preferences: 19.72/8.93 [2019-03-28 12:38:03,994 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 19.72/8.93 [2019-03-28 12:38:03,995 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 19.72/8.93 [2019-03-28 12:38:03,995 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 19.72/8.93 [2019-03-28 12:38:03,995 INFO L127 ssoRankerPreferences]: Use exernal solver: false 19.72/8.93 [2019-03-28 12:38:03,995 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 19.72/8.93 [2019-03-28 12:38:03,995 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 19.72/8.93 [2019-03-28 12:38:03,995 INFO L130 ssoRankerPreferences]: Path of dumped script: 19.72/8.93 [2019-03-28 12:38:03,996 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 19.72/8.93 [2019-03-28 12:38:03,996 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 19.72/8.93 [2019-03-28 12:38:03,996 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 19.72/8.93 [2019-03-28 12:38:04,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 19.72/8.93 [2019-03-28 12:38:04,264 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 19.72/8.93 [2019-03-28 12:38:04,628 INFO L300 LassoAnalysis]: Preprocessing complete. 19.72/8.93 [2019-03-28 12:38:04,634 INFO L497 LassoAnalysis]: Using template 'affine'. 19.72/8.93 [2019-03-28 12:38:04,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.72/8.93 [2019-03-28 12:38:04,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.72/8.93 [2019-03-28 12:38:04,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.72/8.93 [2019-03-28 12:38:04,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.72/8.93 [2019-03-28 12:38:04,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.72/8.93 [2019-03-28 12:38:04,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.72/8.93 [2019-03-28 12:38:04,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.72/8.93 [2019-03-28 12:38:04,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.72/8.93 [2019-03-28 12:38:04,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.72/8.93 [2019-03-28 12:38:04,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.72/8.93 [2019-03-28 12:38:04,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.72/8.93 [2019-03-28 12:38:04,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 19.72/8.93 [2019-03-28 12:38:04,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 19.72/8.93 [2019-03-28 12:38:04,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 19.72/8.93 Termination analysis: LINEAR_WITH_GUESSES 19.72/8.93 Number of strict supporting invariants: 0 19.72/8.93 Number of non-strict supporting invariants: 1 19.72/8.93 Consider only non-deceasing supporting invariants: true 19.72/8.93 Simplify termination arguments: true 19.72/8.93 Simplify supporting invariants: trueOverapproximate stem: false 19.72/8.93 [2019-03-28 12:38:04,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. 19.72/8.93 [2019-03-28 12:38:04,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 19.72/8.93 [2019-03-28 12:38:04,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 19.72/8.93 [2019-03-28 12:38:04,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 19.72/8.93 [2019-03-28 12:38:04,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 19.72/8.93 [2019-03-28 12:38:04,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 19.72/8.93 [2019-03-28 12:38:04,786 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 19.72/8.93 [2019-03-28 12:38:04,807 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 19.72/8.93 [2019-03-28 12:38:04,808 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. 19.72/8.93 [2019-03-28 12:38:04,810 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 19.72/8.93 [2019-03-28 12:38:04,811 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 19.72/8.93 [2019-03-28 12:38:04,812 INFO L518 LassoAnalysis]: Proved termination. 19.72/8.93 [2019-03-28 12:38:04,812 INFO L520 LassoAnalysis]: Termination argument consisting of: 19.72/8.93 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 19.72/8.93 Supporting invariants [] 19.72/8.93 [2019-03-28 12:38:04,845 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed 19.72/8.93 [2019-03-28 12:38:04,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 19.72/8.93 [2019-03-28 12:38:04,848 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 19.72/8.93 [2019-03-28 12:38:04,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 19.72/8.93 [2019-03-28 12:38:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.72/8.93 [2019-03-28 12:38:04,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core 19.72/8.93 [2019-03-28 12:38:04,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.72/8.93 [2019-03-28 12:38:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 19.72/8.93 [2019-03-28 12:38:04,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core 19.72/8.93 [2019-03-28 12:38:04,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... 19.72/8.93 [2019-03-28 12:38:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 19.72/8.93 [2019-03-28 12:38:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.72/8.93 [2019-03-28 12:38:05,173 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 19.72/8.93 [2019-03-28 12:38:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.72/8.93 [2019-03-28 12:38:05,187 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 19.72/8.93 [2019-03-28 12:38:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.72/8.93 [2019-03-28 12:38:05,197 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 19.72/8.93 [2019-03-28 12:38:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 19.72/8.93 [2019-03-28 12:38:05,208 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 19.72/8.93 [2019-03-28 12:38:05,209 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization 19.72/8.93 [2019-03-28 12:38:05,213 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 8 loop predicates 19.72/8.93 [2019-03-28 12:38:05,214 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 41 states. Second operand 9 states. 19.72/8.93 [2019-03-28 12:38:05,826 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 41 states.. Second operand 9 states. Result 99 states and 163 transitions. Complement of second has 27 states. 19.72/8.93 [2019-03-28 12:38:05,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 12 non-accepting loop states 2 accepting loop states 19.72/8.93 [2019-03-28 12:38:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 19.72/8.93 [2019-03-28 12:38:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 138 transitions. 19.72/8.93 [2019-03-28 12:38:05,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 138 transitions. Stem has 6 letters. Loop has 8 letters. 19.72/8.93 [2019-03-28 12:38:05,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.72/8.93 [2019-03-28 12:38:05,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 138 transitions. Stem has 14 letters. Loop has 8 letters. 19.72/8.93 [2019-03-28 12:38:05,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.72/8.93 [2019-03-28 12:38:05,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 138 transitions. Stem has 6 letters. Loop has 16 letters. 19.72/8.93 [2019-03-28 12:38:05,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. 19.72/8.93 [2019-03-28 12:38:05,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 163 transitions. 19.72/8.93 [2019-03-28 12:38:05,849 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.72/8.93 [2019-03-28 12:38:05,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 0 states and 0 transitions. 19.72/8.93 [2019-03-28 12:38:05,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 19.72/8.93 [2019-03-28 12:38:05,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 19.72/8.93 [2019-03-28 12:38:05,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 19.72/8.93 [2019-03-28 12:38:05,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 19.72/8.93 [2019-03-28 12:38:05,852 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.72/8.93 [2019-03-28 12:38:05,852 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.72/8.93 [2019-03-28 12:38:05,853 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 19.72/8.93 [2019-03-28 12:38:05,853 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 19.72/8.93 [2019-03-28 12:38:05,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 19.72/8.93 [2019-03-28 12:38:05,853 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 19.72/8.93 [2019-03-28 12:38:05,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 19.72/8.93 [2019-03-28 12:38:05,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:05 BasicIcfg 19.72/8.93 [2019-03-28 12:38:05,859 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 19.72/8.93 [2019-03-28 12:38:05,860 INFO L168 Benchmark]: Toolchain (without parser) took 4433.77 ms. Allocated memory was 649.6 MB in the beginning and 737.1 MB in the end (delta: 87.6 MB). Free memory was 563.9 MB in the beginning and 397.3 MB in the end (delta: 166.6 MB). Peak memory consumption was 254.2 MB. Max. memory is 50.3 GB. 19.72/8.93 [2019-03-28 12:38:05,861 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 592.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.72/8.93 [2019-03-28 12:38:05,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.06 ms. Allocated memory was 649.6 MB in the beginning and 660.6 MB in the end (delta: 11.0 MB). Free memory was 563.9 MB in the beginning and 625.6 MB in the end (delta: -61.7 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 19.72/8.93 [2019-03-28 12:38:05,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.03 ms. Allocated memory is still 660.6 MB. Free memory was 625.6 MB in the beginning and 622.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 19.72/8.93 [2019-03-28 12:38:05,863 INFO L168 Benchmark]: Boogie Preprocessor took 25.21 ms. Allocated memory is still 660.6 MB. Free memory was 622.5 MB in the beginning and 621.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 19.72/8.93 [2019-03-28 12:38:05,863 INFO L168 Benchmark]: RCFGBuilder took 368.92 ms. Allocated memory is still 660.6 MB. Free memory was 621.2 MB in the beginning and 595.0 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 50.3 GB. 19.72/8.93 [2019-03-28 12:38:05,864 INFO L168 Benchmark]: BlockEncodingV2 took 130.90 ms. Allocated memory is still 660.6 MB. Free memory was 595.0 MB in the beginning and 585.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 19.72/8.93 [2019-03-28 12:38:05,864 INFO L168 Benchmark]: TraceAbstraction took 1078.08 ms. Allocated memory is still 660.6 MB. Free memory was 584.3 MB in the beginning and 484.6 MB in the end (delta: 99.6 MB). Peak memory consumption was 99.6 MB. Max. memory is 50.3 GB. 19.72/8.93 [2019-03-28 12:38:05,865 INFO L168 Benchmark]: BuchiAutomizer took 2474.37 ms. Allocated memory was 660.6 MB in the beginning and 737.1 MB in the end (delta: 76.5 MB). Free memory was 483.3 MB in the beginning and 397.3 MB in the end (delta: 86.0 MB). Peak memory consumption was 162.6 MB. Max. memory is 50.3 GB. 19.72/8.93 [2019-03-28 12:38:05,869 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 19.72/8.93 --- Results --- 19.72/8.93 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 19.72/8.93 - StatisticsResult: Initial Icfg 19.72/8.93 49 locations, 52 edges 19.72/8.93 - StatisticsResult: Encoded RCFG 19.72/8.93 41 locations, 68 edges 19.72/8.93 * Results from de.uni_freiburg.informatik.ultimate.core: 19.72/8.93 - StatisticsResult: Toolchain Benchmarks 19.72/8.93 Benchmark results are: 19.72/8.93 * CDTParser took 0.19 ms. Allocated memory is still 649.6 MB. Free memory is still 592.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 19.72/8.93 * CACSL2BoogieTranslator took 307.06 ms. Allocated memory was 649.6 MB in the beginning and 660.6 MB in the end (delta: 11.0 MB). Free memory was 563.9 MB in the beginning and 625.6 MB in the end (delta: -61.7 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 19.72/8.93 * Boogie Procedure Inliner took 44.03 ms. Allocated memory is still 660.6 MB. Free memory was 625.6 MB in the beginning and 622.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 19.72/8.93 * Boogie Preprocessor took 25.21 ms. Allocated memory is still 660.6 MB. Free memory was 622.5 MB in the beginning and 621.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 19.72/8.93 * RCFGBuilder took 368.92 ms. Allocated memory is still 660.6 MB. Free memory was 621.2 MB in the beginning and 595.0 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 50.3 GB. 19.72/8.93 * BlockEncodingV2 took 130.90 ms. Allocated memory is still 660.6 MB. Free memory was 595.0 MB in the beginning and 585.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. 19.72/8.93 * TraceAbstraction took 1078.08 ms. Allocated memory is still 660.6 MB. Free memory was 584.3 MB in the beginning and 484.6 MB in the end (delta: 99.6 MB). Peak memory consumption was 99.6 MB. Max. memory is 50.3 GB. 19.72/8.93 * BuchiAutomizer took 2474.37 ms. Allocated memory was 660.6 MB in the beginning and 737.1 MB in the end (delta: 76.5 MB). Free memory was 483.3 MB in the beginning and 397.3 MB in the end (delta: 86.0 MB). Peak memory consumption was 162.6 MB. Max. memory is 50.3 GB. 19.72/8.93 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 19.72/8.93 - GenericResult: Unfinished Backtranslation 19.72/8.93 unknown boogie variable #length 19.72/8.93 - GenericResult: Unfinished Backtranslation 19.72/8.93 unknown boogie variable #length 19.72/8.93 - GenericResult: Unfinished Backtranslation 19.72/8.93 unknown boogie variable #length 19.72/8.93 - GenericResult: Unfinished Backtranslation 19.72/8.93 unknown boogie variable #length 19.72/8.93 - GenericResult: Unfinished Backtranslation 19.72/8.93 unknown boogie variable #memory_int 19.72/8.93 - GenericResult: Unfinished Backtranslation 19.72/8.93 unknown boogie variable #memory_int 19.72/8.93 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 19.72/8.93 - PositiveResult [Line: 13]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 20]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 11]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 20]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 11]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 15]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 18]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 15]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 20]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 13]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 20]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 9]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 16]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 22]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 9]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 16]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 15]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 18]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 20]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 10]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 20]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 10]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 15]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - PositiveResult [Line: 22]: pointer dereference always succeeds 19.72/8.93 For all program executions holds that pointer dereference always succeeds at this location 19.72/8.93 - AllSpecificationsHoldResult: All specifications hold 19.72/8.93 24 specifications checked. All of them hold 19.72/8.93 - InvariantResult [Line: 15]: Loop Invariant 19.72/8.93 [2019-03-28 12:38:05,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.72/8.93 [2019-03-28 12:38:05,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.72/8.93 [2019-03-28 12:38:05,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.72/8.93 [2019-03-28 12:38:05,880 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 19.72/8.93 Derived loop invariant: ((((4 == unknown-#length-unknown[x_ref] && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0 19.72/8.93 - StatisticsResult: Ultimate Automizer benchmark data 19.72/8.93 CFG has 1 procedures, 41 locations, 24 error locations. SAFE Result, 0.9s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 186 SDslu, 3 SDs, 0 SdLazy, 191 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 19.72/8.93 - StatisticsResult: Constructed decomposition of program 19.72/8.93 Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 15 locations. 19.72/8.93 - StatisticsResult: Timing statistics 19.72/8.93 BüchiAutomizer plugin needed 2.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 183 SDslu, 7 SDs, 0 SdLazy, 570 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital207 mio100 ax100 hnf100 lsp94 ukn70 mio100 lsp37 div100 bol100 ite100 ukn100 eq153 hnf91 smp91 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 19.72/8.93 - TerminationAnalysisResult: Termination proven 19.72/8.93 Buchi Automizer proved that your program is terminating 19.72/8.93 RESULT: Ultimate proved your program to be correct! 19.72/8.93 !SESSION 2019-03-28 12:37:58.081 ----------------------------------------------- 19.72/8.93 eclipse.buildId=unknown 19.72/8.93 java.version=1.8.0_181 19.72/8.93 java.vendor=Oracle Corporation 19.72/8.93 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 19.72/8.93 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 19.72/8.93 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 19.72/8.93 19.72/8.93 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:38:06.108 19.72/8.93 !MESSAGE The workspace will exit with unsaved changes in this session. 19.72/8.93 Received shutdown request... 19.72/8.93 Ultimate: 19.72/8.93 GTK+ Version Check 19.72/8.93 EOF