48.00/21.17 NO 48.00/21.17 48.00/21.17 Ultimate: Cannot open display: 48.00/21.17 This is Ultimate 0.1.24-8dc7c08-m 48.00/21.17 [2019-03-28 12:41:00,439 INFO L170 SettingsManager]: Resetting all preferences to default values... 48.00/21.17 [2019-03-28 12:41:00,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 48.00/21.17 [2019-03-28 12:41:00,453 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 48.00/21.17 [2019-03-28 12:41:00,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 48.00/21.17 [2019-03-28 12:41:00,455 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 48.00/21.17 [2019-03-28 12:41:00,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 48.00/21.17 [2019-03-28 12:41:00,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 48.00/21.17 [2019-03-28 12:41:00,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 48.00/21.17 [2019-03-28 12:41:00,460 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 48.00/21.17 [2019-03-28 12:41:00,461 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 48.00/21.17 [2019-03-28 12:41:00,461 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 48.00/21.17 [2019-03-28 12:41:00,462 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 48.00/21.17 [2019-03-28 12:41:00,463 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 48.00/21.17 [2019-03-28 12:41:00,464 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 48.00/21.17 [2019-03-28 12:41:00,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 48.00/21.17 [2019-03-28 12:41:00,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 48.00/21.17 [2019-03-28 12:41:00,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 48.00/21.17 [2019-03-28 12:41:00,469 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 48.00/21.17 [2019-03-28 12:41:00,470 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 48.00/21.17 [2019-03-28 12:41:00,472 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 48.00/21.17 [2019-03-28 12:41:00,473 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 48.00/21.17 [2019-03-28 12:41:00,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 48.00/21.17 [2019-03-28 12:41:00,475 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 48.00/21.17 [2019-03-28 12:41:00,475 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 48.00/21.17 [2019-03-28 12:41:00,476 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 48.00/21.17 [2019-03-28 12:41:00,477 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 48.00/21.17 [2019-03-28 12:41:00,477 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 48.00/21.17 [2019-03-28 12:41:00,478 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 48.00/21.17 [2019-03-28 12:41:00,478 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 48.00/21.17 [2019-03-28 12:41:00,479 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 48.00/21.17 [2019-03-28 12:41:00,480 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 48.00/21.17 [2019-03-28 12:41:00,481 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 48.00/21.17 [2019-03-28 12:41:00,481 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 48.00/21.17 [2019-03-28 12:41:00,482 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 48.00/21.17 [2019-03-28 12:41:00,482 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 48.00/21.17 [2019-03-28 12:41:00,482 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 48.00/21.17 [2019-03-28 12:41:00,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 48.00/21.17 [2019-03-28 12:41:00,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 48.00/21.17 [2019-03-28 12:41:00,484 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 48.00/21.17 [2019-03-28 12:41:00,499 INFO L110 SettingsManager]: Loading preferences was successful 48.00/21.17 [2019-03-28 12:41:00,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 48.00/21.17 [2019-03-28 12:41:00,501 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 48.00/21.17 [2019-03-28 12:41:00,501 INFO L133 SettingsManager]: * Rewrite not-equals=true 48.00/21.17 [2019-03-28 12:41:00,501 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 48.00/21.17 [2019-03-28 12:41:00,501 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 48.00/21.17 [2019-03-28 12:41:00,502 INFO L133 SettingsManager]: * Use SBE=true 48.00/21.17 [2019-03-28 12:41:00,502 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 48.00/21.17 [2019-03-28 12:41:00,502 INFO L133 SettingsManager]: * Use old map elimination=false 48.00/21.17 [2019-03-28 12:41:00,502 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 48.00/21.17 [2019-03-28 12:41:00,502 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 48.00/21.17 [2019-03-28 12:41:00,503 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 48.00/21.17 [2019-03-28 12:41:00,503 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 48.00/21.17 [2019-03-28 12:41:00,503 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 48.00/21.17 [2019-03-28 12:41:00,503 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 48.00/21.17 [2019-03-28 12:41:00,503 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 48.00/21.17 [2019-03-28 12:41:00,503 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 48.00/21.17 [2019-03-28 12:41:00,504 INFO L133 SettingsManager]: * Check division by zero=IGNORE 48.00/21.17 [2019-03-28 12:41:00,504 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 48.00/21.17 [2019-03-28 12:41:00,504 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 48.00/21.17 [2019-03-28 12:41:00,504 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 48.00/21.17 [2019-03-28 12:41:00,504 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 48.00/21.17 [2019-03-28 12:41:00,505 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 48.00/21.17 [2019-03-28 12:41:00,505 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 48.00/21.17 [2019-03-28 12:41:00,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 48.00/21.17 [2019-03-28 12:41:00,505 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 48.00/21.17 [2019-03-28 12:41:00,505 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 48.00/21.17 [2019-03-28 12:41:00,506 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 48.00/21.17 [2019-03-28 12:41:00,506 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 48.00/21.17 [2019-03-28 12:41:00,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 48.00/21.17 [2019-03-28 12:41:00,547 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 48.00/21.17 [2019-03-28 12:41:00,550 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 48.00/21.17 [2019-03-28 12:41:00,552 INFO L271 PluginConnector]: Initializing CDTParser... 48.00/21.17 [2019-03-28 12:41:00,552 INFO L276 PluginConnector]: CDTParser initialized 48.00/21.17 [2019-03-28 12:41:00,553 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 48.00/21.17 [2019-03-28 12:41:00,626 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/91f5e74cab704a2b8681c18e8169a2a5/FLAG74a0a6ae5 48.00/21.17 [2019-03-28 12:41:00,970 INFO L307 CDTParser]: Found 1 translation units. 48.00/21.17 [2019-03-28 12:41:00,971 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 48.00/21.17 [2019-03-28 12:41:00,971 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 48.00/21.17 [2019-03-28 12:41:00,978 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/91f5e74cab704a2b8681c18e8169a2a5/FLAG74a0a6ae5 48.00/21.17 [2019-03-28 12:41:01,360 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/91f5e74cab704a2b8681c18e8169a2a5 48.00/21.17 [2019-03-28 12:41:01,372 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 48.00/21.17 [2019-03-28 12:41:01,373 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 48.00/21.17 [2019-03-28 12:41:01,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 48.00/21.17 [2019-03-28 12:41:01,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 48.00/21.17 [2019-03-28 12:41:01,378 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 48.00/21.17 [2019-03-28 12:41:01,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:41:01" (1/1) ... 48.00/21.17 [2019-03-28 12:41:01,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ee34d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:01, skipping insertion in model container 48.00/21.17 [2019-03-28 12:41:01,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:41:01" (1/1) ... 48.00/21.17 [2019-03-28 12:41:01,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 48.00/21.17 [2019-03-28 12:41:01,409 INFO L176 MainTranslator]: Built tables and reachable declarations 48.00/21.17 [2019-03-28 12:41:01,576 INFO L206 PostProcessor]: Analyzing one entry point: main 48.00/21.17 [2019-03-28 12:41:01,587 INFO L191 MainTranslator]: Completed pre-run 48.00/21.17 [2019-03-28 12:41:01,668 INFO L206 PostProcessor]: Analyzing one entry point: main 48.00/21.17 [2019-03-28 12:41:01,684 INFO L195 MainTranslator]: Completed translation 48.00/21.17 [2019-03-28 12:41:01,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:01 WrapperNode 48.00/21.17 [2019-03-28 12:41:01,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 48.00/21.17 [2019-03-28 12:41:01,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 48.00/21.17 [2019-03-28 12:41:01,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 48.00/21.17 [2019-03-28 12:41:01,686 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 48.00/21.17 [2019-03-28 12:41:01,695 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:41:01" (1/1) ... 48.00/21.17 [2019-03-28 12:41:01,705 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:41:01" (1/1) ... 48.00/21.17 [2019-03-28 12:41:01,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 48.00/21.17 [2019-03-28 12:41:01,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 48.00/21.17 [2019-03-28 12:41:01,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 48.00/21.17 [2019-03-28 12:41:01,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized 48.00/21.17 [2019-03-28 12:41:01,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:01" (1/1) ... 48.00/21.17 [2019-03-28 12:41:01,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:01" (1/1) ... 48.00/21.17 [2019-03-28 12:41:01,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:01" (1/1) ... 48.00/21.17 [2019-03-28 12:41:01,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:01" (1/1) ... 48.00/21.17 [2019-03-28 12:41:01,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:01" (1/1) ... 48.00/21.17 [2019-03-28 12:41:01,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:01" (1/1) ... 48.00/21.17 [2019-03-28 12:41:01,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:01" (1/1) ... 48.00/21.17 [2019-03-28 12:41:01,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 48.00/21.17 [2019-03-28 12:41:01,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 48.00/21.17 [2019-03-28 12:41:01,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... 48.00/21.17 [2019-03-28 12:41:01,766 INFO L276 PluginConnector]: RCFGBuilder initialized 48.00/21.17 [2019-03-28 12:41:01,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:01" (1/1) ... 48.00/21.17 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 48.00/21.17 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 48.00/21.17 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 48.00/21.17 [2019-03-28 12:41:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 48.00/21.17 [2019-03-28 12:41:01,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 48.00/21.17 [2019-03-28 12:41:01,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 48.00/21.17 [2019-03-28 12:41:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 48.00/21.17 [2019-03-28 12:41:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 48.00/21.17 [2019-03-28 12:41:01,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 48.00/21.17 [2019-03-28 12:41:02,439 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 48.00/21.17 [2019-03-28 12:41:02,440 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. 48.00/21.17 [2019-03-28 12:41:02,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:02 BoogieIcfgContainer 48.00/21.17 [2019-03-28 12:41:02,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 48.00/21.17 [2019-03-28 12:41:02,442 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 48.00/21.17 [2019-03-28 12:41:02,442 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 48.00/21.17 [2019-03-28 12:41:02,444 INFO L276 PluginConnector]: BlockEncodingV2 initialized 48.00/21.17 [2019-03-28 12:41:02,445 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:02" (1/1) ... 48.00/21.17 [2019-03-28 12:41:02,471 INFO L313 BlockEncoder]: Initial Icfg 187 locations, 222 edges 48.00/21.17 [2019-03-28 12:41:02,473 INFO L258 BlockEncoder]: Using Remove infeasible edges 48.00/21.17 [2019-03-28 12:41:02,473 INFO L263 BlockEncoder]: Using Maximize final states 48.00/21.17 [2019-03-28 12:41:02,474 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 48.00/21.17 [2019-03-28 12:41:02,474 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 48.00/21.17 [2019-03-28 12:41:02,476 INFO L296 BlockEncoder]: Using Remove sink states 48.00/21.17 [2019-03-28 12:41:02,477 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 48.00/21.17 [2019-03-28 12:41:02,477 INFO L179 BlockEncoder]: Using Rewrite not-equals 48.00/21.17 [2019-03-28 12:41:02,523 INFO L185 BlockEncoder]: Using Use SBE 48.00/21.17 [2019-03-28 12:41:02,582 INFO L200 BlockEncoder]: SBE split 125 edges 48.00/21.17 [2019-03-28 12:41:02,588 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 48.00/21.17 [2019-03-28 12:41:02,591 INFO L71 MaximizeFinalStates]: 0 new accepting states 48.00/21.17 [2019-03-28 12:41:02,626 INFO L100 BaseMinimizeStates]: Removed 28 edges and 14 locations by large block encoding 48.00/21.17 [2019-03-28 12:41:02,629 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 48.00/21.17 [2019-03-28 12:41:02,631 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 48.00/21.17 [2019-03-28 12:41:02,632 INFO L71 MaximizeFinalStates]: 0 new accepting states 48.00/21.17 [2019-03-28 12:41:02,636 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding 48.00/21.17 [2019-03-28 12:41:02,637 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 48.00/21.17 [2019-03-28 12:41:02,638 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 48.00/21.17 [2019-03-28 12:41:02,638 INFO L71 MaximizeFinalStates]: 0 new accepting states 48.00/21.17 [2019-03-28 12:41:02,639 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 48.00/21.17 [2019-03-28 12:41:02,640 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 48.00/21.17 [2019-03-28 12:41:02,641 INFO L313 BlockEncoder]: Encoded RCFG 171 locations, 340 edges 48.00/21.17 [2019-03-28 12:41:02,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:02 BasicIcfg 48.00/21.17 [2019-03-28 12:41:02,641 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 48.00/21.17 [2019-03-28 12:41:02,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 48.00/21.17 [2019-03-28 12:41:02,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... 48.00/21.17 [2019-03-28 12:41:02,646 INFO L276 PluginConnector]: TraceAbstraction initialized 48.00/21.17 [2019-03-28 12:41:02,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:41:01" (1/4) ... 48.00/21.17 [2019-03-28 12:41:02,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435f7795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:41:02, skipping insertion in model container 48.00/21.17 [2019-03-28 12:41:02,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:01" (2/4) ... 48.00/21.17 [2019-03-28 12:41:02,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435f7795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:41:02, skipping insertion in model container 48.00/21.17 [2019-03-28 12:41:02,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:02" (3/4) ... 48.00/21.17 [2019-03-28 12:41:02,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435f7795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:02, skipping insertion in model container 48.00/21.17 [2019-03-28 12:41:02,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:02" (4/4) ... 48.00/21.17 [2019-03-28 12:41:02,650 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 48.00/21.17 [2019-03-28 12:41:02,660 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 48.00/21.17 [2019-03-28 12:41:02,669 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 90 error locations. 48.00/21.17 [2019-03-28 12:41:02,687 INFO L257 AbstractCegarLoop]: Starting to check reachability of 90 error locations. 48.00/21.17 [2019-03-28 12:41:02,718 INFO L133 ementStrategyFactory]: Using default assertion order modulation 48.00/21.17 [2019-03-28 12:41:02,719 INFO L382 AbstractCegarLoop]: Interprodecural is true 48.00/21.17 [2019-03-28 12:41:02,719 INFO L383 AbstractCegarLoop]: Hoare is true 48.00/21.17 [2019-03-28 12:41:02,719 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 48.00/21.17 [2019-03-28 12:41:02,719 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 48.00/21.17 [2019-03-28 12:41:02,719 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 48.00/21.17 [2019-03-28 12:41:02,719 INFO L387 AbstractCegarLoop]: Difference is false 48.00/21.17 [2019-03-28 12:41:02,719 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 48.00/21.17 [2019-03-28 12:41:02,720 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 48.00/21.17 [2019-03-28 12:41:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states. 48.00/21.17 [2019-03-28 12:41:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 48.00/21.17 [2019-03-28 12:41:02,745 INFO L394 BasicCegarLoop]: Found error trace 48.00/21.17 [2019-03-28 12:41:02,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 48.00/21.17 [2019-03-28 12:41:02,746 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION]=== 48.04/21.17 [2019-03-28 12:41:02,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:02,751 INFO L82 PathProgramCache]: Analyzing trace with hash 534873, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:02,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:02,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:02,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:02,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:02,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.17 [2019-03-28 12:41:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.04/21.17 [2019-03-28 12:41:02,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.04/21.17 [2019-03-28 12:41:02,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.04/21.17 [2019-03-28 12:41:02,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.04/21.17 [2019-03-28 12:41:02,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.04/21.17 [2019-03-28 12:41:02,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.04/21.17 [2019-03-28 12:41:02,970 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 3 states. 48.04/21.17 [2019-03-28 12:41:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.04/21.17 [2019-03-28 12:41:03,748 INFO L93 Difference]: Finished difference Result 289 states and 576 transitions. 48.04/21.17 [2019-03-28 12:41:03,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:03,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 48.04/21.17 [2019-03-28 12:41:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.04/21.17 [2019-03-28 12:41:03,768 INFO L225 Difference]: With dead ends: 289 48.04/21.17 [2019-03-28 12:41:03,768 INFO L226 Difference]: Without dead ends: 283 48.04/21.17 [2019-03-28 12:41:03,771 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 48.04/21.17 [2019-03-28 12:41:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. 48.04/21.17 [2019-03-28 12:41:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 175. 48.04/21.17 [2019-03-28 12:41:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. 48.04/21.17 [2019-03-28 12:41:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 366 transitions. 48.04/21.17 [2019-03-28 12:41:03,829 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 366 transitions. Word has length 3 48.04/21.17 [2019-03-28 12:41:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. 48.04/21.17 [2019-03-28 12:41:03,830 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 366 transitions. 48.04/21.17 [2019-03-28 12:41:03,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 366 transitions. 48.04/21.17 [2019-03-28 12:41:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 48.04/21.17 [2019-03-28 12:41:03,831 INFO L394 BasicCegarLoop]: Found error trace 48.04/21.17 [2019-03-28 12:41:03,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 48.04/21.17 [2019-03-28 12:41:03,832 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION]=== 48.04/21.17 [2019-03-28 12:41:03,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash 534875, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:03,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:03,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:03,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:03,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:03,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.17 [2019-03-28 12:41:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.04/21.17 [2019-03-28 12:41:03,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.04/21.17 [2019-03-28 12:41:03,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.04/21.17 [2019-03-28 12:41:03,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.04/21.17 [2019-03-28 12:41:03,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.04/21.17 [2019-03-28 12:41:03,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.04/21.17 [2019-03-28 12:41:03,870 INFO L87 Difference]: Start difference. First operand 175 states and 366 transitions. Second operand 3 states. 48.04/21.17 [2019-03-28 12:41:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.04/21.17 [2019-03-28 12:41:04,229 INFO L93 Difference]: Finished difference Result 175 states and 366 transitions. 48.04/21.17 [2019-03-28 12:41:04,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:04,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 48.04/21.17 [2019-03-28 12:41:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.04/21.17 [2019-03-28 12:41:04,232 INFO L225 Difference]: With dead ends: 175 48.04/21.17 [2019-03-28 12:41:04,232 INFO L226 Difference]: Without dead ends: 169 48.04/21.17 [2019-03-28 12:41:04,233 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 48.04/21.17 [2019-03-28 12:41:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. 48.04/21.17 [2019-03-28 12:41:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. 48.04/21.17 [2019-03-28 12:41:04,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. 48.04/21.17 [2019-03-28 12:41:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 350 transitions. 48.04/21.17 [2019-03-28 12:41:04,246 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 350 transitions. Word has length 3 48.04/21.17 [2019-03-28 12:41:04,246 INFO L84 Accepts]: Finished accepts. word is rejected. 48.04/21.17 [2019-03-28 12:41:04,246 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 350 transitions. 48.04/21.17 [2019-03-28 12:41:04,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 350 transitions. 48.04/21.17 [2019-03-28 12:41:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 48.04/21.17 [2019-03-28 12:41:04,247 INFO L394 BasicCegarLoop]: Found error trace 48.04/21.17 [2019-03-28 12:41:04,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 48.04/21.17 [2019-03-28 12:41:04,248 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION]=== 48.04/21.17 [2019-03-28 12:41:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:04,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1408090295, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:04,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:04,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:04,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.17 [2019-03-28 12:41:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.04/21.17 [2019-03-28 12:41:04,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.04/21.17 [2019-03-28 12:41:04,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.04/21.17 [2019-03-28 12:41:04,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.04/21.17 [2019-03-28 12:41:04,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.04/21.17 [2019-03-28 12:41:04,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.04/21.17 [2019-03-28 12:41:04,286 INFO L87 Difference]: Start difference. First operand 169 states and 350 transitions. Second operand 3 states. 48.04/21.17 [2019-03-28 12:41:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.04/21.17 [2019-03-28 12:41:04,588 INFO L93 Difference]: Finished difference Result 169 states and 350 transitions. 48.04/21.17 [2019-03-28 12:41:04,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:04,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 48.04/21.17 [2019-03-28 12:41:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.04/21.17 [2019-03-28 12:41:04,590 INFO L225 Difference]: With dead ends: 169 48.04/21.17 [2019-03-28 12:41:04,590 INFO L226 Difference]: Without dead ends: 133 48.04/21.17 [2019-03-28 12:41:04,591 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 48.04/21.17 [2019-03-28 12:41:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. 48.04/21.17 [2019-03-28 12:41:04,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. 48.04/21.17 [2019-03-28 12:41:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. 48.04/21.17 [2019-03-28 12:41:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 278 transitions. 48.04/21.17 [2019-03-28 12:41:04,600 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 278 transitions. Word has length 9 48.04/21.17 [2019-03-28 12:41:04,600 INFO L84 Accepts]: Finished accepts. word is rejected. 48.04/21.17 [2019-03-28 12:41:04,600 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 278 transitions. 48.04/21.17 [2019-03-28 12:41:04,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 278 transitions. 48.04/21.17 [2019-03-28 12:41:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 48.04/21.17 [2019-03-28 12:41:04,601 INFO L394 BasicCegarLoop]: Found error trace 48.04/21.17 [2019-03-28 12:41:04,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 48.04/21.17 [2019-03-28 12:41:04,602 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION]=== 48.04/21.17 [2019-03-28 12:41:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:04,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1408090293, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:04,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:04,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:04,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:04,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:04,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.17 [2019-03-28 12:41:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.04/21.17 [2019-03-28 12:41:04,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.04/21.17 [2019-03-28 12:41:04,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.04/21.17 [2019-03-28 12:41:04,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.04/21.17 [2019-03-28 12:41:04,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.04/21.17 [2019-03-28 12:41:04,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.04/21.17 [2019-03-28 12:41:04,637 INFO L87 Difference]: Start difference. First operand 133 states and 278 transitions. Second operand 3 states. 48.04/21.17 [2019-03-28 12:41:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.04/21.17 [2019-03-28 12:41:04,906 INFO L93 Difference]: Finished difference Result 180 states and 295 transitions. 48.04/21.17 [2019-03-28 12:41:04,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:04,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 48.04/21.17 [2019-03-28 12:41:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.04/21.17 [2019-03-28 12:41:04,907 INFO L225 Difference]: With dead ends: 180 48.04/21.17 [2019-03-28 12:41:04,908 INFO L226 Difference]: Without dead ends: 144 48.04/21.17 [2019-03-28 12:41:04,908 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 48.04/21.17 [2019-03-28 12:41:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. 48.04/21.17 [2019-03-28 12:41:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 133. 48.04/21.17 [2019-03-28 12:41:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. 48.04/21.17 [2019-03-28 12:41:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 242 transitions. 48.04/21.17 [2019-03-28 12:41:04,917 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 242 transitions. Word has length 9 48.04/21.17 [2019-03-28 12:41:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. 48.04/21.17 [2019-03-28 12:41:04,917 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 242 transitions. 48.04/21.17 [2019-03-28 12:41:04,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 242 transitions. 48.04/21.17 [2019-03-28 12:41:04,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 48.04/21.17 [2019-03-28 12:41:04,918 INFO L394 BasicCegarLoop]: Found error trace 48.04/21.17 [2019-03-28 12:41:04,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 48.04/21.17 [2019-03-28 12:41:04,919 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION]=== 48.04/21.17 [2019-03-28 12:41:04,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:04,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1408090292, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:04,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:04,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:04,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:04,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:04,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.17 [2019-03-28 12:41:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.04/21.17 [2019-03-28 12:41:04,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.04/21.17 [2019-03-28 12:41:04,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.04/21.17 [2019-03-28 12:41:04,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.04/21.17 [2019-03-28 12:41:04,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.04/21.17 [2019-03-28 12:41:04,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.04/21.17 [2019-03-28 12:41:04,955 INFO L87 Difference]: Start difference. First operand 133 states and 242 transitions. Second operand 3 states. 48.04/21.17 [2019-03-28 12:41:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.04/21.17 [2019-03-28 12:41:05,230 INFO L93 Difference]: Finished difference Result 144 states and 259 transitions. 48.04/21.17 [2019-03-28 12:41:05,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:05,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 48.04/21.17 [2019-03-28 12:41:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.04/21.17 [2019-03-28 12:41:05,232 INFO L225 Difference]: With dead ends: 144 48.04/21.17 [2019-03-28 12:41:05,232 INFO L226 Difference]: Without dead ends: 108 48.04/21.17 [2019-03-28 12:41:05,233 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 48.04/21.17 [2019-03-28 12:41:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. 48.04/21.17 [2019-03-28 12:41:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. 48.04/21.17 [2019-03-28 12:41:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. 48.04/21.17 [2019-03-28 12:41:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 206 transitions. 48.04/21.17 [2019-03-28 12:41:05,239 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 206 transitions. Word has length 9 48.04/21.17 [2019-03-28 12:41:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. 48.04/21.17 [2019-03-28 12:41:05,239 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 206 transitions. 48.04/21.17 [2019-03-28 12:41:05,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 206 transitions. 48.04/21.17 [2019-03-28 12:41:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 48.04/21.17 [2019-03-28 12:41:05,241 INFO L394 BasicCegarLoop]: Found error trace 48.04/21.17 [2019-03-28 12:41:05,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 48.04/21.17 [2019-03-28 12:41:05,241 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION]=== 48.04/21.17 [2019-03-28 12:41:05,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:05,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1534824764, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:05,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:05,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:05,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:05,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:05,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.17 [2019-03-28 12:41:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.04/21.17 [2019-03-28 12:41:05,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.04/21.17 [2019-03-28 12:41:05,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.04/21.17 [2019-03-28 12:41:05,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.04/21.17 [2019-03-28 12:41:05,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.04/21.17 [2019-03-28 12:41:05,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.04/21.17 [2019-03-28 12:41:05,275 INFO L87 Difference]: Start difference. First operand 97 states and 206 transitions. Second operand 3 states. 48.04/21.17 [2019-03-28 12:41:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.04/21.17 [2019-03-28 12:41:05,578 INFO L93 Difference]: Finished difference Result 149 states and 302 transitions. 48.04/21.17 [2019-03-28 12:41:05,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:05,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 48.04/21.17 [2019-03-28 12:41:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.04/21.17 [2019-03-28 12:41:05,581 INFO L225 Difference]: With dead ends: 149 48.04/21.17 [2019-03-28 12:41:05,582 INFO L226 Difference]: Without dead ends: 146 48.04/21.17 [2019-03-28 12:41:05,582 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 48.04/21.17 [2019-03-28 12:41:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. 48.04/21.17 [2019-03-28 12:41:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 97. 48.04/21.17 [2019-03-28 12:41:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. 48.04/21.17 [2019-03-28 12:41:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 204 transitions. 48.04/21.17 [2019-03-28 12:41:05,588 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 204 transitions. Word has length 10 48.04/21.17 [2019-03-28 12:41:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. 48.04/21.17 [2019-03-28 12:41:05,588 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 204 transitions. 48.04/21.17 [2019-03-28 12:41:05,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 204 transitions. 48.04/21.17 [2019-03-28 12:41:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 48.04/21.17 [2019-03-28 12:41:05,590 INFO L394 BasicCegarLoop]: Found error trace 48.04/21.17 [2019-03-28 12:41:05,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 48.04/21.17 [2019-03-28 12:41:05,590 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION]=== 48.04/21.17 [2019-03-28 12:41:05,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:05,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1534824762, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:05,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:05,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:05,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:05,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:05,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.17 [2019-03-28 12:41:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.04/21.17 [2019-03-28 12:41:05,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.04/21.17 [2019-03-28 12:41:05,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 48.04/21.17 [2019-03-28 12:41:05,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 48.04/21.17 [2019-03-28 12:41:05,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 48.04/21.17 [2019-03-28 12:41:05,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 48.04/21.17 [2019-03-28 12:41:05,624 INFO L87 Difference]: Start difference. First operand 97 states and 204 transitions. Second operand 3 states. 48.04/21.17 [2019-03-28 12:41:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.04/21.17 [2019-03-28 12:41:05,782 INFO L93 Difference]: Finished difference Result 97 states and 204 transitions. 48.04/21.17 [2019-03-28 12:41:05,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:05,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 48.04/21.17 [2019-03-28 12:41:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.04/21.17 [2019-03-28 12:41:05,784 INFO L225 Difference]: With dead ends: 97 48.04/21.17 [2019-03-28 12:41:05,784 INFO L226 Difference]: Without dead ends: 87 48.04/21.17 [2019-03-28 12:41:05,785 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 48.04/21.17 [2019-03-28 12:41:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. 48.04/21.17 [2019-03-28 12:41:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. 48.04/21.17 [2019-03-28 12:41:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. 48.04/21.17 [2019-03-28 12:41:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 180 transitions. 48.04/21.17 [2019-03-28 12:41:05,789 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 180 transitions. Word has length 10 48.04/21.17 [2019-03-28 12:41:05,789 INFO L84 Accepts]: Finished accepts. word is rejected. 48.04/21.17 [2019-03-28 12:41:05,790 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 180 transitions. 48.04/21.17 [2019-03-28 12:41:05,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 48.04/21.17 [2019-03-28 12:41:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 180 transitions. 48.04/21.17 [2019-03-28 12:41:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 48.04/21.17 [2019-03-28 12:41:05,791 INFO L394 BasicCegarLoop]: Found error trace 48.04/21.17 [2019-03-28 12:41:05,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 48.04/21.17 [2019-03-28 12:41:05,792 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION]=== 48.04/21.17 [2019-03-28 12:41:05,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash 125627263, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:05,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:05,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:05,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:05,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:05,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.17 [2019-03-28 12:41:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.04/21.17 [2019-03-28 12:41:05,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.04/21.17 [2019-03-28 12:41:05,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 48.04/21.17 [2019-03-28 12:41:05,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 48.04/21.17 [2019-03-28 12:41:05,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 48.04/21.17 [2019-03-28 12:41:05,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 48.04/21.17 [2019-03-28 12:41:05,855 INFO L87 Difference]: Start difference. First operand 87 states and 180 transitions. Second operand 5 states. 48.04/21.17 [2019-03-28 12:41:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.04/21.17 [2019-03-28 12:41:06,248 INFO L93 Difference]: Finished difference Result 171 states and 355 transitions. 48.04/21.17 [2019-03-28 12:41:06,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 48.04/21.17 [2019-03-28 12:41:06,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 48.04/21.17 [2019-03-28 12:41:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.04/21.17 [2019-03-28 12:41:06,250 INFO L225 Difference]: With dead ends: 171 48.04/21.17 [2019-03-28 12:41:06,250 INFO L226 Difference]: Without dead ends: 166 48.04/21.17 [2019-03-28 12:41:06,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 48.04/21.17 [2019-03-28 12:41:06,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. 48.04/21.17 [2019-03-28 12:41:06,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 84. 48.04/21.17 [2019-03-28 12:41:06,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. 48.04/21.17 [2019-03-28 12:41:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 174 transitions. 48.04/21.17 [2019-03-28 12:41:06,256 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 174 transitions. Word has length 15 48.04/21.17 [2019-03-28 12:41:06,256 INFO L84 Accepts]: Finished accepts. word is rejected. 48.04/21.17 [2019-03-28 12:41:06,256 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 174 transitions. 48.04/21.17 [2019-03-28 12:41:06,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 48.04/21.17 [2019-03-28 12:41:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 174 transitions. 48.04/21.17 [2019-03-28 12:41:06,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 48.04/21.17 [2019-03-28 12:41:06,258 INFO L394 BasicCegarLoop]: Found error trace 48.04/21.17 [2019-03-28 12:41:06,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 48.04/21.17 [2019-03-28 12:41:06,258 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr87REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr89REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr85REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr88REQUIRES_VIOLATION, ULTIMATE.startErr84REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr86REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION]=== 48.04/21.17 [2019-03-28 12:41:06,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:06,259 INFO L82 PathProgramCache]: Analyzing trace with hash 125636846, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:06,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:06,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:06,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:06,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:06,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.17 [2019-03-28 12:41:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.04/21.17 [2019-03-28 12:41:06,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 48.04/21.17 [2019-03-28 12:41:06,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 48.04/21.17 [2019-03-28 12:41:06,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 48.04/21.17 [2019-03-28 12:41:06,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 48.04/21.17 [2019-03-28 12:41:06,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 48.04/21.17 [2019-03-28 12:41:06,336 INFO L87 Difference]: Start difference. First operand 84 states and 174 transitions. Second operand 6 states. 48.04/21.17 [2019-03-28 12:41:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 48.04/21.17 [2019-03-28 12:41:06,777 INFO L93 Difference]: Finished difference Result 164 states and 343 transitions. 48.04/21.17 [2019-03-28 12:41:06,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 48.04/21.17 [2019-03-28 12:41:06,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 48.04/21.17 [2019-03-28 12:41:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 48.04/21.17 [2019-03-28 12:41:06,778 INFO L225 Difference]: With dead ends: 164 48.04/21.17 [2019-03-28 12:41:06,778 INFO L226 Difference]: Without dead ends: 0 48.04/21.17 [2019-03-28 12:41:06,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 48.04/21.17 [2019-03-28 12:41:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 48.04/21.17 [2019-03-28 12:41:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 48.04/21.17 [2019-03-28 12:41:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 48.04/21.17 [2019-03-28 12:41:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 48.04/21.17 [2019-03-28 12:41:06,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 48.04/21.17 [2019-03-28 12:41:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. 48.04/21.17 [2019-03-28 12:41:06,781 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 48.04/21.17 [2019-03-28 12:41:06,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 48.04/21.17 [2019-03-28 12:41:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 48.04/21.17 [2019-03-28 12:41:06,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 48.04/21.17 [2019-03-28 12:41:06,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 48.04/21.17 [2019-03-28 12:41:06,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 48.04/21.17 [2019-03-28 12:41:06,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 48.04/21.17 [2019-03-28 12:41:06,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 48.04/21.17 [2019-03-28 12:41:07,064 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr57REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr53REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 41) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr65REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr61REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr41REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,066 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,066 INFO L448 ceAbstractionStarter]: For program point L44-1(line 44) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr49REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr45REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr89REQUIRES_VIOLATION(line 67) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr85REQUIRES_VIOLATION(line 67) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,067 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 38 70) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr73REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,068 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr69REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,068 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,068 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,068 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,068 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr81REQUIRES_VIOLATION(line 63) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,068 INFO L448 ceAbstractionStarter]: For program point L12-4(line 12) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,068 INFO L448 ceAbstractionStarter]: For program point L12-6(line 12) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,068 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,069 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr77REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,069 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr58REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,069 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,069 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 33) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,069 INFO L448 ceAbstractionStarter]: For program point L29-2(lines 29 33) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,069 INFO L448 ceAbstractionStarter]: For program point L29-3(lines 29 33) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,069 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr54REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,069 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 41) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr66REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr62REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr42REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr38REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr50REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr46REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,070 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,070 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,071 INFO L448 ceAbstractionStarter]: For program point L63-1(line 63) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,071 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,071 INFO L448 ceAbstractionStarter]: For program point L30-2(line 30) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,071 INFO L448 ceAbstractionStarter]: For program point L30-4(line 30) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,071 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr86REQUIRES_VIOLATION(line 67) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,071 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,071 INFO L448 ceAbstractionStarter]: For program point L30-6(line 30) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,071 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 34) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,072 INFO L448 ceAbstractionStarter]: For program point L22-1(lines 22 34) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,072 INFO L448 ceAbstractionStarter]: For program point L22-2(lines 22 34) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,072 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,072 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 22 34) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,073 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,073 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 38 70) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,073 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr74REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,074 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,074 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr70REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,074 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,074 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr82REQUIRES_VIOLATION(line 66) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,074 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,074 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr78REQUIRES_VIOLATION(line 63) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,074 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr59REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,075 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr55REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,075 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,075 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 27) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,075 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 38 70) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,075 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr67REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,075 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 27) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,075 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 23 27) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,075 INFO L448 ceAbstractionStarter]: For program point L23-3(lines 23 27) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,076 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr63REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,076 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,076 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,076 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr43REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,076 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 19) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,076 INFO L448 ceAbstractionStarter]: For program point L15-3(lines 15 19) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,076 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr39REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,076 INFO L448 ceAbstractionStarter]: For program point L7(lines 7 35) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,076 INFO L448 ceAbstractionStarter]: For program point L7-1(lines 7 35) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,077 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr51REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,077 INFO L448 ceAbstractionStarter]: For program point L7-2(lines 7 35) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,077 INFO L448 ceAbstractionStarter]: For program point L7-3(lines 7 35) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,077 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr47REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,077 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,077 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,078 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 7 35) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start_foo_#t~malloc0.base| 0))) (and (= (select .cse0 ULTIMATE.start_main_~x~0.base) 1) (= (select .cse0 ULTIMATE.start_main_~d~0.base) 1) (= ULTIMATE.start_main_~d~0.offset 0) (= (select |#valid| ULTIMATE.start_foo_~y~0.base) 1) (= ULTIMATE.start_foo_~y~0.offset 0) (= 4 (select |#length| ULTIMATE.start_foo_~y~0.base)) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= (select |#length| ULTIMATE.start_main_~d~0.base) 4))) 48.04/21.17 [2019-03-28 12:41:07,078 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,078 INFO L448 ceAbstractionStarter]: For program point L32-2(line 32) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,078 INFO L444 ceAbstractionStarter]: At program point L32-3(lines 7 35) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start_foo_#t~malloc0.base| 0))) (and (= (select .cse0 ULTIMATE.start_main_~x~0.base) 1) (= (select .cse0 ULTIMATE.start_main_~d~0.base) 1) (= ULTIMATE.start_main_~d~0.offset 0) (= (select |#valid| ULTIMATE.start_foo_~y~0.base) 1) (= ULTIMATE.start_foo_~y~0.offset 0) (= 4 (select |#length| ULTIMATE.start_foo_~y~0.base)) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= (select |#length| ULTIMATE.start_main_~d~0.base) 4))) 48.04/21.17 [2019-03-28 12:41:07,078 INFO L448 ceAbstractionStarter]: For program point L32-4(line 32) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,079 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,079 INFO L444 ceAbstractionStarter]: At program point L32-5(lines 7 35) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start_foo_#t~malloc0.base| 0))) (and (= (select .cse0 ULTIMATE.start_main_~x~0.base) 1) (= (select .cse0 ULTIMATE.start_main_~d~0.base) 1) (= ULTIMATE.start_main_~d~0.offset 0) (= (select |#valid| ULTIMATE.start_foo_~y~0.base) 1) (= ULTIMATE.start_foo_~y~0.offset 0) (= 4 (select |#length| ULTIMATE.start_foo_~y~0.base)) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= (select |#length| ULTIMATE.start_main_~d~0.base) 4))) 48.04/21.17 [2019-03-28 12:41:07,079 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr87REQUIRES_VIOLATION(line 67) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,079 INFO L448 ceAbstractionStarter]: For program point L32-6(line 32) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,079 INFO L444 ceAbstractionStarter]: At program point L32-7(lines 7 35) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start_foo_#t~malloc0.base| 0))) (and (= (select .cse0 ULTIMATE.start_main_~x~0.base) 1) (= (select .cse0 ULTIMATE.start_main_~d~0.base) 1) (= ULTIMATE.start_main_~d~0.offset 0) (= (select |#valid| ULTIMATE.start_foo_~y~0.base) 1) (= ULTIMATE.start_foo_~y~0.offset 0) (= 4 (select |#length| ULTIMATE.start_foo_~y~0.base)) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= (select |#length| ULTIMATE.start_main_~d~0.base) 4))) 48.04/21.17 [2019-03-28 12:41:07,079 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,080 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,080 INFO L448 ceAbstractionStarter]: For program point L24-2(line 24) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,080 INFO L448 ceAbstractionStarter]: For program point L24-4(line 24) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,080 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,080 INFO L448 ceAbstractionStarter]: For program point L24-6(line 24) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,080 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,080 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,080 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr75REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,080 INFO L448 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,081 INFO L448 ceAbstractionStarter]: For program point L16-4(line 16) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,081 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,081 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr71REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,081 INFO L448 ceAbstractionStarter]: For program point L16-6(line 16) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,081 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,081 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 38 70) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,081 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 20) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,081 INFO L448 ceAbstractionStarter]: For program point L8-1(lines 8 20) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,082 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,082 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr83REQUIRES_VIOLATION(line 66) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,082 INFO L448 ceAbstractionStarter]: For program point L8-2(lines 8 20) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,082 INFO L448 ceAbstractionStarter]: For program point L8-3(lines 8 20) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,082 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,082 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr79REQUIRES_VIOLATION(line 63) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,082 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 38 70) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,083 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr56REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,083 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr52REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,083 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr64REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,083 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 44) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,083 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr60REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,083 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 38 70) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,083 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr40REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,083 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,084 INFO L448 ceAbstractionStarter]: For program point L9(lines 9 13) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,084 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr48REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,084 INFO L448 ceAbstractionStarter]: For program point L9-1(lines 9 13) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,084 INFO L448 ceAbstractionStarter]: For program point L9-2(lines 9 13) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,084 INFO L448 ceAbstractionStarter]: For program point L9-3(lines 9 13) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,084 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr44REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,084 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,084 INFO L448 ceAbstractionStarter]: For program point L67-1(line 67) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,085 INFO L448 ceAbstractionStarter]: For program point L67-2(line 67) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,085 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr88REQUIRES_VIOLATION(line 67) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,085 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,085 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr84REQUIRES_VIOLATION(line 67) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,085 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,085 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,085 INFO L448 ceAbstractionStarter]: For program point L26-2(line 26) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,085 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 26) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,085 INFO L448 ceAbstractionStarter]: For program point L26-4(line 26) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,086 INFO L448 ceAbstractionStarter]: For program point L26-6(line 26) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,086 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,086 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,086 INFO L448 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,086 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr72REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,086 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,086 INFO L448 ceAbstractionStarter]: For program point L18-4(line 18) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,086 INFO L448 ceAbstractionStarter]: For program point L18-6(line 18) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,087 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr68REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,087 INFO L448 ceAbstractionStarter]: For program point L43-1(lines 38 70) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,087 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,087 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,087 INFO L448 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,087 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr80REQUIRES_VIOLATION(line 63) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,087 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,087 INFO L448 ceAbstractionStarter]: For program point L10-4(line 10) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,088 INFO L448 ceAbstractionStarter]: For program point L10-6(line 10) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,088 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr76REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,088 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 48.04/21.17 [2019-03-28 12:41:07,088 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 48.04/21.17 [2019-03-28 12:41:07,100 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,101 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,102 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,108 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,113 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,114 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,114 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,115 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,115 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,115 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,116 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,116 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,117 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,117 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,118 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,118 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.17 [2019-03-28 12:41:07,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:07 BasicIcfg 48.04/21.17 [2019-03-28 12:41:07,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 48.04/21.17 [2019-03-28 12:41:07,121 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 48.04/21.17 [2019-03-28 12:41:07,121 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 48.04/21.17 [2019-03-28 12:41:07,124 INFO L276 PluginConnector]: BuchiAutomizer initialized 48.04/21.17 [2019-03-28 12:41:07,125 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.04/21.17 [2019-03-28 12:41:07,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:41:01" (1/5) ... 48.04/21.17 [2019-03-28 12:41:07,126 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2673c5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:07, skipping insertion in model container 48.04/21.17 [2019-03-28 12:41:07,126 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.04/21.17 [2019-03-28 12:41:07,126 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:41:01" (2/5) ... 48.04/21.17 [2019-03-28 12:41:07,127 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2673c5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:41:07, skipping insertion in model container 48.04/21.17 [2019-03-28 12:41:07,127 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.04/21.17 [2019-03-28 12:41:07,127 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:41:02" (3/5) ... 48.04/21.17 [2019-03-28 12:41:07,127 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2673c5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:07, skipping insertion in model container 48.04/21.17 [2019-03-28 12:41:07,127 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.04/21.17 [2019-03-28 12:41:07,127 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:41:02" (4/5) ... 48.04/21.17 [2019-03-28 12:41:07,128 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2673c5d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:07, skipping insertion in model container 48.04/21.17 [2019-03-28 12:41:07,128 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 48.04/21.17 [2019-03-28 12:41:07,128 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:41:07" (5/5) ... 48.04/21.17 [2019-03-28 12:41:07,130 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 48.04/21.17 [2019-03-28 12:41:07,150 INFO L133 ementStrategyFactory]: Using default assertion order modulation 48.04/21.17 [2019-03-28 12:41:07,150 INFO L374 BuchiCegarLoop]: Interprodecural is true 48.04/21.17 [2019-03-28 12:41:07,150 INFO L375 BuchiCegarLoop]: Hoare is true 48.04/21.17 [2019-03-28 12:41:07,150 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 48.04/21.17 [2019-03-28 12:41:07,150 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 48.04/21.17 [2019-03-28 12:41:07,150 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 48.04/21.17 [2019-03-28 12:41:07,151 INFO L379 BuchiCegarLoop]: Difference is false 48.04/21.17 [2019-03-28 12:41:07,151 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 48.04/21.17 [2019-03-28 12:41:07,151 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 48.04/21.17 [2019-03-28 12:41:07,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states. 48.04/21.17 [2019-03-28 12:41:07,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 48.04/21.17 [2019-03-28 12:41:07,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.04/21.17 [2019-03-28 12:41:07,166 INFO L119 BuchiIsEmpty]: Starting construction of run 48.04/21.17 [2019-03-28 12:41:07,170 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 48.04/21.17 [2019-03-28 12:41:07,170 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 48.04/21.17 [2019-03-28 12:41:07,171 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 48.04/21.17 [2019-03-28 12:41:07,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states. 48.04/21.17 [2019-03-28 12:41:07,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 48.04/21.17 [2019-03-28 12:41:07,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.04/21.17 [2019-03-28 12:41:07,176 INFO L119 BuchiIsEmpty]: Starting construction of run 48.04/21.17 [2019-03-28 12:41:07,177 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 48.04/21.17 [2019-03-28 12:41:07,177 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 48.04/21.17 [2019-03-28 12:41:07,182 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRYtrue [502] 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] 20#L-1true [711] L-1-->L41: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_1|, ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_1|, ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem24, ULTIMATE.start_main_#t~mem23, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_main_#t~mem25] 119#L41true [495] L41-->L41-1: Formula: (and (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~d~0.base_4)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4 1)))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 114#L41-1true [486] L41-1-->L43-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11_5| 0) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11] 22#L43-1true [388] L43-1-->L47-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet13_5| 0) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13] 104#L47-1true [471] L47-1-->L50-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet15_5| 0) InVars {ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|} OutVars{ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15] 81#L50-1true [463] L50-1-->L53-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet17_5| 0) InVars {ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} OutVars{ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17] 61#L53-1true [437] L53-1-->L56-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet19_5| 0) InVars {ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_5|} OutVars{ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet19] 71#L56-1true [455] L56-1-->L66-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet21_5| 0) InVars {ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|} OutVars{ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21] 123#L66-2true 48.04/21.17 [2019-03-28 12:41:07,183 INFO L796 eck$LassoCheckResult]: Loop: 123#L66-2true [982] L66-2-->L67: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_11) (<= (+ v_ULTIMATE.start_main_~x~0.offset_11 4) (select |v_#length_113| v_ULTIMATE.start_main_~x~0.base_14)) (< 0 (select (select |v_#memory_int_96| v_ULTIMATE.start_main_~x~0.base_14) v_ULTIMATE.start_main_~x~0.offset_11)) (= 1 (select |v_#valid_140| v_ULTIMATE.start_main_~x~0.base_14))) InVars {#valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} OutVars{ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_13|, #valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem23] 74#L67true [459] L67-->L67-1: Formula: (and (= (select |v_#valid_106| v_ULTIMATE.start_main_~x~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem24_2| (select (select |v_#memory_int_78| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_96| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_106|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_2|, #valid=|v_#valid_106|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24] 72#L67-1true [456] L67-1-->L67-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_14) (= (select |v_#valid_108| v_ULTIMATE.start_main_~d~0.base_19) 1) (= (select (select |v_#memory_int_79| v_ULTIMATE.start_main_~d~0.base_19) v_ULTIMATE.start_main_~d~0.offset_14) |v_ULTIMATE.start_main_#t~mem25_2|) (<= (+ v_ULTIMATE.start_main_~d~0.offset_14 4) (select |v_#length_98| v_ULTIMATE.start_main_~d~0.base_19))) InVars {#memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem25] 68#L67-2true [980] L67-2-->L66-2: Formula: (and (= 1 (select |v_#valid_137| v_ULTIMATE.start_main_~x~0.base_13)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_111| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (store |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13 (store (select |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem25_6|) |v_ULTIMATE.start_main_#t~mem24_6|))) |v_#memory_int_93|)) InVars {ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_6|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_94|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_6|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_5|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_93|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24, #memory_int, ULTIMATE.start_main_#t~mem25] 123#L66-2true 48.04/21.17 [2019-03-28 12:41:07,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:07,183 INFO L82 PathProgramCache]: Analyzing trace with hash -778614779, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:07,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:07,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:07,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:07,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:07,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:07,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:07,221 INFO L82 PathProgramCache]: Analyzing trace with hash 30634498, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:07,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:07,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:07,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:07,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:07,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:07,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:07,235 INFO L82 PathProgramCache]: Analyzing trace with hash 650057734, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:07,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:07,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:07,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:07,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:07,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:07,443 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 48.04/21.17 [2019-03-28 12:41:07,505 INFO L216 LassoAnalysis]: Preferences: 48.04/21.17 [2019-03-28 12:41:07,507 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.04/21.17 [2019-03-28 12:41:07,507 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.04/21.17 [2019-03-28 12:41:07,507 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.04/21.17 [2019-03-28 12:41:07,507 INFO L127 ssoRankerPreferences]: Use exernal solver: false 48.04/21.17 [2019-03-28 12:41:07,507 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 48.04/21.17 [2019-03-28 12:41:07,507 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.04/21.17 [2019-03-28 12:41:07,508 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.04/21.17 [2019-03-28 12:41:07,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 48.04/21.17 [2019-03-28 12:41:07,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.04/21.17 [2019-03-28 12:41:07,508 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.04/21.17 [2019-03-28 12:41:07,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:07,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:08,046 INFO L300 LassoAnalysis]: Preprocessing complete. 48.04/21.17 [2019-03-28 12:41:08,052 INFO L497 LassoAnalysis]: Using template 'affine'. 48.04/21.17 [2019-03-28 12:41:08,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:08,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:08,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:08,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:08,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:08,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:08,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:08,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:08,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:08,170 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 48.04/21.17 [2019-03-28 12:41:08,180 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 48.04/21.17 [2019-03-28 12:41:08,180 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. 48.04/21.17 [2019-03-28 12:41:08,183 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 48.04/21.17 [2019-03-28 12:41:08,184 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 48.04/21.17 [2019-03-28 12:41:08,185 INFO L518 LassoAnalysis]: Proved termination. 48.04/21.17 [2019-03-28 12:41:08,185 INFO L520 LassoAnalysis]: Termination argument consisting of: 48.04/21.17 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 48.04/21.17 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_1 - 1 >= 0] 48.04/21.17 [2019-03-28 12:41:08,217 INFO L297 tatePredicateManager]: 9 out of 12 supporting invariants were superfluous and have been removed 48.04/21.17 [2019-03-28 12:41:08,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 48.04/21.17 [2019-03-28 12:41:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.17 [2019-03-28 12:41:08,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core 48.04/21.17 [2019-03-28 12:41:08,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.04/21.17 [2019-03-28 12:41:08,360 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 48.04/21.17 [2019-03-28 12:41:08,361 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 48.04/21.17 [2019-03-28 12:41:08,371 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 48.04/21.17 [2019-03-28 12:41:08,372 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 48.04/21.17 [2019-03-28 12:41:08,372 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 48.04/21.17 [2019-03-28 12:41:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.17 [2019-03-28 12:41:08,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core 48.04/21.17 [2019-03-28 12:41:08,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.04/21.17 [2019-03-28 12:41:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.04/21.17 [2019-03-28 12:41:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:08,656 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.04/21.17 [2019-03-28 12:41:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:08,665 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.04/21.17 [2019-03-28 12:41:08,666 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 48.04/21.17 [2019-03-28 12:41:08,673 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 7 loop predicates 48.04/21.17 [2019-03-28 12:41:08,674 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 171 states. Second operand 7 states. 48.04/21.17 [2019-03-28 12:41:12,485 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 171 states.. Second operand 7 states. Result 1550 states and 3049 transitions. Complement of second has 113 states. 48.04/21.17 [2019-03-28 12:41:12,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 37 states 9 stem states 24 non-accepting loop states 4 accepting loop states 48.04/21.17 [2019-03-28 12:41:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 48.04/21.17 [2019-03-28 12:41:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2741 transitions. 48.04/21.17 [2019-03-28 12:41:12,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 2741 transitions. Stem has 9 letters. Loop has 4 letters. 48.04/21.17 [2019-03-28 12:41:12,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.04/21.17 [2019-03-28 12:41:12,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 2741 transitions. Stem has 13 letters. Loop has 4 letters. 48.04/21.17 [2019-03-28 12:41:12,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.04/21.17 [2019-03-28 12:41:12,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 2741 transitions. Stem has 9 letters. Loop has 8 letters. 48.04/21.17 [2019-03-28 12:41:12,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.04/21.17 [2019-03-28 12:41:12,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1550 states and 3049 transitions. 48.04/21.17 [2019-03-28 12:41:12,571 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 48.04/21.17 [2019-03-28 12:41:12,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1550 states to 649 states and 1251 transitions. 48.04/21.17 [2019-03-28 12:41:12,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 633 48.04/21.17 [2019-03-28 12:41:12,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 649 48.04/21.17 [2019-03-28 12:41:12,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 649 states and 1251 transitions. 48.04/21.17 [2019-03-28 12:41:12,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 48.04/21.17 [2019-03-28 12:41:12,587 INFO L706 BuchiCegarLoop]: Abstraction has 649 states and 1251 transitions. 48.04/21.17 [2019-03-28 12:41:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states and 1251 transitions. 48.04/21.17 [2019-03-28 12:41:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 108. 48.04/21.17 [2019-03-28 12:41:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. 48.04/21.17 [2019-03-28 12:41:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 230 transitions. 48.04/21.17 [2019-03-28 12:41:12,597 INFO L729 BuchiCegarLoop]: Abstraction has 108 states and 230 transitions. 48.04/21.17 [2019-03-28 12:41:12,597 INFO L609 BuchiCegarLoop]: Abstraction has 108 states and 230 transitions. 48.04/21.17 [2019-03-28 12:41:12,598 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 48.04/21.17 [2019-03-28 12:41:12,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 230 transitions. 48.04/21.17 [2019-03-28 12:41:12,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 48.04/21.17 [2019-03-28 12:41:12,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.04/21.17 [2019-03-28 12:41:12,599 INFO L119 BuchiIsEmpty]: Starting construction of run 48.04/21.17 [2019-03-28 12:41:12,600 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 48.04/21.17 [2019-03-28 12:41:12,600 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 48.04/21.17 [2019-03-28 12:41:12,600 INFO L794 eck$LassoCheckResult]: Stem: 2089#ULTIMATE.startENTRY [502] 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] 2058#L-1 [710] L-1-->L41: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_1|, ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_1|, ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem24, ULTIMATE.start_main_#t~mem23, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_main_#t~mem25] 2059#L41 [495] L41-->L41-1: Formula: (and (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~d~0.base_4)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4 1)))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 2081#L41-1 [486] L41-1-->L43-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11_5| 0) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11] 2062#L43-1 [388] L43-1-->L47-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet13_5| 0) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13] 2061#L47-1 [471] L47-1-->L50-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet15_5| 0) InVars {ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|} OutVars{ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15] 2067#L50-1 [463] L50-1-->L53-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet17_5| 0) InVars {ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} OutVars{ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17] 2103#L53-1 [437] L53-1-->L56-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet19_5| 0) InVars {ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_5|} OutVars{ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet19] 2104#L56-1 [455] L56-1-->L66-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet21_5| 0) InVars {ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|} OutVars{ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21] 2085#L66-2 48.04/21.17 [2019-03-28 12:41:12,601 INFO L796 eck$LassoCheckResult]: Loop: 2085#L66-2 [982] L66-2-->L67: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_11) (<= (+ v_ULTIMATE.start_main_~x~0.offset_11 4) (select |v_#length_113| v_ULTIMATE.start_main_~x~0.base_14)) (< 0 (select (select |v_#memory_int_96| v_ULTIMATE.start_main_~x~0.base_14) v_ULTIMATE.start_main_~x~0.offset_11)) (= 1 (select |v_#valid_140| v_ULTIMATE.start_main_~x~0.base_14))) InVars {#valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} OutVars{ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_13|, #valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem23] 2088#L67 [459] L67-->L67-1: Formula: (and (= (select |v_#valid_106| v_ULTIMATE.start_main_~x~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem24_2| (select (select |v_#memory_int_78| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_96| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_106|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_2|, #valid=|v_#valid_106|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24] 2110#L67-1 [456] L67-1-->L67-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_14) (= (select |v_#valid_108| v_ULTIMATE.start_main_~d~0.base_19) 1) (= (select (select |v_#memory_int_79| v_ULTIMATE.start_main_~d~0.base_19) v_ULTIMATE.start_main_~d~0.offset_14) |v_ULTIMATE.start_main_#t~mem25_2|) (<= (+ v_ULTIMATE.start_main_~d~0.offset_14 4) (select |v_#length_98| v_ULTIMATE.start_main_~d~0.base_19))) InVars {#memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem25] 2107#L67-2 [980] L67-2-->L66-2: Formula: (and (= 1 (select |v_#valid_137| v_ULTIMATE.start_main_~x~0.base_13)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_111| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (store |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13 (store (select |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem25_6|) |v_ULTIMATE.start_main_#t~mem24_6|))) |v_#memory_int_93|)) InVars {ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_6|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_94|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_6|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_5|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_93|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24, #memory_int, ULTIMATE.start_main_#t~mem25] 2085#L66-2 48.04/21.17 [2019-03-28 12:41:12,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:12,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1773542182, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:12,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:12,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:12,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:12,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:12,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:12,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:12,615 INFO L82 PathProgramCache]: Analyzing trace with hash 30634498, now seen corresponding path program 2 times 48.04/21.17 [2019-03-28 12:41:12,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:12,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:12,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:12,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:12,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:12,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.17 [2019-03-28 12:41:12,625 INFO L82 PathProgramCache]: Analyzing trace with hash 520975015, now seen corresponding path program 1 times 48.04/21.17 [2019-03-28 12:41:12,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.17 [2019-03-28 12:41:12,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.17 [2019-03-28 12:41:12,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:12,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:12,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.17 [2019-03-28 12:41:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.17 [2019-03-28 12:41:12,867 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 48.04/21.17 [2019-03-28 12:41:12,928 INFO L216 LassoAnalysis]: Preferences: 48.04/21.17 [2019-03-28 12:41:12,928 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.04/21.17 [2019-03-28 12:41:12,929 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.04/21.17 [2019-03-28 12:41:12,929 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.04/21.17 [2019-03-28 12:41:12,929 INFO L127 ssoRankerPreferences]: Use exernal solver: false 48.04/21.17 [2019-03-28 12:41:12,929 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 48.04/21.17 [2019-03-28 12:41:12,929 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.04/21.17 [2019-03-28 12:41:12,929 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.04/21.17 [2019-03-28 12:41:12,929 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 48.04/21.17 [2019-03-28 12:41:12,930 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.04/21.17 [2019-03-28 12:41:12,930 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.04/21.17 [2019-03-28 12:41:12,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:12,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:12,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:12,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:12,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:12,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,090 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 48.04/21.17 [2019-03-28 12:41:13,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.17 [2019-03-28 12:41:13,539 INFO L300 LassoAnalysis]: Preprocessing complete. 48.04/21.17 [2019-03-28 12:41:13,539 INFO L497 LassoAnalysis]: Using template 'affine'. 48.04/21.17 [2019-03-28 12:41:13,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:13,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:13,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.17 [2019-03-28 12:41:13,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:13,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:13,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:13,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:13,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:13,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:13,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:13,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:13,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:13,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:13,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:13,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:13,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:13,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:13,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:13,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.17 [2019-03-28 12:41:13,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.17 [2019-03-28 12:41:13,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.17 [2019-03-28 12:41:13,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.17 [2019-03-28 12:41:13,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.17 [2019-03-28 12:41:13,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.17 [2019-03-28 12:41:13,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.17 [2019-03-28 12:41:13,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.17 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.17 Number of strict supporting invariants: 0 48.04/21.17 Number of non-strict supporting invariants: 1 48.04/21.17 Consider only non-deceasing supporting invariants: true 48.04/21.17 Simplify termination arguments: true 48.04/21.17 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.17 [2019-03-28 12:41:13,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:13,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.18 [2019-03-28 12:41:13,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:13,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:13,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:13,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:13,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:13,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:13,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:13,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:13,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.18 [2019-03-28 12:41:13,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:13,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:13,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:13,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:13,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:13,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:13,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:13,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:13,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:13,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:13,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:13,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:13,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:13,568 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 48.04/21.18 [2019-03-28 12:41:13,574 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 48.04/21.18 [2019-03-28 12:41:13,575 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. 48.04/21.18 [2019-03-28 12:41:13,575 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 48.04/21.18 [2019-03-28 12:41:13,576 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 48.04/21.18 [2019-03-28 12:41:13,577 INFO L518 LassoAnalysis]: Proved termination. 48.04/21.18 [2019-03-28 12:41:13,577 INFO L520 LassoAnalysis]: Termination argument consisting of: 48.04/21.18 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 48.04/21.18 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_2 - 1 >= 0] 48.04/21.18 [2019-03-28 12:41:13,606 INFO L297 tatePredicateManager]: 9 out of 12 supporting invariants were superfluous and have been removed 48.04/21.18 [2019-03-28 12:41:13,612 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 48.04/21.18 [2019-03-28 12:41:13,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.18 [2019-03-28 12:41:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.18 [2019-03-28 12:41:13,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core 48.04/21.18 [2019-03-28 12:41:13,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.04/21.18 [2019-03-28 12:41:13,669 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 48.04/21.18 [2019-03-28 12:41:13,669 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 48.04/21.18 [2019-03-28 12:41:13,679 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 48.04/21.18 [2019-03-28 12:41:13,679 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 48.04/21.18 [2019-03-28 12:41:13,680 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 48.04/21.18 [2019-03-28 12:41:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.18 [2019-03-28 12:41:13,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core 48.04/21.18 [2019-03-28 12:41:13,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.04/21.18 [2019-03-28 12:41:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.04/21.18 [2019-03-28 12:41:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:13,983 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.04/21.18 [2019-03-28 12:41:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:13,989 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.04/21.18 [2019-03-28 12:41:13,989 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 48.04/21.18 [2019-03-28 12:41:13,990 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 7 loop predicates 48.04/21.18 [2019-03-28 12:41:13,990 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 108 states and 230 transitions. cyclomatic complexity: 123 Second operand 7 states. 48.04/21.18 [2019-03-28 12:41:15,983 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 108 states and 230 transitions. cyclomatic complexity: 123. Second operand 7 states. Result 686 states and 1295 transitions. Complement of second has 90 states. 48.04/21.18 [2019-03-28 12:41:15,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 33 states 9 stem states 20 non-accepting loop states 4 accepting loop states 48.04/21.18 [2019-03-28 12:41:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 48.04/21.18 [2019-03-28 12:41:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1247 transitions. 48.04/21.18 [2019-03-28 12:41:15,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 1247 transitions. Stem has 9 letters. Loop has 4 letters. 48.04/21.18 [2019-03-28 12:41:15,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.04/21.18 [2019-03-28 12:41:15,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 1247 transitions. Stem has 13 letters. Loop has 4 letters. 48.04/21.18 [2019-03-28 12:41:15,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.04/21.18 [2019-03-28 12:41:15,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 1247 transitions. Stem has 9 letters. Loop has 8 letters. 48.04/21.18 [2019-03-28 12:41:15,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.04/21.18 [2019-03-28 12:41:16,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 686 states and 1295 transitions. 48.04/21.18 [2019-03-28 12:41:16,012 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 48.04/21.18 [2019-03-28 12:41:16,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 686 states to 644 states and 1245 transitions. 48.04/21.18 [2019-03-28 12:41:16,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 632 48.04/21.18 [2019-03-28 12:41:16,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 644 48.04/21.18 [2019-03-28 12:41:16,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 644 states and 1245 transitions. 48.04/21.18 [2019-03-28 12:41:16,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 48.04/21.18 [2019-03-28 12:41:16,020 INFO L706 BuchiCegarLoop]: Abstraction has 644 states and 1245 transitions. 48.04/21.18 [2019-03-28 12:41:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states and 1245 transitions. 48.04/21.18 [2019-03-28 12:41:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 108. 48.04/21.18 [2019-03-28 12:41:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. 48.04/21.18 [2019-03-28 12:41:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 230 transitions. 48.04/21.18 [2019-03-28 12:41:16,026 INFO L729 BuchiCegarLoop]: Abstraction has 108 states and 230 transitions. 48.04/21.18 [2019-03-28 12:41:16,026 INFO L609 BuchiCegarLoop]: Abstraction has 108 states and 230 transitions. 48.04/21.18 [2019-03-28 12:41:16,026 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 48.04/21.18 [2019-03-28 12:41:16,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 230 transitions. 48.04/21.18 [2019-03-28 12:41:16,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 48.04/21.18 [2019-03-28 12:41:16,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.04/21.18 [2019-03-28 12:41:16,028 INFO L119 BuchiIsEmpty]: Starting construction of run 48.04/21.18 [2019-03-28 12:41:16,028 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 48.04/21.18 [2019-03-28 12:41:16,029 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 48.04/21.18 [2019-03-28 12:41:16,029 INFO L794 eck$LassoCheckResult]: Stem: 3160#ULTIMATE.startENTRY [502] 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] 3129#L-1 [709] L-1-->L41: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_1|, ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_1|, ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem24, ULTIMATE.start_main_#t~mem23, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_main_#t~mem25] 3130#L41 [495] L41-->L41-1: Formula: (and (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~d~0.base_4)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4 1)))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 3151#L41-1 [486] L41-1-->L43-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11_5| 0) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11] 3133#L43-1 [388] L43-1-->L47-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet13_5| 0) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13] 3132#L47-1 [471] L47-1-->L50-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet15_5| 0) InVars {ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|} OutVars{ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15] 3136#L50-1 [463] L50-1-->L53-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet17_5| 0) InVars {ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} OutVars{ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17] 3174#L53-1 [437] L53-1-->L56-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet19_5| 0) InVars {ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_5|} OutVars{ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet19] 3175#L56-1 [455] L56-1-->L66-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet21_5| 0) InVars {ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|} OutVars{ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21] 3156#L66-2 48.04/21.18 [2019-03-28 12:41:16,029 INFO L796 eck$LassoCheckResult]: Loop: 3156#L66-2 [982] L66-2-->L67: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_11) (<= (+ v_ULTIMATE.start_main_~x~0.offset_11 4) (select |v_#length_113| v_ULTIMATE.start_main_~x~0.base_14)) (< 0 (select (select |v_#memory_int_96| v_ULTIMATE.start_main_~x~0.base_14) v_ULTIMATE.start_main_~x~0.offset_11)) (= 1 (select |v_#valid_140| v_ULTIMATE.start_main_~x~0.base_14))) InVars {#valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} OutVars{ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_13|, #valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem23] 3161#L67 [459] L67-->L67-1: Formula: (and (= (select |v_#valid_106| v_ULTIMATE.start_main_~x~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem24_2| (select (select |v_#memory_int_78| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_96| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_106|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_2|, #valid=|v_#valid_106|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24] 3182#L67-1 [456] L67-1-->L67-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_14) (= (select |v_#valid_108| v_ULTIMATE.start_main_~d~0.base_19) 1) (= (select (select |v_#memory_int_79| v_ULTIMATE.start_main_~d~0.base_19) v_ULTIMATE.start_main_~d~0.offset_14) |v_ULTIMATE.start_main_#t~mem25_2|) (<= (+ v_ULTIMATE.start_main_~d~0.offset_14 4) (select |v_#length_98| v_ULTIMATE.start_main_~d~0.base_19))) InVars {#memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem25] 3179#L67-2 [980] L67-2-->L66-2: Formula: (and (= 1 (select |v_#valid_137| v_ULTIMATE.start_main_~x~0.base_13)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_111| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (store |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13 (store (select |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem25_6|) |v_ULTIMATE.start_main_#t~mem24_6|))) |v_#memory_int_93|)) InVars {ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_6|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_94|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_6|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_5|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_93|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24, #memory_int, ULTIMATE.start_main_#t~mem25] 3156#L66-2 48.04/21.18 [2019-03-28 12:41:16,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.18 [2019-03-28 12:41:16,030 INFO L82 PathProgramCache]: Analyzing trace with hash 30731847, now seen corresponding path program 1 times 48.04/21.18 [2019-03-28 12:41:16,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.18 [2019-03-28 12:41:16,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.18 [2019-03-28 12:41:16,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:16,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:16,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:16,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.18 [2019-03-28 12:41:16,041 INFO L82 PathProgramCache]: Analyzing trace with hash 30634498, now seen corresponding path program 3 times 48.04/21.18 [2019-03-28 12:41:16,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.18 [2019-03-28 12:41:16,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.18 [2019-03-28 12:41:16,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:16,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:16,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:16,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.18 [2019-03-28 12:41:16,050 INFO L82 PathProgramCache]: Analyzing trace with hash 391892296, now seen corresponding path program 1 times 48.04/21.18 [2019-03-28 12:41:16,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.18 [2019-03-28 12:41:16,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.18 [2019-03-28 12:41:16,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:16,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:16,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:16,241 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 48.04/21.18 [2019-03-28 12:41:16,287 INFO L216 LassoAnalysis]: Preferences: 48.04/21.18 [2019-03-28 12:41:16,288 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 48.04/21.18 [2019-03-28 12:41:16,288 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 48.04/21.18 [2019-03-28 12:41:16,288 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 48.04/21.18 [2019-03-28 12:41:16,288 INFO L127 ssoRankerPreferences]: Use exernal solver: false 48.04/21.18 [2019-03-28 12:41:16,288 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 48.04/21.18 [2019-03-28 12:41:16,288 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 48.04/21.18 [2019-03-28 12:41:16,288 INFO L130 ssoRankerPreferences]: Path of dumped script: 48.04/21.18 [2019-03-28 12:41:16,289 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 48.04/21.18 [2019-03-28 12:41:16,289 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 48.04/21.18 [2019-03-28 12:41:16,289 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 48.04/21.18 [2019-03-28 12:41:16,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 48.04/21.18 [2019-03-28 12:41:16,720 INFO L300 LassoAnalysis]: Preprocessing complete. 48.04/21.18 [2019-03-28 12:41:16,720 INFO L497 LassoAnalysis]: Using template 'affine'. 48.04/21.18 [2019-03-28 12:41:16,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.18 [2019-03-28 12:41:16,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.18 [2019-03-28 12:41:16,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.18 [2019-03-28 12:41:16,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.18 [2019-03-28 12:41:16,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.18 [2019-03-28 12:41:16,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.18 [2019-03-28 12:41:16,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.18 [2019-03-28 12:41:16,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.18 [2019-03-28 12:41:16,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 48.04/21.18 [2019-03-28 12:41:16,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 48.04/21.18 [2019-03-28 12:41:16,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 48.04/21.18 Termination analysis: LINEAR_WITH_GUESSES 48.04/21.18 Number of strict supporting invariants: 0 48.04/21.18 Number of non-strict supporting invariants: 1 48.04/21.18 Consider only non-deceasing supporting invariants: true 48.04/21.18 Simplify termination arguments: true 48.04/21.18 Simplify supporting invariants: trueOverapproximate stem: false 48.04/21.18 [2019-03-28 12:41:16,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. 48.04/21.18 [2019-03-28 12:41:16,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 48.04/21.18 [2019-03-28 12:41:16,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 48.04/21.18 [2019-03-28 12:41:16,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 48.04/21.18 [2019-03-28 12:41:16,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 48.04/21.18 [2019-03-28 12:41:16,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 48.04/21.18 [2019-03-28 12:41:16,798 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 48.04/21.18 [2019-03-28 12:41:16,803 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 48.04/21.18 [2019-03-28 12:41:16,803 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. 48.04/21.18 [2019-03-28 12:41:16,804 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 48.04/21.18 [2019-03-28 12:41:16,804 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 48.04/21.18 [2019-03-28 12:41:16,805 INFO L518 LassoAnalysis]: Proved termination. 48.04/21.18 [2019-03-28 12:41:16,805 INFO L520 LassoAnalysis]: Termination argument consisting of: 48.04/21.18 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 48.04/21.18 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~d~0.base) ULTIMATE.start_main_~d~0.offset)_3 - 1 >= 0] 48.04/21.18 [2019-03-28 12:41:16,834 INFO L297 tatePredicateManager]: 9 out of 12 supporting invariants were superfluous and have been removed 48.04/21.18 [2019-03-28 12:41:16,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 48.04/21.18 [2019-03-28 12:41:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.18 [2019-03-28 12:41:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.18 [2019-03-28 12:41:16,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core 48.04/21.18 [2019-03-28 12:41:16,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.04/21.18 [2019-03-28 12:41:16,884 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 48.04/21.18 [2019-03-28 12:41:16,884 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 48.04/21.18 [2019-03-28 12:41:16,888 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 48.04/21.18 [2019-03-28 12:41:16,889 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 48.04/21.18 [2019-03-28 12:41:16,889 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 48.04/21.18 [2019-03-28 12:41:16,904 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 48.04/21.18 [2019-03-28 12:41:16,904 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 48.04/21.18 [2019-03-28 12:41:16,910 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 48.04/21.18 [2019-03-28 12:41:16,910 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 48.04/21.18 [2019-03-28 12:41:16,911 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 48.04/21.18 [2019-03-28 12:41:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 48.04/21.18 [2019-03-28 12:41:16,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core 48.04/21.18 [2019-03-28 12:41:16,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... 48.04/21.18 [2019-03-28 12:41:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 48.04/21.18 [2019-03-28 12:41:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:17,094 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.04/21.18 [2019-03-28 12:41:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:17,100 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 48.04/21.18 [2019-03-28 12:41:17,100 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 48.04/21.18 [2019-03-28 12:41:17,100 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 7 loop predicates 48.04/21.18 [2019-03-28 12:41:17,100 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 108 states and 230 transitions. cyclomatic complexity: 123 Second operand 7 states. 48.04/21.18 [2019-03-28 12:41:17,696 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 108 states and 230 transitions. cyclomatic complexity: 123. Second operand 7 states. Result 202 states and 400 transitions. Complement of second has 25 states. 48.04/21.18 [2019-03-28 12:41:17,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 3 stem states 10 non-accepting loop states 2 accepting loop states 48.04/21.18 [2019-03-28 12:41:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 48.04/21.18 [2019-03-28 12:41:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 323 transitions. 48.04/21.18 [2019-03-28 12:41:17,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 323 transitions. Stem has 9 letters. Loop has 4 letters. 48.04/21.18 [2019-03-28 12:41:17,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.04/21.18 [2019-03-28 12:41:17,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 323 transitions. Stem has 13 letters. Loop has 4 letters. 48.04/21.18 [2019-03-28 12:41:17,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.04/21.18 [2019-03-28 12:41:17,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 323 transitions. Stem has 9 letters. Loop has 8 letters. 48.04/21.18 [2019-03-28 12:41:17,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. 48.04/21.18 [2019-03-28 12:41:17,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 400 transitions. 48.04/21.18 [2019-03-28 12:41:17,712 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 48.04/21.18 [2019-03-28 12:41:17,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 187 states and 382 transitions. 48.04/21.18 [2019-03-28 12:41:17,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 48.04/21.18 [2019-03-28 12:41:17,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 187 48.04/21.18 [2019-03-28 12:41:17,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 382 transitions. 48.04/21.18 [2019-03-28 12:41:17,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 48.04/21.18 [2019-03-28 12:41:17,715 INFO L706 BuchiCegarLoop]: Abstraction has 187 states and 382 transitions. 48.04/21.18 [2019-03-28 12:41:17,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 382 transitions. 48.04/21.18 [2019-03-28 12:41:17,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 106. 48.04/21.18 [2019-03-28 12:41:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. 48.04/21.18 [2019-03-28 12:41:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 226 transitions. 48.04/21.18 [2019-03-28 12:41:17,719 INFO L729 BuchiCegarLoop]: Abstraction has 106 states and 226 transitions. 48.04/21.18 [2019-03-28 12:41:17,719 INFO L609 BuchiCegarLoop]: Abstraction has 106 states and 226 transitions. 48.04/21.18 [2019-03-28 12:41:17,719 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 48.04/21.18 [2019-03-28 12:41:17,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 226 transitions. 48.04/21.18 [2019-03-28 12:41:17,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 48.04/21.18 [2019-03-28 12:41:17,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 48.04/21.18 [2019-03-28 12:41:17,721 INFO L119 BuchiIsEmpty]: Starting construction of run 48.04/21.18 [2019-03-28 12:41:17,721 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 48.04/21.18 [2019-03-28 12:41:17,721 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 48.04/21.18 [2019-03-28 12:41:17,722 INFO L794 eck$LassoCheckResult]: Stem: 3640#ULTIMATE.startENTRY [502] 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] 3609#L-1 [711] L-1-->L41: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= v_ULTIMATE.start_main_~d~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (= v_ULTIMATE.start_main_~d~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_1|, ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_1|, ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_1, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~ret20=|v_ULTIMATE.start_main_#t~ret20_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_1, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_1|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22, ULTIMATE.start_main_#t~mem24, ULTIMATE.start_main_#t~mem23, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~d~0.offset, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~ret20, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_#t~malloc10.offset, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_~d~0.base, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_main_#t~mem25] 3610#L41 [495] L41-->L41-1: Formula: (and (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~d~0.base_4)) (<= 0 v_ULTIMATE.start_main_~d~0.offset_4) (<= (+ v_ULTIMATE.start_main_~d~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~d~0.base_4)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~d~0.base_4) v_ULTIMATE.start_main_~d~0.offset_4 1)))) InVars {#memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} OutVars{#memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_4, #length=|v_#length_4|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_4, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#memory_int] 3630#L41-1 [486] L41-1-->L43-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11_5| 0) InVars {ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11] 3611#L43-1 [388] L43-1-->L47-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet13_5| 0) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|} OutVars{ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13] 3608#L47-1 [471] L47-1-->L50-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet15_5| 0) InVars {ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|} OutVars{ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15] 3614#L50-1 [463] L50-1-->L53-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet17_5| 0) InVars {ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} OutVars{ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17] 3654#L53-1 [437] L53-1-->L56-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet19_5| 0) InVars {ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_5|} OutVars{ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet19] 3655#L56-1 [765] L56-1-->L63: Formula: (< |v_ULTIMATE.start_main_#t~nondet21_3| 0) InVars {ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_3|} OutVars{ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21] 3657#L63 [532] L63-->L63-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_10) (= (select (select |v_#memory_int_74| v_ULTIMATE.start_main_~d~0.base_13) v_ULTIMATE.start_main_~d~0.offset_10) |v_ULTIMATE.start_main_#t~mem22_2|) (= 1 (select |v_#valid_100| v_ULTIMATE.start_main_~d~0.base_13)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_10 4) (select |v_#length_90| v_ULTIMATE.start_main_~d~0.base_13))) InVars {#memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_13, #length=|v_#length_90|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_10, #valid=|v_#valid_100|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_2|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_10, #valid=|v_#valid_100|, #memory_int=|v_#memory_int_74|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_13, #length=|v_#length_90|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22] 3635#L63-1 [971] L63-1-->L66-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_17) (= (store |v_#memory_int_86| v_ULTIMATE.start_main_~d~0.base_23 (store (select |v_#memory_int_86| v_ULTIMATE.start_main_~d~0.base_23) v_ULTIMATE.start_main_~d~0.offset_17 (+ |v_ULTIMATE.start_main_#t~mem22_6| (- 1)))) |v_#memory_int_85|) (= 1 (select |v_#valid_120| v_ULTIMATE.start_main_~d~0.base_23)) (<= (+ v_ULTIMATE.start_main_~d~0.offset_17 4) (select |v_#length_104| v_ULTIMATE.start_main_~d~0.base_23))) InVars {ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_6|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_17, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_23, #length=|v_#length_104|} OutVars{ULTIMATE.start_main_#t~mem22=|v_ULTIMATE.start_main_#t~mem22_5|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_17, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_85|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_23, #length=|v_#length_104|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22, #memory_int] 3636#L66-2 48.04/21.18 [2019-03-28 12:41:17,722 INFO L796 eck$LassoCheckResult]: Loop: 3636#L66-2 [982] L66-2-->L67: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_11) (<= (+ v_ULTIMATE.start_main_~x~0.offset_11 4) (select |v_#length_113| v_ULTIMATE.start_main_~x~0.base_14)) (< 0 (select (select |v_#memory_int_96| v_ULTIMATE.start_main_~x~0.base_14) v_ULTIMATE.start_main_~x~0.offset_11)) (= 1 (select |v_#valid_140| v_ULTIMATE.start_main_~x~0.base_14))) InVars {#valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} OutVars{ULTIMATE.start_main_#t~mem23=|v_ULTIMATE.start_main_#t~mem23_13|, #valid=|v_#valid_140|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_11, #memory_int=|v_#memory_int_96|, #length=|v_#length_113|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem23] 3639#L67 [459] L67-->L67-1: Formula: (and (= (select |v_#valid_106| v_ULTIMATE.start_main_~x~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem24_2| (select (select |v_#memory_int_78| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_96| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_106|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_2|, #valid=|v_#valid_106|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_78|, #length=|v_#length_96|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24] 3662#L67-1 [456] L67-1-->L67-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~d~0.offset_14) (= (select |v_#valid_108| v_ULTIMATE.start_main_~d~0.base_19) 1) (= (select (select |v_#memory_int_79| v_ULTIMATE.start_main_~d~0.base_19) v_ULTIMATE.start_main_~d~0.offset_14) |v_ULTIMATE.start_main_#t~mem25_2|) (<= (+ v_ULTIMATE.start_main_~d~0.offset_14 4) (select |v_#length_98| v_ULTIMATE.start_main_~d~0.base_19))) InVars {#memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|} OutVars{ULTIMATE.start_main_~d~0.offset=v_ULTIMATE.start_main_~d~0.offset_14, #valid=|v_#valid_108|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~d~0.base=v_ULTIMATE.start_main_~d~0.base_19, #length=|v_#length_98|, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem25] 3660#L67-2 [980] L67-2-->L66-2: Formula: (and (= 1 (select |v_#valid_137| v_ULTIMATE.start_main_~x~0.base_13)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_10 4) (select |v_#length_111| v_ULTIMATE.start_main_~x~0.base_13)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_10) (= (store |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13 (store (select |v_#memory_int_94| v_ULTIMATE.start_main_~x~0.base_13) v_ULTIMATE.start_main_~x~0.offset_10 (+ (* (- 1) |v_ULTIMATE.start_main_#t~mem25_6|) |v_ULTIMATE.start_main_#t~mem24_6|))) |v_#memory_int_93|)) InVars {ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_6|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_94|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_6|} OutVars{ULTIMATE.start_main_#t~mem24=|v_ULTIMATE.start_main_#t~mem24_5|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_93|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_10, #length=|v_#length_111|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_13, ULTIMATE.start_main_#t~mem25=|v_ULTIMATE.start_main_#t~mem25_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem24, #memory_int, ULTIMATE.start_main_#t~mem25] 3636#L66-2 48.04/21.18 [2019-03-28 12:41:17,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.18 [2019-03-28 12:41:17,723 INFO L82 PathProgramCache]: Analyzing trace with hash -924177742, now seen corresponding path program 1 times 48.04/21.18 [2019-03-28 12:41:17,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.18 [2019-03-28 12:41:17,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.18 [2019-03-28 12:41:17,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:17,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:17,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:17,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.18 [2019-03-28 12:41:17,773 INFO L82 PathProgramCache]: Analyzing trace with hash 30634498, now seen corresponding path program 4 times 48.04/21.18 [2019-03-28 12:41:17,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.18 [2019-03-28 12:41:17,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.18 [2019-03-28 12:41:17,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:17,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:17,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:17,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 48.04/21.18 [2019-03-28 12:41:17,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1621697485, now seen corresponding path program 1 times 48.04/21.18 [2019-03-28 12:41:17,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 48.04/21.18 [2019-03-28 12:41:17,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 48.04/21.18 [2019-03-28 12:41:17,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:17,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:17,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 48.04/21.18 [2019-03-28 12:41:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 48.04/21.18 [2019-03-28 12:41:18,029 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 48.04/21.18 [2019-03-28 12:41:18,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:41:18 BasicIcfg 48.04/21.18 [2019-03-28 12:41:18,108 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 48.04/21.18 [2019-03-28 12:41:18,109 INFO L168 Benchmark]: Toolchain (without parser) took 16736.49 ms. Allocated memory was 649.6 MB in the beginning and 1.0 GB in the end (delta: 378.5 MB). Free memory was 558.5 MB in the beginning and 919.2 MB in the end (delta: -360.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 50.3 GB. 48.04/21.18 [2019-03-28 12:41:18,110 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 48.04/21.18 [2019-03-28 12:41:18,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.70 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 558.5 MB in the beginning and 647.0 MB in the end (delta: -88.6 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 48.04/21.18 [2019-03-28 12:41:18,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.16 ms. Allocated memory is still 683.7 MB. Free memory was 647.0 MB in the beginning and 644.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 48.04/21.18 [2019-03-28 12:41:18,111 INFO L168 Benchmark]: Boogie Preprocessor took 31.84 ms. Allocated memory is still 683.7 MB. Free memory was 644.3 MB in the beginning and 643.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 48.04/21.18 [2019-03-28 12:41:18,112 INFO L168 Benchmark]: RCFGBuilder took 675.37 ms. Allocated memory is still 683.7 MB. Free memory was 643.0 MB in the beginning and 585.8 MB in the end (delta: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 50.3 GB. 48.04/21.18 [2019-03-28 12:41:18,112 INFO L168 Benchmark]: BlockEncodingV2 took 199.56 ms. Allocated memory is still 683.7 MB. Free memory was 585.8 MB in the beginning and 554.8 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 50.3 GB. 48.04/21.18 [2019-03-28 12:41:18,113 INFO L168 Benchmark]: TraceAbstraction took 4477.92 ms. Allocated memory was 683.7 MB in the beginning and 771.2 MB in the end (delta: 87.6 MB). Free memory was 553.4 MB in the beginning and 535.2 MB in the end (delta: 18.2 MB). Peak memory consumption was 105.8 MB. Max. memory is 50.3 GB. 48.04/21.18 [2019-03-28 12:41:18,114 INFO L168 Benchmark]: BuchiAutomizer took 10987.44 ms. Allocated memory was 771.2 MB in the beginning and 1.0 GB in the end (delta: 256.9 MB). Free memory was 535.2 MB in the beginning and 919.2 MB in the end (delta: -384.1 MB). There was no memory consumed. Max. memory is 50.3 GB. 48.04/21.18 [2019-03-28 12:41:18,118 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 48.04/21.18 --- Results --- 48.04/21.18 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 48.04/21.18 - StatisticsResult: Initial Icfg 48.04/21.18 187 locations, 222 edges 48.04/21.18 - StatisticsResult: Encoded RCFG 48.04/21.18 171 locations, 340 edges 48.04/21.18 * Results from de.uni_freiburg.informatik.ultimate.core: 48.04/21.18 - StatisticsResult: Toolchain Benchmarks 48.04/21.18 Benchmark results are: 48.04/21.18 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 48.04/21.18 * CACSL2BoogieTranslator took 310.70 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 558.5 MB in the beginning and 647.0 MB in the end (delta: -88.6 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 48.04/21.18 * Boogie Procedure Inliner took 48.16 ms. Allocated memory is still 683.7 MB. Free memory was 647.0 MB in the beginning and 644.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 48.04/21.18 * Boogie Preprocessor took 31.84 ms. Allocated memory is still 683.7 MB. Free memory was 644.3 MB in the beginning and 643.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 48.04/21.18 * RCFGBuilder took 675.37 ms. Allocated memory is still 683.7 MB. Free memory was 643.0 MB in the beginning and 585.8 MB in the end (delta: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 50.3 GB. 48.04/21.18 * BlockEncodingV2 took 199.56 ms. Allocated memory is still 683.7 MB. Free memory was 585.8 MB in the beginning and 554.8 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 50.3 GB. 48.04/21.18 * TraceAbstraction took 4477.92 ms. Allocated memory was 683.7 MB in the beginning and 771.2 MB in the end (delta: 87.6 MB). Free memory was 553.4 MB in the beginning and 535.2 MB in the end (delta: 18.2 MB). Peak memory consumption was 105.8 MB. Max. memory is 50.3 GB. 48.04/21.18 * BuchiAutomizer took 10987.44 ms. Allocated memory was 771.2 MB in the beginning and 1.0 GB in the end (delta: 256.9 MB). Free memory was 535.2 MB in the beginning and 919.2 MB in the end (delta: -384.1 MB). There was no memory consumed. Max. memory is 50.3 GB. 48.04/21.18 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #length 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #memory_int 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #memory_int 48.04/21.18 - GenericResult: Unfinished Backtranslation 48.04/21.18 unknown boogie variable #memory_int 48.04/21.18 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 48.04/21.18 - PositiveResult [Line: 10]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 35]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 16]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 67]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 32]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 35]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 67]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 66]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 12]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 30]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 32]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 63]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 10]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 44]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 26]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 16]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 12]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 24]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 10]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 44]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 12]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 41]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 18]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 67]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 30]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 32]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 16]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 18]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 26]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 30]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 12]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 16]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 24]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 26]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 26]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 30]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 63]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 35]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 24]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 26]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 32]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 35]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 18]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 24]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 41]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 32]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 10]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 12]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 67]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 67]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 10]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 30]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 35]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 66]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 26]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 10]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 12]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 18]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 24]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 44]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 10]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 16]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 18]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 44]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 35]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 12]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 16]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 67]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 24]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 16]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 26]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 12]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 32]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 24]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 18]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 30]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 16]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 10]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 18]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 35]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 32]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 63]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 30]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 24]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 32]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 18]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 63]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 30]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 26]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - PositiveResult [Line: 35]: pointer dereference always succeeds 48.04/21.18 For all program executions holds that pointer dereference always succeeds at this location 48.04/21.18 - AllSpecificationsHoldResult: All specifications hold 48.04/21.18 90 specifications checked. All of them hold 48.04/21.18 - InvariantResult [Line: 7]: Loop Invariant 48.04/21.18 [2019-03-28 12:41:18,135 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,135 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,135 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 Derived loop invariant: (((((((\valid[alloca(sizeof(int)) := 0][x] == 1 && \valid[alloca(sizeof(int)) := 0][d] == 1) && d == 0) && \valid[y] == 1) && y == 0) && 4 == unknown-#length-unknown[y]) && x == 0) && 4 == unknown-#length-unknown[x]) && unknown-#length-unknown[d] == 4 48.04/21.18 - InvariantResult [Line: 7]: Loop Invariant 48.04/21.18 [2019-03-28 12:41:18,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,139 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 Derived loop invariant: (((((((\valid[alloca(sizeof(int)) := 0][x] == 1 && \valid[alloca(sizeof(int)) := 0][d] == 1) && d == 0) && \valid[y] == 1) && y == 0) && 4 == unknown-#length-unknown[y]) && x == 0) && 4 == unknown-#length-unknown[x]) && unknown-#length-unknown[d] == 4 48.04/21.18 - InvariantResult [Line: 7]: Loop Invariant 48.04/21.18 [2019-03-28 12:41:18,140 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,140 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,140 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,141 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,141 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,142 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 Derived loop invariant: (((((((\valid[alloca(sizeof(int)) := 0][x] == 1 && \valid[alloca(sizeof(int)) := 0][d] == 1) && d == 0) && \valid[y] == 1) && y == 0) && 4 == unknown-#length-unknown[y]) && x == 0) && 4 == unknown-#length-unknown[x]) && unknown-#length-unknown[d] == 4 48.04/21.18 - InvariantResult [Line: 7]: Loop Invariant 48.04/21.18 [2019-03-28 12:41:18,142 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,143 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,143 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,144 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,144 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 [2019-03-28 12:41:18,144 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 48.04/21.18 Derived loop invariant: (((((((\valid[alloca(sizeof(int)) := 0][x] == 1 && \valid[alloca(sizeof(int)) := 0][d] == 1) && d == 0) && \valid[y] == 1) && y == 0) && 4 == unknown-#length-unknown[y]) && x == 0) && 4 == unknown-#length-unknown[x]) && unknown-#length-unknown[d] == 4 48.04/21.18 - StatisticsResult: Ultimate Automizer benchmark data 48.04/21.18 CFG has 1 procedures, 171 locations, 90 error locations. SAFE Result, 4.3s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 2270 SDslu, 482 SDs, 0 SdLazy, 2340 SolverSat, 442 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=1, 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, 9 MinimizatonAttempts, 261 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8 NumberOfFragments, 184 HoareAnnotationTreeSize, 4 FomulaSimplifications, 698 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 220 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 4218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 48.04/21.18 - StatisticsResult: Constructed decomposition of program 48.04/21.18 Your program was decomposed into 3 terminating modules (0 trivial, 0 deterministic, 3 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 37 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 33 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 15 locations. The remainder module has 106 locations. 48.04/21.18 - StatisticsResult: Timing statistics 48.04/21.18 BüchiAutomizer plugin needed 10.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 3.3s. Büchi inclusion checks took 4.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1158 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 108 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 271 SDtfs, 9389 SDslu, 2022 SDs, 0 SdLazy, 3988 SolverSat, 774 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital149 mio100 ax100 hnf100 lsp95 ukn79 mio100 lsp42 div100 bol100 ite100 ukn100 eq185 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 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 48.04/21.18 - TerminationAnalysisResult: Nontermination possible 48.04/21.18 Buchi Automizer proved that your program is nonterminating for some inputs 48.04/21.18 - FixpointNonTerminationResult [Line: 66]: Nontermination argument in form of an infinite program execution. 48.04/21.18 Nontermination argument in form of an infinite execution 48.04/21.18 State at position 0 is 48.04/21.18 {NULL=9000} 48.04/21.18 State at position 1 is 48.04/21.18 {NULL=0, \result=0, NULL=9000, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2da65106=-1, d=0, d=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73bd4428=0, x=8999, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2da65106=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69a251cb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70a7c4d3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79c5fcdb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@1855db4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66f4bc84=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@67302825=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48d8f029=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2a6f31c6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3306b19b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@48d8f029=8999, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26d2dd38=0, NULL=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@62561dd6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bf7d04a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@3beebf84=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@665dba6f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@3396f98a=0} 48.04/21.18 - StatisticsResult: NonterminationArgumentStatistics 48.04/21.18 Fixpoint 48.04/21.18 - NonterminatingLassoResult [Line: 38]: Nonterminating execution 48.04/21.18 Found a nonterminating execution for the following lasso shaped sequence of statements. 48.04/21.18 Stem: 48.04/21.18 [L39] int* d = alloca(sizeof(int)); 48.04/21.18 [L40] int* x = alloca(sizeof(int)); 48.04/21.18 [L41] *d = 1 48.04/21.18 [L43] COND FALSE !(__VERIFIER_nondet_int()) 48.04/21.18 [L47] COND FALSE !(__VERIFIER_nondet_int()) 48.04/21.18 [L50] COND FALSE !(__VERIFIER_nondet_int()) 48.04/21.18 [L53] COND FALSE !(__VERIFIER_nondet_int()) 48.04/21.18 [L56] COND FALSE !(__VERIFIER_nondet_int()) 48.04/21.18 [L62] COND TRUE __VERIFIER_nondet_int() 48.04/21.18 [L63] EXPR \read(*d) 48.04/21.18 [L63] *d = *d - 1 48.04/21.18 Loop: 48.04/21.18 [L66] EXPR \read(*x) 48.04/21.18 [L66] COND TRUE *x > 0 48.04/21.18 [L67] EXPR \read(*x) 48.04/21.18 [L67] EXPR \read(*d) 48.04/21.18 [L67] *x = *x - *d 48.04/21.18 End of lasso representation. 48.04/21.18 RESULT: Ultimate proved your program to be incorrect! 48.04/21.18 !SESSION 2019-03-28 12:40:58.113 ----------------------------------------------- 48.04/21.18 eclipse.buildId=unknown 48.04/21.18 java.version=1.8.0_181 48.04/21.18 java.vendor=Oracle Corporation 48.04/21.18 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 48.04/21.18 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 48.04/21.18 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 48.04/21.18 48.04/21.18 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:41:18.379 48.04/21.18 !MESSAGE The workspace will exit with unsaved changes in this session. 48.04/21.18 Received shutdown request... 48.04/21.18 Ultimate: 48.04/21.18 GTK+ Version Check 48.04/21.18 EOF