22.31/10.25 YES 22.31/10.25 22.31/10.25 Ultimate: Cannot open display: 22.31/10.25 This is Ultimate 0.1.24-8dc7c08-m 22.31/10.25 [2019-03-28 12:50:16,011 INFO L170 SettingsManager]: Resetting all preferences to default values... 22.31/10.25 [2019-03-28 12:50:16,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 22.31/10.25 [2019-03-28 12:50:16,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 22.31/10.25 [2019-03-28 12:50:16,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 22.31/10.25 [2019-03-28 12:50:16,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 22.31/10.25 [2019-03-28 12:50:16,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 22.31/10.25 [2019-03-28 12:50:16,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 22.31/10.25 [2019-03-28 12:50:16,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 22.31/10.25 [2019-03-28 12:50:16,031 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 22.31/10.25 [2019-03-28 12:50:16,032 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 22.31/10.25 [2019-03-28 12:50:16,032 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 22.31/10.25 [2019-03-28 12:50:16,033 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 22.31/10.25 [2019-03-28 12:50:16,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 22.31/10.25 [2019-03-28 12:50:16,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 22.31/10.25 [2019-03-28 12:50:16,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 22.31/10.25 [2019-03-28 12:50:16,037 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 22.31/10.25 [2019-03-28 12:50:16,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 22.31/10.25 [2019-03-28 12:50:16,041 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 22.31/10.25 [2019-03-28 12:50:16,042 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 22.31/10.25 [2019-03-28 12:50:16,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 22.31/10.25 [2019-03-28 12:50:16,044 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 22.31/10.25 [2019-03-28 12:50:16,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 22.31/10.25 [2019-03-28 12:50:16,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 22.31/10.25 [2019-03-28 12:50:16,047 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 22.31/10.25 [2019-03-28 12:50:16,048 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 22.31/10.25 [2019-03-28 12:50:16,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 22.31/10.25 [2019-03-28 12:50:16,050 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 22.31/10.25 [2019-03-28 12:50:16,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 22.31/10.25 [2019-03-28 12:50:16,051 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 22.31/10.25 [2019-03-28 12:50:16,051 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 22.31/10.25 [2019-03-28 12:50:16,052 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 22.31/10.25 [2019-03-28 12:50:16,053 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 22.31/10.25 [2019-03-28 12:50:16,053 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 22.31/10.25 [2019-03-28 12:50:16,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 22.31/10.25 [2019-03-28 12:50:16,054 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 22.31/10.25 [2019-03-28 12:50:16,054 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 22.31/10.25 [2019-03-28 12:50:16,055 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 22.31/10.25 [2019-03-28 12:50:16,056 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 22.31/10.25 [2019-03-28 12:50:16,056 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 22.31/10.25 [2019-03-28 12:50:16,073 INFO L110 SettingsManager]: Loading preferences was successful 22.31/10.25 [2019-03-28 12:50:16,073 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 22.31/10.25 [2019-03-28 12:50:16,074 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 22.31/10.25 [2019-03-28 12:50:16,074 INFO L133 SettingsManager]: * Rewrite not-equals=true 22.31/10.25 [2019-03-28 12:50:16,075 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 22.31/10.25 [2019-03-28 12:50:16,075 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 22.31/10.25 [2019-03-28 12:50:16,075 INFO L133 SettingsManager]: * Use SBE=true 22.31/10.25 [2019-03-28 12:50:16,075 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 22.31/10.25 [2019-03-28 12:50:16,075 INFO L133 SettingsManager]: * Use old map elimination=false 22.31/10.25 [2019-03-28 12:50:16,076 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 22.31/10.25 [2019-03-28 12:50:16,076 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 22.31/10.25 [2019-03-28 12:50:16,076 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 22.31/10.25 [2019-03-28 12:50:16,076 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 22.31/10.25 [2019-03-28 12:50:16,076 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 22.31/10.25 [2019-03-28 12:50:16,077 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 22.31/10.25 [2019-03-28 12:50:16,077 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 22.31/10.25 [2019-03-28 12:50:16,077 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 22.31/10.25 [2019-03-28 12:50:16,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE 22.31/10.25 [2019-03-28 12:50:16,078 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 22.31/10.25 [2019-03-28 12:50:16,078 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 22.31/10.25 [2019-03-28 12:50:16,078 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 22.31/10.25 [2019-03-28 12:50:16,078 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 22.31/10.25 [2019-03-28 12:50:16,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 22.31/10.25 [2019-03-28 12:50:16,079 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 22.31/10.25 [2019-03-28 12:50:16,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 22.31/10.25 [2019-03-28 12:50:16,079 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 22.31/10.25 [2019-03-28 12:50:16,079 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 22.31/10.25 [2019-03-28 12:50:16,079 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 22.31/10.25 [2019-03-28 12:50:16,080 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 22.31/10.25 [2019-03-28 12:50:16,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 22.31/10.25 [2019-03-28 12:50:16,121 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 22.31/10.25 [2019-03-28 12:50:16,125 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 22.31/10.25 [2019-03-28 12:50:16,126 INFO L271 PluginConnector]: Initializing CDTParser... 22.31/10.25 [2019-03-28 12:50:16,127 INFO L276 PluginConnector]: CDTParser initialized 22.31/10.25 [2019-03-28 12:50:16,127 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 22.31/10.25 [2019-03-28 12:50:16,189 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/6b7eccc8850d408082b48a340b9ef2c1/FLAGe4e3834ba 22.31/10.25 !SESSION 2019-03-28 12:50:13.629 ----------------------------------------------- 22.31/10.25 eclipse.buildId=unknown 22.31/10.25 java.version=1.8.0_181 22.31/10.25 java.vendor=Oracle Corporation 22.31/10.25 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 22.31/10.25 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 22.31/10.25 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 22.31/10.25 22.31/10.25 !ENTRY org.eclipse.cdt.core 1 0 2019-03-28 12:50:16.467 22.31/10.25 !MESSAGE Indexed 'FLAGe4e3834ba' (0 sources, 0 headers) in 0.006 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) 22.31/10.25 [2019-03-28 12:50:16,549 INFO L307 CDTParser]: Found 1 translation units. 22.31/10.25 [2019-03-28 12:50:16,550 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 22.31/10.25 [2019-03-28 12:50:16,550 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 22.31/10.25 [2019-03-28 12:50:16,557 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/6b7eccc8850d408082b48a340b9ef2c1/FLAGe4e3834ba 22.31/10.25 [2019-03-28 12:50:16,996 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/6b7eccc8850d408082b48a340b9ef2c1 22.31/10.25 [2019-03-28 12:50:17,008 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 22.31/10.25 [2019-03-28 12:50:17,009 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 22.31/10.25 [2019-03-28 12:50:17,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 22.31/10.25 [2019-03-28 12:50:17,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 22.31/10.25 [2019-03-28 12:50:17,014 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 22.31/10.25 [2019-03-28 12:50:17,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:50:16" (1/1) ... 22.31/10.25 [2019-03-28 12:50:17,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@332cb5b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:17, skipping insertion in model container 22.31/10.25 [2019-03-28 12:50:17,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:50:16" (1/1) ... 22.31/10.25 [2019-03-28 12:50:17,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 22.31/10.25 [2019-03-28 12:50:17,043 INFO L176 MainTranslator]: Built tables and reachable declarations 22.31/10.25 [2019-03-28 12:50:17,210 INFO L206 PostProcessor]: Analyzing one entry point: main 22.31/10.25 [2019-03-28 12:50:17,222 INFO L191 MainTranslator]: Completed pre-run 22.31/10.25 [2019-03-28 12:50:17,295 INFO L206 PostProcessor]: Analyzing one entry point: main 22.31/10.25 [2019-03-28 12:50:17,312 INFO L195 MainTranslator]: Completed translation 22.31/10.25 [2019-03-28 12:50:17,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:17 WrapperNode 22.31/10.25 [2019-03-28 12:50:17,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 22.31/10.25 [2019-03-28 12:50:17,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 22.31/10.25 [2019-03-28 12:50:17,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 22.31/10.25 [2019-03-28 12:50:17,314 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 22.31/10.25 [2019-03-28 12:50:17,323 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:50:17" (1/1) ... 22.31/10.25 [2019-03-28 12:50:17,331 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:50:17" (1/1) ... 22.31/10.25 [2019-03-28 12:50:17,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 22.31/10.25 [2019-03-28 12:50:17,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 22.31/10.25 [2019-03-28 12:50:17,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 22.31/10.25 [2019-03-28 12:50:17,353 INFO L276 PluginConnector]: Boogie Preprocessor initialized 22.31/10.25 [2019-03-28 12:50:17,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:17" (1/1) ... 22.31/10.25 [2019-03-28 12:50:17,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:17" (1/1) ... 22.31/10.25 [2019-03-28 12:50:17,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:17" (1/1) ... 22.31/10.25 [2019-03-28 12:50:17,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:17" (1/1) ... 22.31/10.25 [2019-03-28 12:50:17,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:17" (1/1) ... 22.31/10.25 [2019-03-28 12:50:17,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:17" (1/1) ... 22.31/10.25 [2019-03-28 12:50:17,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:17" (1/1) ... 22.31/10.25 [2019-03-28 12:50:17,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 22.31/10.25 [2019-03-28 12:50:17,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 22.31/10.25 [2019-03-28 12:50:17,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... 22.31/10.25 [2019-03-28 12:50:17,376 INFO L276 PluginConnector]: RCFGBuilder initialized 22.31/10.25 [2019-03-28 12:50:17,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:17" (1/1) ... 22.31/10.25 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.31/10.25 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 22.31/10.25 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 22.31/10.25 [2019-03-28 12:50:17,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 22.31/10.25 [2019-03-28 12:50:17,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 22.31/10.25 [2019-03-28 12:50:17,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 22.31/10.25 [2019-03-28 12:50:17,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 22.31/10.25 [2019-03-28 12:50:17,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 22.31/10.25 [2019-03-28 12:50:17,614 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 22.31/10.25 [2019-03-28 12:50:17,614 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 22.31/10.25 [2019-03-28 12:50:17,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:17 BoogieIcfgContainer 22.31/10.25 [2019-03-28 12:50:17,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 22.31/10.25 [2019-03-28 12:50:17,616 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 22.31/10.25 [2019-03-28 12:50:17,616 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 22.31/10.25 [2019-03-28 12:50:17,619 INFO L276 PluginConnector]: BlockEncodingV2 initialized 22.31/10.25 [2019-03-28 12:50:17,620 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:17" (1/1) ... 22.31/10.25 [2019-03-28 12:50:17,636 INFO L313 BlockEncoder]: Initial Icfg 15 locations, 19 edges 22.31/10.25 [2019-03-28 12:50:17,637 INFO L258 BlockEncoder]: Using Remove infeasible edges 22.31/10.25 [2019-03-28 12:50:17,638 INFO L263 BlockEncoder]: Using Maximize final states 22.31/10.25 [2019-03-28 12:50:17,639 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 22.31/10.25 [2019-03-28 12:50:17,639 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 22.31/10.25 [2019-03-28 12:50:17,641 INFO L296 BlockEncoder]: Using Remove sink states 22.31/10.25 [2019-03-28 12:50:17,642 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 22.31/10.25 [2019-03-28 12:50:17,642 INFO L179 BlockEncoder]: Using Rewrite not-equals 22.31/10.25 [2019-03-28 12:50:17,659 INFO L185 BlockEncoder]: Using Use SBE 22.31/10.25 [2019-03-28 12:50:17,679 INFO L200 BlockEncoder]: SBE split 4 edges 22.31/10.25 [2019-03-28 12:50:17,684 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 22.31/10.25 [2019-03-28 12:50:17,685 INFO L71 MaximizeFinalStates]: 0 new accepting states 22.31/10.25 [2019-03-28 12:50:17,703 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding 22.31/10.25 [2019-03-28 12:50:17,706 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states 22.31/10.25 [2019-03-28 12:50:17,707 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 22.31/10.25 [2019-03-28 12:50:17,707 INFO L71 MaximizeFinalStates]: 0 new accepting states 22.31/10.25 [2019-03-28 12:50:17,708 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 22.31/10.25 [2019-03-28 12:50:17,708 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 22.31/10.25 [2019-03-28 12:50:17,708 INFO L313 BlockEncoder]: Encoded RCFG 9 locations, 15 edges 22.31/10.25 [2019-03-28 12:50:17,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:50:17 BasicIcfg 22.31/10.25 [2019-03-28 12:50:17,709 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 22.31/10.25 [2019-03-28 12:50:17,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 22.31/10.25 [2019-03-28 12:50:17,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... 22.31/10.25 [2019-03-28 12:50:17,714 INFO L276 PluginConnector]: TraceAbstraction initialized 22.31/10.25 [2019-03-28 12:50:17,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:50:16" (1/4) ... 22.31/10.25 [2019-03-28 12:50:17,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107d6d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:50:17, skipping insertion in model container 22.31/10.25 [2019-03-28 12:50:17,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:17" (2/4) ... 22.31/10.25 [2019-03-28 12:50:17,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107d6d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:50:17, skipping insertion in model container 22.31/10.25 [2019-03-28 12:50:17,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:17" (3/4) ... 22.31/10.25 [2019-03-28 12:50:17,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107d6d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:50:17, skipping insertion in model container 22.31/10.25 [2019-03-28 12:50:17,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:50:17" (4/4) ... 22.31/10.25 [2019-03-28 12:50:17,718 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 22.31/10.25 [2019-03-28 12:50:17,730 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 22.31/10.25 [2019-03-28 12:50:17,739 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. 22.31/10.25 [2019-03-28 12:50:17,756 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. 22.31/10.25 [2019-03-28 12:50:17,785 INFO L133 ementStrategyFactory]: Using default assertion order modulation 22.31/10.25 [2019-03-28 12:50:17,786 INFO L382 AbstractCegarLoop]: Interprodecural is true 22.31/10.25 [2019-03-28 12:50:17,786 INFO L383 AbstractCegarLoop]: Hoare is true 22.31/10.25 [2019-03-28 12:50:17,787 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 22.31/10.25 [2019-03-28 12:50:17,787 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 22.31/10.25 [2019-03-28 12:50:17,787 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 22.31/10.25 [2019-03-28 12:50:17,787 INFO L387 AbstractCegarLoop]: Difference is false 22.31/10.25 [2019-03-28 12:50:17,787 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 22.31/10.25 [2019-03-28 12:50:17,787 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 22.31/10.25 [2019-03-28 12:50:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. 22.31/10.25 [2019-03-28 12:50:17,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 22.31/10.25 [2019-03-28 12:50:17,808 INFO L394 BasicCegarLoop]: Found error trace 22.31/10.25 [2019-03-28 12:50:17,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 22.31/10.25 [2019-03-28 12:50:17,809 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 22.31/10.25 [2019-03-28 12:50:17,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.25 [2019-03-28 12:50:17,815 INFO L82 PathProgramCache]: Analyzing trace with hash 456233926, now seen corresponding path program 1 times 22.31/10.25 [2019-03-28 12:50:17,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.25 [2019-03-28 12:50:17,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.25 [2019-03-28 12:50:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:17,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.25 [2019-03-28 12:50:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.25 [2019-03-28 12:50:18,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.31/10.25 [2019-03-28 12:50:18,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 22.31/10.25 [2019-03-28 12:50:18,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 22.31/10.25 [2019-03-28 12:50:18,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 22.31/10.25 [2019-03-28 12:50:18,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 22.31/10.25 [2019-03-28 12:50:18,024 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. 22.31/10.25 [2019-03-28 12:50:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.31/10.25 [2019-03-28 12:50:18,097 INFO L93 Difference]: Finished difference Result 9 states and 15 transitions. 22.31/10.25 [2019-03-28 12:50:18,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 22.31/10.25 [2019-03-28 12:50:18,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 22.31/10.25 [2019-03-28 12:50:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 22.31/10.25 [2019-03-28 12:50:18,110 INFO L225 Difference]: With dead ends: 9 22.31/10.25 [2019-03-28 12:50:18,111 INFO L226 Difference]: Without dead ends: 8 22.31/10.25 [2019-03-28 12:50:18,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 22.31/10.25 [2019-03-28 12:50:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. 22.31/10.25 [2019-03-28 12:50:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. 22.31/10.25 [2019-03-28 12:50:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. 22.31/10.25 [2019-03-28 12:50:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. 22.31/10.25 [2019-03-28 12:50:18,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 7 22.31/10.25 [2019-03-28 12:50:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. 22.31/10.25 [2019-03-28 12:50:18,149 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. 22.31/10.25 [2019-03-28 12:50:18,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 22.31/10.25 [2019-03-28 12:50:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. 22.31/10.25 [2019-03-28 12:50:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 22.31/10.25 [2019-03-28 12:50:18,150 INFO L394 BasicCegarLoop]: Found error trace 22.31/10.25 [2019-03-28 12:50:18,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 22.31/10.25 [2019-03-28 12:50:18,151 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 22.31/10.25 [2019-03-28 12:50:18,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.25 [2019-03-28 12:50:18,151 INFO L82 PathProgramCache]: Analyzing trace with hash 456233928, now seen corresponding path program 1 times 22.31/10.25 [2019-03-28 12:50:18,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.25 [2019-03-28 12:50:18,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.25 [2019-03-28 12:50:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.25 [2019-03-28 12:50:18,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.25 [2019-03-28 12:50:18,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.31/10.25 [2019-03-28 12:50:18,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 22.31/10.25 [2019-03-28 12:50:18,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 22.31/10.25 [2019-03-28 12:50:18,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 22.31/10.25 [2019-03-28 12:50:18,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 22.31/10.25 [2019-03-28 12:50:18,194 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 4 states. 22.31/10.25 [2019-03-28 12:50:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.31/10.25 [2019-03-28 12:50:18,232 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. 22.31/10.25 [2019-03-28 12:50:18,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 22.31/10.25 [2019-03-28 12:50:18,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 22.31/10.25 [2019-03-28 12:50:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 22.31/10.25 [2019-03-28 12:50:18,233 INFO L225 Difference]: With dead ends: 13 22.31/10.25 [2019-03-28 12:50:18,234 INFO L226 Difference]: Without dead ends: 12 22.31/10.25 [2019-03-28 12:50:18,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 22.31/10.25 [2019-03-28 12:50:18,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. 22.31/10.25 [2019-03-28 12:50:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. 22.31/10.25 [2019-03-28 12:50:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 22.31/10.25 [2019-03-28 12:50:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. 22.31/10.25 [2019-03-28 12:50:18,238 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 7 22.31/10.25 [2019-03-28 12:50:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. 22.31/10.25 [2019-03-28 12:50:18,239 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 18 transitions. 22.31/10.25 [2019-03-28 12:50:18,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 22.31/10.25 [2019-03-28 12:50:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 18 transitions. 22.31/10.25 [2019-03-28 12:50:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 22.31/10.25 [2019-03-28 12:50:18,240 INFO L394 BasicCegarLoop]: Found error trace 22.31/10.25 [2019-03-28 12:50:18,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 22.31/10.25 [2019-03-28 12:50:18,240 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 22.31/10.25 [2019-03-28 12:50:18,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.25 [2019-03-28 12:50:18,240 INFO L82 PathProgramCache]: Analyzing trace with hash 456233929, now seen corresponding path program 1 times 22.31/10.25 [2019-03-28 12:50:18,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.25 [2019-03-28 12:50:18,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.25 [2019-03-28 12:50:18,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.25 [2019-03-28 12:50:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.25 [2019-03-28 12:50:18,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.31/10.25 [2019-03-28 12:50:18,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 22.31/10.25 [2019-03-28 12:50:18,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 22.31/10.25 [2019-03-28 12:50:18,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 22.31/10.25 [2019-03-28 12:50:18,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 22.31/10.25 [2019-03-28 12:50:18,304 INFO L87 Difference]: Start difference. First operand 11 states and 18 transitions. Second operand 5 states. 22.31/10.25 [2019-03-28 12:50:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.31/10.25 [2019-03-28 12:50:18,371 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. 22.31/10.25 [2019-03-28 12:50:18,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 22.31/10.25 [2019-03-28 12:50:18,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 22.31/10.25 [2019-03-28 12:50:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 22.31/10.25 [2019-03-28 12:50:18,373 INFO L225 Difference]: With dead ends: 12 22.31/10.25 [2019-03-28 12:50:18,373 INFO L226 Difference]: Without dead ends: 11 22.31/10.25 [2019-03-28 12:50:18,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 22.31/10.25 [2019-03-28 12:50:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. 22.31/10.25 [2019-03-28 12:50:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 22.31/10.25 [2019-03-28 12:50:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 22.31/10.25 [2019-03-28 12:50:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. 22.31/10.25 [2019-03-28 12:50:18,377 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 7 22.31/10.25 [2019-03-28 12:50:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. 22.31/10.25 [2019-03-28 12:50:18,377 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. 22.31/10.25 [2019-03-28 12:50:18,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 22.31/10.25 [2019-03-28 12:50:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. 22.31/10.25 [2019-03-28 12:50:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 22.31/10.25 [2019-03-28 12:50:18,378 INFO L394 BasicCegarLoop]: Found error trace 22.31/10.25 [2019-03-28 12:50:18,378 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] 22.31/10.25 [2019-03-28 12:50:18,378 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 22.31/10.25 [2019-03-28 12:50:18,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.25 [2019-03-28 12:50:18,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1906345529, now seen corresponding path program 1 times 22.31/10.25 [2019-03-28 12:50:18,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.25 [2019-03-28 12:50:18,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.25 [2019-03-28 12:50:18,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.25 [2019-03-28 12:50:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.25 [2019-03-28 12:50:18,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 22.31/10.25 [2019-03-28 12:50:18,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 22.31/10.25 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.31/10.25 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 22.31/10.25 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 22.31/10.25 [2019-03-28 12:50:18,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.25 [2019-03-28 12:50:18,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core 22.31/10.25 [2019-03-28 12:50:18,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.31/10.25 [2019-03-28 12:50:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.25 [2019-03-28 12:50:18,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 22.31/10.25 [2019-03-28 12:50:18,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 22.31/10.25 [2019-03-28 12:50:18,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states 22.31/10.25 [2019-03-28 12:50:18,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. 22.31/10.25 [2019-03-28 12:50:18,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 22.31/10.25 [2019-03-28 12:50:18,619 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 10 states. 22.31/10.25 [2019-03-28 12:50:18,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.31/10.25 [2019-03-28 12:50:18,825 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. 22.31/10.25 [2019-03-28 12:50:18,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 22.31/10.25 [2019-03-28 12:50:18,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 22.31/10.25 [2019-03-28 12:50:18,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 22.31/10.25 [2019-03-28 12:50:18,827 INFO L225 Difference]: With dead ends: 23 22.31/10.25 [2019-03-28 12:50:18,827 INFO L226 Difference]: Without dead ends: 19 22.31/10.25 [2019-03-28 12:50:18,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 22.31/10.25 [2019-03-28 12:50:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. 22.31/10.25 [2019-03-28 12:50:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. 22.31/10.25 [2019-03-28 12:50:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 22.31/10.25 [2019-03-28 12:50:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. 22.31/10.25 [2019-03-28 12:50:18,832 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 10 22.31/10.25 [2019-03-28 12:50:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. 22.31/10.25 [2019-03-28 12:50:18,833 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 26 transitions. 22.31/10.25 [2019-03-28 12:50:18,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. 22.31/10.25 [2019-03-28 12:50:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. 22.31/10.25 [2019-03-28 12:50:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 22.31/10.25 [2019-03-28 12:50:18,834 INFO L394 BasicCegarLoop]: Found error trace 22.31/10.25 [2019-03-28 12:50:18,834 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 22.31/10.25 [2019-03-28 12:50:18,834 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 22.31/10.25 [2019-03-28 12:50:18,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.25 [2019-03-28 12:50:18,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1906345497, now seen corresponding path program 1 times 22.31/10.25 [2019-03-28 12:50:18,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.25 [2019-03-28 12:50:18,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.25 [2019-03-28 12:50:18,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.25 [2019-03-28 12:50:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.25 [2019-03-28 12:50:18,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 22.31/10.25 [2019-03-28 12:50:18,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 22.31/10.25 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.31/10.25 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 22.31/10.25 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 22.31/10.25 [2019-03-28 12:50:18,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.25 [2019-03-28 12:50:18,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core 22.31/10.25 [2019-03-28 12:50:18,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.31/10.25 [2019-03-28 12:50:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.25 [2019-03-28 12:50:18,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 22.31/10.25 [2019-03-28 12:50:18,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 22.31/10.25 [2019-03-28 12:50:18,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 22.31/10.25 [2019-03-28 12:50:18,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 22.31/10.25 [2019-03-28 12:50:18,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 22.31/10.25 [2019-03-28 12:50:18,954 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 5 states. 22.31/10.25 [2019-03-28 12:50:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.31/10.25 [2019-03-28 12:50:19,001 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. 22.31/10.25 [2019-03-28 12:50:19,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 22.31/10.25 [2019-03-28 12:50:19,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 22.31/10.25 [2019-03-28 12:50:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 22.31/10.25 [2019-03-28 12:50:19,003 INFO L225 Difference]: With dead ends: 33 22.31/10.25 [2019-03-28 12:50:19,003 INFO L226 Difference]: Without dead ends: 23 22.31/10.25 [2019-03-28 12:50:19,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 22.31/10.25 [2019-03-28 12:50:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 22.31/10.25 [2019-03-28 12:50:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. 22.31/10.25 [2019-03-28 12:50:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 22.31/10.25 [2019-03-28 12:50:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. 22.31/10.25 [2019-03-28 12:50:19,009 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 10 22.31/10.25 [2019-03-28 12:50:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. 22.31/10.25 [2019-03-28 12:50:19,009 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. 22.31/10.25 [2019-03-28 12:50:19,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 22.31/10.25 [2019-03-28 12:50:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. 22.31/10.25 [2019-03-28 12:50:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 22.31/10.25 [2019-03-28 12:50:19,010 INFO L394 BasicCegarLoop]: Found error trace 22.31/10.25 [2019-03-28 12:50:19,010 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] 22.31/10.25 [2019-03-28 12:50:19,010 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 22.31/10.25 [2019-03-28 12:50:19,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.25 [2019-03-28 12:50:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1905421976, now seen corresponding path program 1 times 22.31/10.25 [2019-03-28 12:50:19,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.25 [2019-03-28 12:50:19,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.25 [2019-03-28 12:50:19,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:19,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:19,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.25 [2019-03-28 12:50:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 22.31/10.25 [2019-03-28 12:50:19,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.31/10.25 [2019-03-28 12:50:19,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 22.31/10.25 [2019-03-28 12:50:19,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 22.31/10.25 [2019-03-28 12:50:19,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 22.31/10.25 [2019-03-28 12:50:19,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 22.31/10.25 [2019-03-28 12:50:19,047 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 5 states. 22.31/10.25 [2019-03-28 12:50:19,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.31/10.25 [2019-03-28 12:50:19,092 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. 22.31/10.25 [2019-03-28 12:50:19,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 22.31/10.25 [2019-03-28 12:50:19,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 22.31/10.25 [2019-03-28 12:50:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 22.31/10.25 [2019-03-28 12:50:19,093 INFO L225 Difference]: With dead ends: 26 22.31/10.25 [2019-03-28 12:50:19,093 INFO L226 Difference]: Without dead ends: 11 22.31/10.25 [2019-03-28 12:50:19,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 22.31/10.25 [2019-03-28 12:50:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. 22.31/10.25 [2019-03-28 12:50:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. 22.31/10.25 [2019-03-28 12:50:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 22.31/10.25 [2019-03-28 12:50:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. 22.31/10.25 [2019-03-28 12:50:19,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 10 22.31/10.25 [2019-03-28 12:50:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. 22.31/10.25 [2019-03-28 12:50:19,097 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. 22.31/10.25 [2019-03-28 12:50:19,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 22.31/10.25 [2019-03-28 12:50:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. 22.31/10.25 [2019-03-28 12:50:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 22.31/10.25 [2019-03-28 12:50:19,098 INFO L394 BasicCegarLoop]: Found error trace 22.31/10.25 [2019-03-28 12:50:19,098 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] 22.31/10.25 [2019-03-28 12:50:19,098 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 22.31/10.25 [2019-03-28 12:50:19,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.25 [2019-03-28 12:50:19,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1409877196, now seen corresponding path program 1 times 22.31/10.25 [2019-03-28 12:50:19,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.25 [2019-03-28 12:50:19,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.25 [2019-03-28 12:50:19,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:19,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:19,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.25 [2019-03-28 12:50:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.25 [2019-03-28 12:50:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.25 [2019-03-28 12:50:19,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 22.31/10.25 [2019-03-28 12:50:19,189 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 22.31/10.25 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.31/10.25 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 22.31/10.25 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 22.31/10.25 [2019-03-28 12:50:19,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.26 [2019-03-28 12:50:19,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 31 conjunts are in the unsatisfiable core 22.31/10.26 [2019-03-28 12:50:19,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.31/10.26 [2019-03-28 12:50:19,266 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 22.31/10.26 [2019-03-28 12:50:19,266 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 22.31/10.26 [2019-03-28 12:50:19,276 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 22.31/10.26 [2019-03-28 12:50:19,277 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 22.31/10.26 [2019-03-28 12:50:19,277 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 22.31/10.26 [2019-03-28 12:50:19,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.26 [2019-03-28 12:50:19,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 22.31/10.26 [2019-03-28 12:50:19,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 22.31/10.26 [2019-03-28 12:50:19,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states 22.31/10.26 [2019-03-28 12:50:19,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. 22.31/10.26 [2019-03-28 12:50:19,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 22.31/10.26 [2019-03-28 12:50:19,395 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 13 states. 22.31/10.26 [2019-03-28 12:50:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.31/10.26 [2019-03-28 12:50:19,528 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:19,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 22.31/10.26 [2019-03-28 12:50:19,529 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 22.31/10.26 [2019-03-28 12:50:19,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 22.31/10.26 [2019-03-28 12:50:19,529 INFO L225 Difference]: With dead ends: 15 22.31/10.26 [2019-03-28 12:50:19,529 INFO L226 Difference]: Without dead ends: 14 22.31/10.26 [2019-03-28 12:50:19,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 22.31/10.26 [2019-03-28 12:50:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 22.31/10.26 [2019-03-28 12:50:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 22.31/10.26 [2019-03-28 12:50:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 22.31/10.26 [2019-03-28 12:50:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. 22.31/10.26 [2019-03-28 12:50:19,533 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 22.31/10.26 [2019-03-28 12:50:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. 22.31/10.26 [2019-03-28 12:50:19,534 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. 22.31/10.26 [2019-03-28 12:50:19,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. 22.31/10.26 [2019-03-28 12:50:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. 22.31/10.26 [2019-03-28 12:50:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 22.31/10.26 [2019-03-28 12:50:19,534 INFO L394 BasicCegarLoop]: Found error trace 22.31/10.26 [2019-03-28 12:50:19,535 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1] 22.31/10.26 [2019-03-28 12:50:19,535 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== 22.31/10.26 [2019-03-28 12:50:19,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:19,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1166190979, now seen corresponding path program 2 times 22.31/10.26 [2019-03-28 12:50:19,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.26 [2019-03-28 12:50:19,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.26 [2019-03-28 12:50:19,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:19,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:19,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.26 [2019-03-28 12:50:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 22.31/10.26 [2019-03-28 12:50:19,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 22.31/10.26 [2019-03-28 12:50:19,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 22.31/10.26 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.31/10.26 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 22.31/10.26 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 22.31/10.26 [2019-03-28 12:50:19,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 22.31/10.26 [2019-03-28 12:50:19,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 22.31/10.26 [2019-03-28 12:50:19,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 22.31/10.26 [2019-03-28 12:50:19,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 39 conjunts are in the unsatisfiable core 22.31/10.26 [2019-03-28 12:50:19,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.31/10.26 [2019-03-28 12:50:19,714 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 22.31/10.26 [2019-03-28 12:50:19,714 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 22.31/10.26 [2019-03-28 12:50:19,719 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 22.31/10.26 [2019-03-28 12:50:19,720 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 22.31/10.26 [2019-03-28 12:50:19,720 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 22.31/10.26 [2019-03-28 12:50:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.26 [2019-03-28 12:50:19,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 22.31/10.26 [2019-03-28 12:50:19,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 22.31/10.26 [2019-03-28 12:50:19,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states 22.31/10.26 [2019-03-28 12:50:19,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. 22.31/10.26 [2019-03-28 12:50:19,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 22.31/10.26 [2019-03-28 12:50:19,894 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 17 states. 22.31/10.26 [2019-03-28 12:50:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.31/10.26 [2019-03-28 12:50:20,114 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. 22.31/10.26 [2019-03-28 12:50:20,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 22.31/10.26 [2019-03-28 12:50:20,114 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 22.31/10.26 [2019-03-28 12:50:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 22.31/10.26 [2019-03-28 12:50:20,114 INFO L225 Difference]: With dead ends: 17 22.31/10.26 [2019-03-28 12:50:20,114 INFO L226 Difference]: Without dead ends: 0 22.31/10.26 [2019-03-28 12:50:20,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 22.31/10.26 [2019-03-28 12:50:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 22.31/10.26 [2019-03-28 12:50:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 22.31/10.26 [2019-03-28 12:50:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 22.31/10.26 [2019-03-28 12:50:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 22.31/10.26 [2019-03-28 12:50:20,116 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 22.31/10.26 [2019-03-28 12:50:20,116 INFO L84 Accepts]: Finished accepts. word is rejected. 22.31/10.26 [2019-03-28 12:50:20,116 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 22.31/10.26 [2019-03-28 12:50:20,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. 22.31/10.26 [2019-03-28 12:50:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 22.31/10.26 [2019-03-28 12:50:20,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 22.31/10.26 [2019-03-28 12:50:20,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 22.31/10.26 [2019-03-28 12:50:20,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 22.31/10.26 [2019-03-28 12:50:20,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 22.31/10.26 [2019-03-28 12:50:20,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 22.31/10.26 [2019-03-28 12:50:20,231 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 17 30) no Hoare annotation was computed. 22.31/10.26 [2019-03-28 12:50:20,231 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. 22.31/10.26 [2019-03-28 12:50:20,232 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 17 30) no Hoare annotation was computed. 22.31/10.26 [2019-03-28 12:50:20,232 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 22.31/10.26 [2019-03-28 12:50:20,232 INFO L448 ceAbstractionStarter]: For program point L13-1(lines 13 14) no Hoare annotation was computed. 22.31/10.26 [2019-03-28 12:50:20,232 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 14) the Hoare annotation is: (let ((.cse2 (<= 1 ULTIMATE.start_cbzero_~p~0.offset)) (.cse3 (<= 0 ULTIMATE.start_cbzero_~length)) (.cse0 (= 1 (select |#valid| ULTIMATE.start_cbzero_~p~0.base))) (.cse1 (<= 1 ULTIMATE.start_main_~length~0)) (.cse4 (select |#length| ULTIMATE.start_cbzero_~p~0.base)) (.cse5 (<= 1 ULTIMATE.start_main_~n~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_cbzero_~length 0) .cse2 (<= ULTIMATE.start_main_~n~0 1) .cse3) (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_cbzero_~length ULTIMATE.start_cbzero_~p~0.offset) .cse4) .cse5 .cse3) (and .cse0 .cse1 (= 0 ULTIMATE.start_cbzero_~p~0.offset) (<= ULTIMATE.start_cbzero_~length .cse4) (<= 1 ULTIMATE.start_cbzero_~length) .cse5))) 22.31/10.26 [2019-03-28 12:50:20,233 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 22.31/10.26 [2019-03-28 12:50:20,242 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.31/10.26 [2019-03-28 12:50:20,243 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.31/10.26 [2019-03-28 12:50:20,250 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.31/10.26 [2019-03-28 12:50:20,250 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.31/10.26 [2019-03-28 12:50:20,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:50:20 BasicIcfg 22.31/10.26 [2019-03-28 12:50:20,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 22.31/10.26 [2019-03-28 12:50:20,253 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 22.31/10.26 [2019-03-28 12:50:20,253 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 22.31/10.26 [2019-03-28 12:50:20,256 INFO L276 PluginConnector]: BuchiAutomizer initialized 22.31/10.26 [2019-03-28 12:50:20,257 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.31/10.26 [2019-03-28 12:50:20,257 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:50:16" (1/5) ... 22.31/10.26 [2019-03-28 12:50:20,258 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1da5aa64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:50:20, skipping insertion in model container 22.31/10.26 [2019-03-28 12:50:20,258 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.31/10.26 [2019-03-28 12:50:20,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:50:17" (2/5) ... 22.31/10.26 [2019-03-28 12:50:20,258 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1da5aa64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:50:20, skipping insertion in model container 22.31/10.26 [2019-03-28 12:50:20,258 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.31/10.26 [2019-03-28 12:50:20,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:50:17" (3/5) ... 22.31/10.26 [2019-03-28 12:50:20,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1da5aa64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:50:20, skipping insertion in model container 22.31/10.26 [2019-03-28 12:50:20,259 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.31/10.26 [2019-03-28 12:50:20,259 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:50:17" (4/5) ... 22.31/10.26 [2019-03-28 12:50:20,259 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1da5aa64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:50:20, skipping insertion in model container 22.31/10.26 [2019-03-28 12:50:20,259 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 22.31/10.26 [2019-03-28 12:50:20,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:50:20" (5/5) ... 22.31/10.26 [2019-03-28 12:50:20,261 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 22.31/10.26 [2019-03-28 12:50:20,282 INFO L133 ementStrategyFactory]: Using default assertion order modulation 22.31/10.26 [2019-03-28 12:50:20,282 INFO L374 BuchiCegarLoop]: Interprodecural is true 22.31/10.26 [2019-03-28 12:50:20,282 INFO L375 BuchiCegarLoop]: Hoare is true 22.31/10.26 [2019-03-28 12:50:20,282 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 22.31/10.26 [2019-03-28 12:50:20,283 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 22.31/10.26 [2019-03-28 12:50:20,283 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 22.31/10.26 [2019-03-28 12:50:20,283 INFO L379 BuchiCegarLoop]: Difference is false 22.31/10.26 [2019-03-28 12:50:20,283 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 22.31/10.26 [2019-03-28 12:50:20,283 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 22.31/10.26 [2019-03-28 12:50:20,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. 22.31/10.26 [2019-03-28 12:50:20,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 22.31/10.26 [2019-03-28 12:50:20,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.31/10.26 [2019-03-28 12:50:20,291 INFO L119 BuchiIsEmpty]: Starting construction of run 22.31/10.26 [2019-03-28 12:50:20,295 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 22.31/10.26 [2019-03-28 12:50:20,295 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 22.31/10.26 [2019-03-28 12:50:20,295 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 22.31/10.26 [2019-03-28 12:50:20,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. 22.31/10.26 [2019-03-28 12:50:20,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 22.31/10.26 [2019-03-28 12:50:20,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.31/10.26 [2019-03-28 12:50:20,296 INFO L119 BuchiIsEmpty]: Starting construction of run 22.31/10.26 [2019-03-28 12:50:20,296 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 22.31/10.26 [2019-03-28 12:50:20,297 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 22.31/10.26 [2019-03-28 12:50:20,302 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [74] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, #valid=|v_#valid_9|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_5|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, #valid, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_~length~0, #NULL.base] 11#L20true [45] L20-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 9#L20-2true [61] L20-2-->L23-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 7#L23-1true [67] L23-1-->L13-3: Formula: (and (= v_ULTIMATE.start_cbzero_~p~0.offset_1 v_ULTIMATE.start_cbzero_~b.offset_1) (< |v_ULTIMATE.start_main_#t~malloc4.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_4|) (= |v_ULTIMATE.start_cbzero_#in~b.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2) (= |v_ULTIMATE.start_cbzero_#in~b.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (= |v_ULTIMATE.start_cbzero_#in~length_1| v_ULTIMATE.start_main_~n~0_8) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_4|) (= v_ULTIMATE.start_cbzero_~length_1 |v_ULTIMATE.start_cbzero_#in~length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc4.base_4|) 0) (= v_ULTIMATE.start_cbzero_~b.base_1 |v_ULTIMATE.start_cbzero_#in~b.base_1|) (>= v_ULTIMATE.start_main_~length~0_8 v_ULTIMATE.start_main_~n~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_4|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc4.base_4| v_ULTIMATE.start_main_~length~0_8)) (= v_ULTIMATE.start_cbzero_~b.offset_1 |v_ULTIMATE.start_cbzero_#in~b.offset_1|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc4.base_4| 1)) (= v_ULTIMATE.start_cbzero_~p~0.base_1 v_ULTIMATE.start_cbzero_~b.base_1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_cbzero_#in~b.offset=|v_ULTIMATE.start_cbzero_#in~b.offset_1|, ULTIMATE.start_cbzero_~b.base=v_ULTIMATE.start_cbzero_~b.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_1|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_2|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_2|, ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_1, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_1, #valid=|v_#valid_5|, ULTIMATE.start_cbzero_~b.offset=v_ULTIMATE.start_cbzero_~b.offset_1, #length=|v_#length_1|, ULTIMATE.start_cbzero_#in~length=|v_ULTIMATE.start_cbzero_#in~length_1|, ULTIMATE.start_cbzero_#in~b.base=|v_ULTIMATE.start_cbzero_#in~b.base_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cbzero_#in~b.offset, ULTIMATE.start_cbzero_~b.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_cbzero_#t~post0, ULTIMATE.start_cbzero_#t~post1.offset, ULTIMATE.start_cbzero_#t~post1.base, ULTIMATE.start_cbzero_~p~0.offset, ULTIMATE.start_cbzero_~p~0.base, ULTIMATE.start_cbzero_~length, #valid, ULTIMATE.start_cbzero_~b.offset, #length, ULTIMATE.start_cbzero_#in~length, ULTIMATE.start_cbzero_#in~b.base] 3#L13-3true 22.31/10.26 [2019-03-28 12:50:20,302 INFO L796 eck$LassoCheckResult]: Loop: 3#L13-3true [48] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_cbzero_#t~post0_2| v_ULTIMATE.start_cbzero_~length_4) (= v_ULTIMATE.start_cbzero_~length_3 (+ |v_ULTIMATE.start_cbzero_#t~post0_2| (- 1)))) InVars {ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_4} OutVars{ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_2|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_3} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~length, ULTIMATE.start_cbzero_#t~post0] 8#L13-1true [68] L13-1-->L14: Formula: (and (= v_ULTIMATE.start_cbzero_~p~0.offset_4 (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_3| 1)) (= |v_ULTIMATE.start_cbzero_#t~post1.offset_3| v_ULTIMATE.start_cbzero_~p~0.offset_5) (= |v_ULTIMATE.start_cbzero_#t~post1.base_3| v_ULTIMATE.start_cbzero_~p~0.base_5) (= v_ULTIMATE.start_cbzero_~p~0.base_4 |v_ULTIMATE.start_cbzero_#t~post1.base_3|) (< 0 |v_ULTIMATE.start_cbzero_#t~post0_6|)) InVars {ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_5, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_5, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_6|} OutVars{ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_4, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_4, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_5|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~p~0.offset, ULTIMATE.start_cbzero_~p~0.base, ULTIMATE.start_cbzero_#t~post0, ULTIMATE.start_cbzero_#t~post1.offset, ULTIMATE.start_cbzero_#t~post1.base] 10#L14true [77] L14-->L13-3: Formula: (and (<= (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 1) (select |v_#length_5| |v_ULTIMATE.start_cbzero_#t~post1.base_8|)) (<= 0 |v_ULTIMATE.start_cbzero_#t~post1.offset_7|) (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8| (store (select |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8|) |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 0))) (= (select |v_#valid_13| |v_ULTIMATE.start_cbzero_#t~post1.base_8|) 1)) InVars {#valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_8|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_7|, #length=|v_#length_5|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_7|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_6|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_cbzero_#t~post1.base, ULTIMATE.start_cbzero_#t~post1.offset] 3#L13-3true 22.31/10.26 [2019-03-28 12:50:20,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:20,303 INFO L82 PathProgramCache]: Analyzing trace with hash 3173258, now seen corresponding path program 1 times 22.31/10.26 [2019-03-28 12:50:20,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.26 [2019-03-28 12:50:20,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.26 [2019-03-28 12:50:20,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:20,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:20,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:20,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:20,334 INFO L82 PathProgramCache]: Analyzing trace with hash 78104, now seen corresponding path program 1 times 22.31/10.26 [2019-03-28 12:50:20,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.26 [2019-03-28 12:50:20,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.26 [2019-03-28 12:50:20,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:20,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:20,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:20,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:20,345 INFO L82 PathProgramCache]: Analyzing trace with hash 45296879, now seen corresponding path program 1 times 22.31/10.26 [2019-03-28 12:50:20,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.26 [2019-03-28 12:50:20,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.26 [2019-03-28 12:50:20,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:20,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:20,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:20,553 INFO L216 LassoAnalysis]: Preferences: 22.31/10.26 [2019-03-28 12:50:20,555 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.31/10.26 [2019-03-28 12:50:20,555 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.31/10.26 [2019-03-28 12:50:20,555 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.31/10.26 [2019-03-28 12:50:20,555 INFO L127 ssoRankerPreferences]: Use exernal solver: false 22.31/10.26 [2019-03-28 12:50:20,555 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 22.31/10.26 [2019-03-28 12:50:20,555 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.31/10.26 [2019-03-28 12:50:20,556 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.31/10.26 [2019-03-28 12:50:20,556 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 22.31/10.26 [2019-03-28 12:50:20,556 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.31/10.26 [2019-03-28 12:50:20,556 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.31/10.26 [2019-03-28 12:50:20,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:20,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:20,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:20,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:20,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:20,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:20,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:20,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:20,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:21,026 INFO L300 LassoAnalysis]: Preprocessing complete. 22.31/10.26 [2019-03-28 12:50:21,031 INFO L497 LassoAnalysis]: Using template 'affine'. 22.31/10.26 [2019-03-28 12:50:21,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.31/10.26 Termination analysis: LINEAR_WITH_GUESSES 22.31/10.26 Number of strict supporting invariants: 0 22.31/10.26 Number of non-strict supporting invariants: 1 22.31/10.26 Consider only non-deceasing supporting invariants: true 22.31/10.26 Simplify termination arguments: true 22.31/10.26 Simplify supporting invariants: trueOverapproximate stem: false 22.31/10.26 [2019-03-28 12:50:21,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.31/10.26 [2019-03-28 12:50:21,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.31/10.26 [2019-03-28 12:50:21,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.31/10.26 [2019-03-28 12:50:21,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.31/10.26 [2019-03-28 12:50:21,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.31/10.26 [2019-03-28 12:50:21,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.31/10.26 [2019-03-28 12:50:21,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.31/10.26 [2019-03-28 12:50:21,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.31/10.26 Termination analysis: LINEAR_WITH_GUESSES 22.31/10.26 Number of strict supporting invariants: 0 22.31/10.26 Number of non-strict supporting invariants: 1 22.31/10.26 Consider only non-deceasing supporting invariants: true 22.31/10.26 Simplify termination arguments: true 22.31/10.26 Simplify supporting invariants: trueOverapproximate stem: false 22.31/10.26 [2019-03-28 12:50:21,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.31/10.26 [2019-03-28 12:50:21,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.31/10.26 [2019-03-28 12:50:21,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.31/10.26 [2019-03-28 12:50:21,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.31/10.26 [2019-03-28 12:50:21,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.31/10.26 [2019-03-28 12:50:21,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.31/10.26 [2019-03-28 12:50:21,098 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 22.31/10.26 [2019-03-28 12:50:21,121 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 22.31/10.26 [2019-03-28 12:50:21,122 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. 22.31/10.26 [2019-03-28 12:50:21,124 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 22.31/10.26 [2019-03-28 12:50:21,126 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 22.31/10.26 [2019-03-28 12:50:21,126 INFO L518 LassoAnalysis]: Proved termination. 22.31/10.26 [2019-03-28 12:50:21,127 INFO L520 LassoAnalysis]: Termination argument consisting of: 22.31/10.26 Ranking function f(ULTIMATE.start_cbzero_~length) = 1*ULTIMATE.start_cbzero_~length 22.31/10.26 Supporting invariants [] 22.31/10.26 [2019-03-28 12:50:21,139 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed 22.31/10.26 [2019-03-28 12:50:21,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.26 [2019-03-28 12:50:21,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core 22.31/10.26 [2019-03-28 12:50:21,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.31/10.26 [2019-03-28 12:50:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.26 [2019-03-28 12:50:21,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core 22.31/10.26 [2019-03-28 12:50:21,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.31/10.26 [2019-03-28 12:50:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.26 [2019-03-28 12:50:21,232 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization 22.31/10.26 [2019-03-28 12:50:21,236 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates 22.31/10.26 [2019-03-28 12:50:21,237 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states. Second operand 4 states. 22.31/10.26 [2019-03-28 12:50:21,335 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states.. Second operand 4 states. Result 28 states and 45 transitions. Complement of second has 8 states. 22.31/10.26 [2019-03-28 12:50:21,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 22.31/10.26 [2019-03-28 12:50:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 22.31/10.26 [2019-03-28 12:50:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. 22.31/10.26 [2019-03-28 12:50:21,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 3 letters. 22.31/10.26 [2019-03-28 12:50:21,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.31/10.26 [2019-03-28 12:50:21,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 7 letters. Loop has 3 letters. 22.31/10.26 [2019-03-28 12:50:21,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.31/10.26 [2019-03-28 12:50:21,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 6 letters. 22.31/10.26 [2019-03-28 12:50:21,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.31/10.26 [2019-03-28 12:50:21,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 45 transitions. 22.31/10.26 [2019-03-28 12:50:21,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 22.31/10.26 [2019-03-28 12:50:21,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 18 states and 25 transitions. 22.31/10.26 [2019-03-28 12:50:21,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 22.31/10.26 [2019-03-28 12:50:21,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 22.31/10.26 [2019-03-28 12:50:21,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. 22.31/10.26 [2019-03-28 12:50:21,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.31/10.26 [2019-03-28 12:50:21,352 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. 22.31/10.26 [2019-03-28 12:50:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. 22.31/10.26 [2019-03-28 12:50:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. 22.31/10.26 [2019-03-28 12:50:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. 22.31/10.26 [2019-03-28 12:50:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. 22.31/10.26 [2019-03-28 12:50:21,355 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. 22.31/10.26 [2019-03-28 12:50:21,355 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. 22.31/10.26 [2019-03-28 12:50:21,355 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 22.31/10.26 [2019-03-28 12:50:21,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. 22.31/10.26 [2019-03-28 12:50:21,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 22.31/10.26 [2019-03-28 12:50:21,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.31/10.26 [2019-03-28 12:50:21,356 INFO L119 BuchiIsEmpty]: Starting construction of run 22.31/10.26 [2019-03-28 12:50:21,356 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 22.31/10.26 [2019-03-28 12:50:21,357 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 22.31/10.26 [2019-03-28 12:50:21,357 INFO L794 eck$LassoCheckResult]: Stem: 108#ULTIMATE.startENTRY [74] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, #valid=|v_#valid_9|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_5|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, #valid, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_~length~0, #NULL.base] 109#L20 [45] L20-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 116#L20-2 [61] L20-2-->L23-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 110#L23-1 [66] L23-1-->L13-3: Formula: (and (= v_ULTIMATE.start_cbzero_~p~0.offset_1 v_ULTIMATE.start_cbzero_~b.offset_1) (< |v_ULTIMATE.start_main_#t~malloc4.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_4|) (< 0 |v_ULTIMATE.start_main_#t~malloc4.base_4|) (= |v_ULTIMATE.start_cbzero_#in~b.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2) (= |v_ULTIMATE.start_cbzero_#in~b.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (= |v_ULTIMATE.start_cbzero_#in~length_1| v_ULTIMATE.start_main_~n~0_8) (= v_ULTIMATE.start_cbzero_~length_1 |v_ULTIMATE.start_cbzero_#in~length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc4.base_4|) 0) (= v_ULTIMATE.start_cbzero_~b.base_1 |v_ULTIMATE.start_cbzero_#in~b.base_1|) (>= v_ULTIMATE.start_main_~length~0_8 v_ULTIMATE.start_main_~n~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_4|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc4.base_4| v_ULTIMATE.start_main_~length~0_8)) (= v_ULTIMATE.start_cbzero_~b.offset_1 |v_ULTIMATE.start_cbzero_#in~b.offset_1|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc4.base_4| 1)) (= v_ULTIMATE.start_cbzero_~p~0.base_1 v_ULTIMATE.start_cbzero_~b.base_1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_cbzero_#in~b.offset=|v_ULTIMATE.start_cbzero_#in~b.offset_1|, ULTIMATE.start_cbzero_~b.base=v_ULTIMATE.start_cbzero_~b.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_1|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_2|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_2|, ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_1, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_1, #valid=|v_#valid_5|, ULTIMATE.start_cbzero_~b.offset=v_ULTIMATE.start_cbzero_~b.offset_1, #length=|v_#length_1|, ULTIMATE.start_cbzero_#in~length=|v_ULTIMATE.start_cbzero_#in~length_1|, ULTIMATE.start_cbzero_#in~b.base=|v_ULTIMATE.start_cbzero_#in~b.base_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cbzero_#in~b.offset, ULTIMATE.start_cbzero_~b.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_cbzero_#t~post0, ULTIMATE.start_cbzero_#t~post1.offset, ULTIMATE.start_cbzero_#t~post1.base, ULTIMATE.start_cbzero_~p~0.offset, ULTIMATE.start_cbzero_~p~0.base, ULTIMATE.start_cbzero_~length, #valid, ULTIMATE.start_cbzero_~b.offset, #length, ULTIMATE.start_cbzero_#in~length, ULTIMATE.start_cbzero_#in~b.base] 111#L13-3 22.31/10.26 [2019-03-28 12:50:21,357 INFO L796 eck$LassoCheckResult]: Loop: 111#L13-3 [48] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_cbzero_#t~post0_2| v_ULTIMATE.start_cbzero_~length_4) (= v_ULTIMATE.start_cbzero_~length_3 (+ |v_ULTIMATE.start_cbzero_#t~post0_2| (- 1)))) InVars {ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_4} OutVars{ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_2|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_3} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~length, ULTIMATE.start_cbzero_#t~post0] 117#L13-1 [68] L13-1-->L14: Formula: (and (= v_ULTIMATE.start_cbzero_~p~0.offset_4 (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_3| 1)) (= |v_ULTIMATE.start_cbzero_#t~post1.offset_3| v_ULTIMATE.start_cbzero_~p~0.offset_5) (= |v_ULTIMATE.start_cbzero_#t~post1.base_3| v_ULTIMATE.start_cbzero_~p~0.base_5) (= v_ULTIMATE.start_cbzero_~p~0.base_4 |v_ULTIMATE.start_cbzero_#t~post1.base_3|) (< 0 |v_ULTIMATE.start_cbzero_#t~post0_6|)) InVars {ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_5, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_5, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_6|} OutVars{ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_4, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_4, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_5|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~p~0.offset, ULTIMATE.start_cbzero_~p~0.base, ULTIMATE.start_cbzero_#t~post0, ULTIMATE.start_cbzero_#t~post1.offset, ULTIMATE.start_cbzero_#t~post1.base] 118#L14 [77] L14-->L13-3: Formula: (and (<= (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 1) (select |v_#length_5| |v_ULTIMATE.start_cbzero_#t~post1.base_8|)) (<= 0 |v_ULTIMATE.start_cbzero_#t~post1.offset_7|) (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8| (store (select |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8|) |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 0))) (= (select |v_#valid_13| |v_ULTIMATE.start_cbzero_#t~post1.base_8|) 1)) InVars {#valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_8|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_7|, #length=|v_#length_5|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_7|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_6|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_cbzero_#t~post1.base, ULTIMATE.start_cbzero_#t~post1.offset] 111#L13-3 22.31/10.26 [2019-03-28 12:50:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash 3173257, now seen corresponding path program 1 times 22.31/10.26 [2019-03-28 12:50:21,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.26 [2019-03-28 12:50:21,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.26 [2019-03-28 12:50:21,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:21,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:21,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:21,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:21,370 INFO L82 PathProgramCache]: Analyzing trace with hash 78104, now seen corresponding path program 2 times 22.31/10.26 [2019-03-28 12:50:21,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.26 [2019-03-28 12:50:21,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.26 [2019-03-28 12:50:21,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:21,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:21,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:21,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:21,378 INFO L82 PathProgramCache]: Analyzing trace with hash 45267088, now seen corresponding path program 1 times 22.31/10.26 [2019-03-28 12:50:21,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.26 [2019-03-28 12:50:21,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.26 [2019-03-28 12:50:21,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:21,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:21,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:21,540 INFO L216 LassoAnalysis]: Preferences: 22.31/10.26 [2019-03-28 12:50:21,541 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 22.31/10.26 [2019-03-28 12:50:21,541 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 22.31/10.26 [2019-03-28 12:50:21,541 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 22.31/10.26 [2019-03-28 12:50:21,541 INFO L127 ssoRankerPreferences]: Use exernal solver: false 22.31/10.26 [2019-03-28 12:50:21,541 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 22.31/10.26 [2019-03-28 12:50:21,541 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 22.31/10.26 [2019-03-28 12:50:21,542 INFO L130 ssoRankerPreferences]: Path of dumped script: 22.31/10.26 [2019-03-28 12:50:21,542 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 22.31/10.26 [2019-03-28 12:50:21,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 22.31/10.26 [2019-03-28 12:50:21,542 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 22.31/10.26 [2019-03-28 12:50:21,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:21,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:21,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:21,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:21,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:21,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:21,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:21,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:21,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 22.31/10.26 [2019-03-28 12:50:22,007 INFO L300 LassoAnalysis]: Preprocessing complete. 22.31/10.26 [2019-03-28 12:50:22,008 INFO L497 LassoAnalysis]: Using template 'affine'. 22.31/10.26 [2019-03-28 12:50:22,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.31/10.26 Termination analysis: LINEAR_WITH_GUESSES 22.31/10.26 Number of strict supporting invariants: 0 22.31/10.26 Number of non-strict supporting invariants: 1 22.31/10.26 Consider only non-deceasing supporting invariants: true 22.31/10.26 Simplify termination arguments: true 22.31/10.26 Simplify supporting invariants: trueOverapproximate stem: false 22.31/10.26 [2019-03-28 12:50:22,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.31/10.26 [2019-03-28 12:50:22,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.31/10.26 [2019-03-28 12:50:22,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.31/10.26 [2019-03-28 12:50:22,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.31/10.26 [2019-03-28 12:50:22,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.31/10.26 [2019-03-28 12:50:22,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.31/10.26 [2019-03-28 12:50:22,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.31/10.26 [2019-03-28 12:50:22,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.31/10.26 [2019-03-28 12:50:22,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.31/10.26 Termination analysis: LINEAR_WITH_GUESSES 22.31/10.26 Number of strict supporting invariants: 0 22.31/10.26 Number of non-strict supporting invariants: 1 22.31/10.26 Consider only non-deceasing supporting invariants: true 22.31/10.26 Simplify termination arguments: true 22.31/10.26 Simplify supporting invariants: trueOverapproximate stem: false 22.31/10.26 [2019-03-28 12:50:22,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.31/10.26 [2019-03-28 12:50:22,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.31/10.26 [2019-03-28 12:50:22,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.31/10.26 [2019-03-28 12:50:22,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.31/10.26 [2019-03-28 12:50:22,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.31/10.26 [2019-03-28 12:50:22,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.31/10.26 [2019-03-28 12:50:22,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.31/10.26 [2019-03-28 12:50:22,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.31/10.26 Termination analysis: LINEAR_WITH_GUESSES 22.31/10.26 Number of strict supporting invariants: 0 22.31/10.26 Number of non-strict supporting invariants: 1 22.31/10.26 Consider only non-deceasing supporting invariants: true 22.31/10.26 Simplify termination arguments: true 22.31/10.26 Simplify supporting invariants: trueOverapproximate stem: false 22.31/10.26 [2019-03-28 12:50:22,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.31/10.26 [2019-03-28 12:50:22,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.31/10.26 [2019-03-28 12:50:22,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.31/10.26 [2019-03-28 12:50:22,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.31/10.26 [2019-03-28 12:50:22,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.31/10.26 [2019-03-28 12:50:22,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.31/10.26 [2019-03-28 12:50:22,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.31/10.26 [2019-03-28 12:50:22,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.31/10.26 [2019-03-28 12:50:22,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.31/10.26 Termination analysis: LINEAR_WITH_GUESSES 22.31/10.26 Number of strict supporting invariants: 0 22.31/10.26 Number of non-strict supporting invariants: 1 22.31/10.26 Consider only non-deceasing supporting invariants: true 22.31/10.26 Simplify termination arguments: true 22.31/10.26 Simplify supporting invariants: trueOverapproximate stem: false 22.31/10.26 [2019-03-28 12:50:22,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.31/10.26 [2019-03-28 12:50:22,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.31/10.26 [2019-03-28 12:50:22,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.31/10.26 [2019-03-28 12:50:22,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.31/10.26 [2019-03-28 12:50:22,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.31/10.26 [2019-03-28 12:50:22,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.31/10.26 [2019-03-28 12:50:22,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.31/10.26 [2019-03-28 12:50:22,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.31/10.26 [2019-03-28 12:50:22,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.31/10.26 Termination analysis: LINEAR_WITH_GUESSES 22.31/10.26 Number of strict supporting invariants: 0 22.31/10.26 Number of non-strict supporting invariants: 1 22.31/10.26 Consider only non-deceasing supporting invariants: true 22.31/10.26 Simplify termination arguments: true 22.31/10.26 Simplify supporting invariants: trueOverapproximate stem: false 22.31/10.26 [2019-03-28 12:50:22,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.31/10.26 [2019-03-28 12:50:22,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.31/10.26 [2019-03-28 12:50:22,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.31/10.26 [2019-03-28 12:50:22,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.31/10.26 [2019-03-28 12:50:22,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.31/10.26 [2019-03-28 12:50:22,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.31/10.26 [2019-03-28 12:50:22,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.31/10.26 [2019-03-28 12:50:22,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.31/10.26 [2019-03-28 12:50:22,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.31/10.26 Termination analysis: LINEAR_WITH_GUESSES 22.31/10.26 Number of strict supporting invariants: 0 22.31/10.26 Number of non-strict supporting invariants: 1 22.31/10.26 Consider only non-deceasing supporting invariants: true 22.31/10.26 Simplify termination arguments: true 22.31/10.26 Simplify supporting invariants: trueOverapproximate stem: false 22.31/10.26 [2019-03-28 12:50:22,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.31/10.26 [2019-03-28 12:50:22,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.31/10.26 [2019-03-28 12:50:22,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.31/10.26 [2019-03-28 12:50:22,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.31/10.26 [2019-03-28 12:50:22,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.31/10.26 [2019-03-28 12:50:22,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.31/10.26 [2019-03-28 12:50:22,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.31/10.26 [2019-03-28 12:50:22,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.31/10.26 [2019-03-28 12:50:22,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.31/10.26 Termination analysis: LINEAR_WITH_GUESSES 22.31/10.26 Number of strict supporting invariants: 0 22.31/10.26 Number of non-strict supporting invariants: 1 22.31/10.26 Consider only non-deceasing supporting invariants: true 22.31/10.26 Simplify termination arguments: true 22.31/10.26 Simplify supporting invariants: trueOverapproximate stem: false 22.31/10.26 [2019-03-28 12:50:22,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.31/10.26 [2019-03-28 12:50:22,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 22.31/10.26 [2019-03-28 12:50:22,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.31/10.26 [2019-03-28 12:50:22,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.31/10.26 [2019-03-28 12:50:22,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.31/10.26 [2019-03-28 12:50:22,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 22.31/10.26 [2019-03-28 12:50:22,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 22.31/10.26 [2019-03-28 12:50:22,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.31/10.26 [2019-03-28 12:50:22,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.31/10.26 Termination analysis: LINEAR_WITH_GUESSES 22.31/10.26 Number of strict supporting invariants: 0 22.31/10.26 Number of non-strict supporting invariants: 1 22.31/10.26 Consider only non-deceasing supporting invariants: true 22.31/10.26 Simplify termination arguments: true 22.31/10.26 Simplify supporting invariants: trueOverapproximate stem: false 22.31/10.26 [2019-03-28 12:50:22,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.31/10.26 [2019-03-28 12:50:22,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.31/10.26 [2019-03-28 12:50:22,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.31/10.26 [2019-03-28 12:50:22,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.31/10.26 [2019-03-28 12:50:22,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.31/10.26 [2019-03-28 12:50:22,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.31/10.26 [2019-03-28 12:50:22,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.31/10.26 [2019-03-28 12:50:22,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.31/10.26 Termination analysis: LINEAR_WITH_GUESSES 22.31/10.26 Number of strict supporting invariants: 0 22.31/10.26 Number of non-strict supporting invariants: 1 22.31/10.26 Consider only non-deceasing supporting invariants: true 22.31/10.26 Simplify termination arguments: true 22.31/10.26 Simplify supporting invariants: trueOverapproximate stem: false 22.31/10.26 [2019-03-28 12:50:22,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.31/10.26 [2019-03-28 12:50:22,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.31/10.26 [2019-03-28 12:50:22,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.31/10.26 [2019-03-28 12:50:22,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.31/10.26 [2019-03-28 12:50:22,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.31/10.26 [2019-03-28 12:50:22,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.31/10.26 [2019-03-28 12:50:22,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 22.31/10.26 [2019-03-28 12:50:22,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 22.31/10.26 Termination analysis: LINEAR_WITH_GUESSES 22.31/10.26 Number of strict supporting invariants: 0 22.31/10.26 Number of non-strict supporting invariants: 1 22.31/10.26 Consider only non-deceasing supporting invariants: true 22.31/10.26 Simplify termination arguments: true 22.31/10.26 Simplify supporting invariants: trueOverapproximate stem: false 22.31/10.26 [2019-03-28 12:50:22,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. 22.31/10.26 [2019-03-28 12:50:22,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 22.31/10.26 [2019-03-28 12:50:22,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 22.31/10.26 [2019-03-28 12:50:22,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 22.31/10.26 [2019-03-28 12:50:22,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 22.31/10.26 [2019-03-28 12:50:22,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 22.31/10.26 [2019-03-28 12:50:22,072 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 22.31/10.26 [2019-03-28 12:50:22,091 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 22.31/10.26 [2019-03-28 12:50:22,091 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 6 variables to zero. 22.31/10.26 [2019-03-28 12:50:22,092 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 22.31/10.26 [2019-03-28 12:50:22,093 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 22.31/10.26 [2019-03-28 12:50:22,093 INFO L518 LassoAnalysis]: Proved termination. 22.31/10.26 [2019-03-28 12:50:22,093 INFO L520 LassoAnalysis]: Termination argument consisting of: 22.31/10.26 Ranking function f(ULTIMATE.start_cbzero_~p~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc4.base)_2) = -1*ULTIMATE.start_cbzero_~p~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc4.base)_2 22.31/10.26 Supporting invariants [] 22.31/10.26 [2019-03-28 12:50:22,104 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed 22.31/10.26 [2019-03-28 12:50:22,107 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.31/10.26 [2019-03-28 12:50:22,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.26 [2019-03-28 12:50:22,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core 22.31/10.26 [2019-03-28 12:50:22,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.31/10.26 [2019-03-28 12:50:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.26 [2019-03-28 12:50:22,151 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core 22.31/10.26 [2019-03-28 12:50:22,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.31/10.26 [2019-03-28 12:50:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.26 [2019-03-28 12:50:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:22,224 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 22.31/10.26 [2019-03-28 12:50:22,224 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 6 predicates after loop cannibalization 22.31/10.26 [2019-03-28 12:50:22,224 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates 22.31/10.26 [2019-03-28 12:50:22,224 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 15 states and 22 transitions. cyclomatic complexity: 10 Second operand 4 states. 22.31/10.26 [2019-03-28 12:50:22,277 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 15 states and 22 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 18 states and 27 transitions. Complement of second has 6 states. 22.31/10.26 [2019-03-28 12:50:22,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states 22.31/10.26 [2019-03-28 12:50:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 22.31/10.26 [2019-03-28 12:50:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. 22.31/10.26 [2019-03-28 12:50:22,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 3 letters. 22.31/10.26 [2019-03-28 12:50:22,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.31/10.26 [2019-03-28 12:50:22,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 7 letters. Loop has 3 letters. 22.31/10.26 [2019-03-28 12:50:22,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.31/10.26 [2019-03-28 12:50:22,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 6 letters. 22.31/10.26 [2019-03-28 12:50:22,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. 22.31/10.26 [2019-03-28 12:50:22,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 27 transitions. 22.31/10.26 [2019-03-28 12:50:22,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 22.31/10.26 [2019-03-28 12:50:22,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 12 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 22.31/10.26 [2019-03-28 12:50:22,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 22.31/10.26 [2019-03-28 12:50:22,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.31/10.26 [2019-03-28 12:50:22,283 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. 22.31/10.26 [2019-03-28 12:50:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 22.31/10.26 [2019-03-28 12:50:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,285 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,285 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,285 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 22.31/10.26 [2019-03-28 12:50:22,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 22.31/10.26 [2019-03-28 12:50:22,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.31/10.26 [2019-03-28 12:50:22,286 INFO L119 BuchiIsEmpty]: Starting construction of run 22.31/10.26 [2019-03-28 12:50:22,287 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 22.31/10.26 [2019-03-28 12:50:22,287 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 22.31/10.26 [2019-03-28 12:50:22,287 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY [74] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, #valid=|v_#valid_9|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_5|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, #valid, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_~length~0, #NULL.base] 208#L20 [45] L20-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 214#L20-2 [61] L20-2-->L23-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 209#L23-1 [67] L23-1-->L13-3: Formula: (and (= v_ULTIMATE.start_cbzero_~p~0.offset_1 v_ULTIMATE.start_cbzero_~b.offset_1) (< |v_ULTIMATE.start_main_#t~malloc4.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_4|) (= |v_ULTIMATE.start_cbzero_#in~b.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2) (= |v_ULTIMATE.start_cbzero_#in~b.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (= |v_ULTIMATE.start_cbzero_#in~length_1| v_ULTIMATE.start_main_~n~0_8) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_4|) (= v_ULTIMATE.start_cbzero_~length_1 |v_ULTIMATE.start_cbzero_#in~length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc4.base_4|) 0) (= v_ULTIMATE.start_cbzero_~b.base_1 |v_ULTIMATE.start_cbzero_#in~b.base_1|) (>= v_ULTIMATE.start_main_~length~0_8 v_ULTIMATE.start_main_~n~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_4|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc4.base_4| v_ULTIMATE.start_main_~length~0_8)) (= v_ULTIMATE.start_cbzero_~b.offset_1 |v_ULTIMATE.start_cbzero_#in~b.offset_1|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc4.base_4| 1)) (= v_ULTIMATE.start_cbzero_~p~0.base_1 v_ULTIMATE.start_cbzero_~b.base_1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_cbzero_#in~b.offset=|v_ULTIMATE.start_cbzero_#in~b.offset_1|, ULTIMATE.start_cbzero_~b.base=v_ULTIMATE.start_cbzero_~b.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_1|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_2|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_2|, ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_1, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_1, #valid=|v_#valid_5|, ULTIMATE.start_cbzero_~b.offset=v_ULTIMATE.start_cbzero_~b.offset_1, #length=|v_#length_1|, ULTIMATE.start_cbzero_#in~length=|v_ULTIMATE.start_cbzero_#in~length_1|, ULTIMATE.start_cbzero_#in~b.base=|v_ULTIMATE.start_cbzero_#in~b.base_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cbzero_#in~b.offset, ULTIMATE.start_cbzero_~b.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_cbzero_#t~post0, ULTIMATE.start_cbzero_#t~post1.offset, ULTIMATE.start_cbzero_#t~post1.base, ULTIMATE.start_cbzero_~p~0.offset, ULTIMATE.start_cbzero_~p~0.base, ULTIMATE.start_cbzero_~length, #valid, ULTIMATE.start_cbzero_~b.offset, #length, ULTIMATE.start_cbzero_#in~length, ULTIMATE.start_cbzero_#in~b.base] 210#L13-3 [48] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_cbzero_#t~post0_2| v_ULTIMATE.start_cbzero_~length_4) (= v_ULTIMATE.start_cbzero_~length_3 (+ |v_ULTIMATE.start_cbzero_#t~post0_2| (- 1)))) InVars {ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_4} OutVars{ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_2|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_3} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~length, ULTIMATE.start_cbzero_#t~post0] 204#L13-1 22.31/10.26 [2019-03-28 12:50:22,287 INFO L796 eck$LassoCheckResult]: Loop: 204#L13-1 [69] L13-1-->L14: Formula: (and (= v_ULTIMATE.start_cbzero_~p~0.offset_4 (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_3| 1)) (= |v_ULTIMATE.start_cbzero_#t~post1.offset_3| v_ULTIMATE.start_cbzero_~p~0.offset_5) (> 0 |v_ULTIMATE.start_cbzero_#t~post0_6|) (= |v_ULTIMATE.start_cbzero_#t~post1.base_3| v_ULTIMATE.start_cbzero_~p~0.base_5) (= v_ULTIMATE.start_cbzero_~p~0.base_4 |v_ULTIMATE.start_cbzero_#t~post1.base_3|)) InVars {ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_5, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_5, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_6|} OutVars{ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_4, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_4, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_5|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~p~0.offset, ULTIMATE.start_cbzero_~p~0.base, ULTIMATE.start_cbzero_#t~post0, ULTIMATE.start_cbzero_#t~post1.offset, ULTIMATE.start_cbzero_#t~post1.base] 211#L14 [77] L14-->L13-3: Formula: (and (<= (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 1) (select |v_#length_5| |v_ULTIMATE.start_cbzero_#t~post1.base_8|)) (<= 0 |v_ULTIMATE.start_cbzero_#t~post1.offset_7|) (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8| (store (select |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8|) |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 0))) (= (select |v_#valid_13| |v_ULTIMATE.start_cbzero_#t~post1.base_8|) 1)) InVars {#valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_8|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_7|, #length=|v_#length_5|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_7|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_6|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_cbzero_#t~post1.base, ULTIMATE.start_cbzero_#t~post1.offset] 203#L13-3 [48] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_cbzero_#t~post0_2| v_ULTIMATE.start_cbzero_~length_4) (= v_ULTIMATE.start_cbzero_~length_3 (+ |v_ULTIMATE.start_cbzero_#t~post0_2| (- 1)))) InVars {ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_4} OutVars{ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_2|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_3} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~length, ULTIMATE.start_cbzero_#t~post0] 204#L13-1 22.31/10.26 [2019-03-28 12:50:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:22,288 INFO L82 PathProgramCache]: Analyzing trace with hash 98371046, now seen corresponding path program 1 times 22.31/10.26 [2019-03-28 12:50:22,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.26 [2019-03-28 12:50:22,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.26 [2019-03-28 12:50:22,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:22,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:22,299 INFO L82 PathProgramCache]: Analyzing trace with hash 98535, now seen corresponding path program 1 times 22.31/10.26 [2019-03-28 12:50:22,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.26 [2019-03-28 12:50:22,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.26 [2019-03-28 12:50:22,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:22,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:22,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1404204258, now seen corresponding path program 1 times 22.31/10.26 [2019-03-28 12:50:22,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.26 [2019-03-28 12:50:22,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.26 [2019-03-28 12:50:22,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.26 [2019-03-28 12:50:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.26 [2019-03-28 12:50:22,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 22.31/10.26 [2019-03-28 12:50:22,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 22.31/10.26 [2019-03-28 12:50:22,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 22.31/10.26 [2019-03-28 12:50:22,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 22.31/10.26 [2019-03-28 12:50:22,389 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 5 states. 22.31/10.26 [2019-03-28 12:50:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.31/10.26 [2019-03-28 12:50:22,423 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. 22.31/10.26 [2019-03-28 12:50:22,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 22.31/10.26 [2019-03-28 12:50:22,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. 22.31/10.26 [2019-03-28 12:50:22,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 22.31/10.26 [2019-03-28 12:50:22,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 22.31/10.26 [2019-03-28 12:50:22,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 22.31/10.26 [2019-03-28 12:50:22,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 22.31/10.26 [2019-03-28 12:50:22,427 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. 22.31/10.26 [2019-03-28 12:50:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 22.31/10.26 [2019-03-28 12:50:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,429 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,429 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,429 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 22.31/10.26 [2019-03-28 12:50:22,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. 22.31/10.26 [2019-03-28 12:50:22,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 22.31/10.26 [2019-03-28 12:50:22,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 22.31/10.26 [2019-03-28 12:50:22,430 INFO L119 BuchiIsEmpty]: Starting construction of run 22.31/10.26 [2019-03-28 12:50:22,431 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 22.31/10.26 [2019-03-28 12:50:22,431 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 22.31/10.26 [2019-03-28 12:50:22,431 INFO L794 eck$LassoCheckResult]: Stem: 247#ULTIMATE.startENTRY [74] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, #valid=|v_#valid_9|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_5|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, #valid, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_~length~0, #NULL.base] 248#L20 [45] L20-->L20-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 253#L20-2 [61] L20-2-->L23-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 249#L23-1 [67] L23-1-->L13-3: Formula: (and (= v_ULTIMATE.start_cbzero_~p~0.offset_1 v_ULTIMATE.start_cbzero_~b.offset_1) (< |v_ULTIMATE.start_main_#t~malloc4.base_4| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc4.base_4|) (= |v_ULTIMATE.start_cbzero_#in~b.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2) (= |v_ULTIMATE.start_cbzero_#in~b.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (= |v_ULTIMATE.start_cbzero_#in~length_1| v_ULTIMATE.start_main_~n~0_8) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_4|) (= v_ULTIMATE.start_cbzero_~length_1 |v_ULTIMATE.start_cbzero_#in~length_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc4.base_4|) 0) (= v_ULTIMATE.start_cbzero_~b.base_1 |v_ULTIMATE.start_cbzero_#in~b.base_1|) (>= v_ULTIMATE.start_main_~length~0_8 v_ULTIMATE.start_main_~n~0_8) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc4.offset_4|) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc4.base_4| v_ULTIMATE.start_main_~length~0_8)) (= v_ULTIMATE.start_cbzero_~b.offset_1 |v_ULTIMATE.start_cbzero_#in~b.offset_1|) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc4.base_4| 1)) (= v_ULTIMATE.start_cbzero_~p~0.base_1 v_ULTIMATE.start_cbzero_~b.base_1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_cbzero_#in~b.offset=|v_ULTIMATE.start_cbzero_#in~b.offset_1|, ULTIMATE.start_cbzero_~b.base=v_ULTIMATE.start_cbzero_~b.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_4|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_1|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_2|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_2|, ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_1, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_1, #valid=|v_#valid_5|, ULTIMATE.start_cbzero_~b.offset=v_ULTIMATE.start_cbzero_~b.offset_1, #length=|v_#length_1|, ULTIMATE.start_cbzero_#in~length=|v_ULTIMATE.start_cbzero_#in~length_1|, ULTIMATE.start_cbzero_#in~b.base=|v_ULTIMATE.start_cbzero_#in~b.base_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cbzero_#in~b.offset, ULTIMATE.start_cbzero_~b.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_cbzero_#t~post0, ULTIMATE.start_cbzero_#t~post1.offset, ULTIMATE.start_cbzero_#t~post1.base, ULTIMATE.start_cbzero_~p~0.offset, ULTIMATE.start_cbzero_~p~0.base, ULTIMATE.start_cbzero_~length, #valid, ULTIMATE.start_cbzero_~b.offset, #length, ULTIMATE.start_cbzero_#in~length, ULTIMATE.start_cbzero_#in~b.base] 243#L13-3 [48] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_cbzero_#t~post0_2| v_ULTIMATE.start_cbzero_~length_4) (= v_ULTIMATE.start_cbzero_~length_3 (+ |v_ULTIMATE.start_cbzero_#t~post0_2| (- 1)))) InVars {ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_4} OutVars{ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_2|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_3} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~length, ULTIMATE.start_cbzero_#t~post0] 244#L13-1 [68] L13-1-->L14: Formula: (and (= v_ULTIMATE.start_cbzero_~p~0.offset_4 (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_3| 1)) (= |v_ULTIMATE.start_cbzero_#t~post1.offset_3| v_ULTIMATE.start_cbzero_~p~0.offset_5) (= |v_ULTIMATE.start_cbzero_#t~post1.base_3| v_ULTIMATE.start_cbzero_~p~0.base_5) (= v_ULTIMATE.start_cbzero_~p~0.base_4 |v_ULTIMATE.start_cbzero_#t~post1.base_3|) (< 0 |v_ULTIMATE.start_cbzero_#t~post0_6|)) InVars {ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_5, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_5, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_6|} OutVars{ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_4, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_4, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_5|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~p~0.offset, ULTIMATE.start_cbzero_~p~0.base, ULTIMATE.start_cbzero_#t~post0, ULTIMATE.start_cbzero_#t~post1.offset, ULTIMATE.start_cbzero_#t~post1.base] 252#L14 [77] L14-->L13-3: Formula: (and (<= (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 1) (select |v_#length_5| |v_ULTIMATE.start_cbzero_#t~post1.base_8|)) (<= 0 |v_ULTIMATE.start_cbzero_#t~post1.offset_7|) (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8| (store (select |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8|) |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 0))) (= (select |v_#valid_13| |v_ULTIMATE.start_cbzero_#t~post1.base_8|) 1)) InVars {#valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_8|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_7|, #length=|v_#length_5|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_7|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_6|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_cbzero_#t~post1.base, ULTIMATE.start_cbzero_#t~post1.offset] 254#L13-3 22.31/10.26 [2019-03-28 12:50:22,432 INFO L796 eck$LassoCheckResult]: Loop: 254#L13-3 [48] L13-3-->L13-1: Formula: (and (= |v_ULTIMATE.start_cbzero_#t~post0_2| v_ULTIMATE.start_cbzero_~length_4) (= v_ULTIMATE.start_cbzero_~length_3 (+ |v_ULTIMATE.start_cbzero_#t~post0_2| (- 1)))) InVars {ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_4} OutVars{ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_2|, ULTIMATE.start_cbzero_~length=v_ULTIMATE.start_cbzero_~length_3} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~length, ULTIMATE.start_cbzero_#t~post0] 250#L13-1 [69] L13-1-->L14: Formula: (and (= v_ULTIMATE.start_cbzero_~p~0.offset_4 (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_3| 1)) (= |v_ULTIMATE.start_cbzero_#t~post1.offset_3| v_ULTIMATE.start_cbzero_~p~0.offset_5) (> 0 |v_ULTIMATE.start_cbzero_#t~post0_6|) (= |v_ULTIMATE.start_cbzero_#t~post1.base_3| v_ULTIMATE.start_cbzero_~p~0.base_5) (= v_ULTIMATE.start_cbzero_~p~0.base_4 |v_ULTIMATE.start_cbzero_#t~post1.base_3|)) InVars {ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_5, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_5, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_6|} OutVars{ULTIMATE.start_cbzero_~p~0.offset=v_ULTIMATE.start_cbzero_~p~0.offset_4, ULTIMATE.start_cbzero_~p~0.base=v_ULTIMATE.start_cbzero_~p~0.base_4, ULTIMATE.start_cbzero_#t~post0=|v_ULTIMATE.start_cbzero_#t~post0_5|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cbzero_~p~0.offset, ULTIMATE.start_cbzero_~p~0.base, ULTIMATE.start_cbzero_#t~post0, ULTIMATE.start_cbzero_#t~post1.offset, ULTIMATE.start_cbzero_#t~post1.base] 251#L14 [77] L14-->L13-3: Formula: (and (<= (+ |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 1) (select |v_#length_5| |v_ULTIMATE.start_cbzero_#t~post1.base_8|)) (<= 0 |v_ULTIMATE.start_cbzero_#t~post1.offset_7|) (= |v_#memory_int_3| (store |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8| (store (select |v_#memory_int_4| |v_ULTIMATE.start_cbzero_#t~post1.base_8|) |v_ULTIMATE.start_cbzero_#t~post1.offset_7| 0))) (= (select |v_#valid_13| |v_ULTIMATE.start_cbzero_#t~post1.base_8|) 1)) InVars {#valid=|v_#valid_13|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_8|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_7|, #length=|v_#length_5|} OutVars{#valid=|v_#valid_13|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cbzero_#t~post1.base=|v_ULTIMATE.start_cbzero_#t~post1.base_7|, ULTIMATE.start_cbzero_#t~post1.offset=|v_ULTIMATE.start_cbzero_#t~post1.offset_6|, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_cbzero_#t~post1.base, ULTIMATE.start_cbzero_#t~post1.offset] 254#L13-3 22.31/10.26 [2019-03-28 12:50:22,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:22,432 INFO L82 PathProgramCache]: Analyzing trace with hash 45296879, now seen corresponding path program 2 times 22.31/10.26 [2019-03-28 12:50:22,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.26 [2019-03-28 12:50:22,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.26 [2019-03-28 12:50:22,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:22,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:22,446 INFO L82 PathProgramCache]: Analyzing trace with hash 78135, now seen corresponding path program 2 times 22.31/10.26 [2019-03-28 12:50:22,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.26 [2019-03-28 12:50:22,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.26 [2019-03-28 12:50:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 22.31/10.26 [2019-03-28 12:50:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 22.31/10.26 [2019-03-28 12:50:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash 819639689, now seen corresponding path program 1 times 22.31/10.26 [2019-03-28 12:50:22,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 22.31/10.26 [2019-03-28 12:50:22,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 22.31/10.26 [2019-03-28 12:50:22,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.26 [2019-03-28 12:50:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.26 [2019-03-28 12:50:22,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 22.31/10.26 [2019-03-28 12:50:22,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 22.31/10.26 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 22.31/10.26 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 22.31/10.26 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 22.31/10.26 [2019-03-28 12:50:22,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 22.31/10.26 [2019-03-28 12:50:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 22.31/10.26 [2019-03-28 12:50:22,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core 22.31/10.26 [2019-03-28 12:50:22,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... 22.31/10.26 [2019-03-28 12:50:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 22.31/10.26 [2019-03-28 12:50:22,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 22.31/10.26 [2019-03-28 12:50:22,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 22.31/10.26 [2019-03-28 12:50:22,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 22.31/10.26 [2019-03-28 12:50:22,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 22.31/10.26 [2019-03-28 12:50:22,620 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 5 states. 22.31/10.26 [2019-03-28 12:50:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 22.31/10.26 [2019-03-28 12:50:22,649 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. 22.31/10.26 [2019-03-28 12:50:22,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 22.31/10.26 [2019-03-28 12:50:22,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. 22.31/10.26 [2019-03-28 12:50:22,652 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 22.31/10.26 [2019-03-28 12:50:22,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. 22.31/10.26 [2019-03-28 12:50:22,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 22.31/10.26 [2019-03-28 12:50:22,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 22.31/10.26 [2019-03-28 12:50:22,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 22.31/10.26 [2019-03-28 12:50:22,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 22.31/10.26 [2019-03-28 12:50:22,653 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 22.31/10.26 [2019-03-28 12:50:22,653 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 22.31/10.26 [2019-03-28 12:50:22,653 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 22.31/10.26 [2019-03-28 12:50:22,653 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 22.31/10.26 [2019-03-28 12:50:22,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 22.31/10.26 [2019-03-28 12:50:22,653 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 22.31/10.26 [2019-03-28 12:50:22,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 22.31/10.26 [2019-03-28 12:50:22,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:50:22 BasicIcfg 22.31/10.26 [2019-03-28 12:50:22,660 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 22.31/10.26 [2019-03-28 12:50:22,660 INFO L168 Benchmark]: Toolchain (without parser) took 5652.33 ms. Allocated memory was 649.6 MB in the beginning and 766.5 MB in the end (delta: 116.9 MB). Free memory was 558.5 MB in the beginning and 548.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 126.5 MB. Max. memory is 50.3 GB. 22.31/10.26 [2019-03-28 12:50:22,661 INFO L168 Benchmark]: CDTParser took 0.20 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. 22.31/10.26 [2019-03-28 12:50:22,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.48 ms. Allocated memory was 649.6 MB in the beginning and 680.5 MB in the end (delta: 30.9 MB). Free memory was 558.5 MB in the beginning and 646.7 MB in the end (delta: -88.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 22.31/10.26 [2019-03-28 12:50:22,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.11 ms. Allocated memory is still 680.5 MB. Free memory was 646.7 MB in the beginning and 643.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 50.3 GB. 22.31/10.26 [2019-03-28 12:50:22,663 INFO L168 Benchmark]: Boogie Preprocessor took 22.82 ms. Allocated memory is still 680.5 MB. Free memory was 643.5 MB in the beginning and 642.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 22.31/10.26 [2019-03-28 12:50:22,664 INFO L168 Benchmark]: RCFGBuilder took 240.10 ms. Allocated memory is still 680.5 MB. Free memory was 642.1 MB in the beginning and 624.0 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 50.3 GB. 22.31/10.26 [2019-03-28 12:50:22,664 INFO L168 Benchmark]: BlockEncodingV2 took 93.17 ms. Allocated memory is still 680.5 MB. Free memory was 624.0 MB in the beginning and 617.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 22.31/10.26 [2019-03-28 12:50:22,665 INFO L168 Benchmark]: TraceAbstraction took 2542.17 ms. Allocated memory was 680.5 MB in the beginning and 749.7 MB in the end (delta: 69.2 MB). Free memory was 617.3 MB in the beginning and 641.1 MB in the end (delta: -23.9 MB). Peak memory consumption was 45.3 MB. Max. memory is 50.3 GB. 22.31/10.26 [2019-03-28 12:50:22,665 INFO L168 Benchmark]: BuchiAutomizer took 2407.18 ms. Allocated memory was 749.7 MB in the beginning and 766.5 MB in the end (delta: 16.8 MB). Free memory was 641.1 MB in the beginning and 548.9 MB in the end (delta: 92.3 MB). Peak memory consumption was 109.0 MB. Max. memory is 50.3 GB. 22.31/10.26 [2019-03-28 12:50:22,669 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 22.31/10.26 --- Results --- 22.31/10.26 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 22.31/10.26 - StatisticsResult: Initial Icfg 22.31/10.26 15 locations, 19 edges 22.31/10.26 - StatisticsResult: Encoded RCFG 22.31/10.26 9 locations, 15 edges 22.31/10.26 * Results from de.uni_freiburg.informatik.ultimate.core: 22.31/10.26 - StatisticsResult: Toolchain Benchmarks 22.31/10.26 Benchmark results are: 22.31/10.26 * CDTParser took 0.20 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. 22.31/10.26 * CACSL2BoogieTranslator took 302.48 ms. Allocated memory was 649.6 MB in the beginning and 680.5 MB in the end (delta: 30.9 MB). Free memory was 558.5 MB in the beginning and 646.7 MB in the end (delta: -88.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 22.31/10.26 * Boogie Procedure Inliner took 39.11 ms. Allocated memory is still 680.5 MB. Free memory was 646.7 MB in the beginning and 643.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 50.3 GB. 22.31/10.26 * Boogie Preprocessor took 22.82 ms. Allocated memory is still 680.5 MB. Free memory was 643.5 MB in the beginning and 642.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 22.31/10.26 * RCFGBuilder took 240.10 ms. Allocated memory is still 680.5 MB. Free memory was 642.1 MB in the beginning and 624.0 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 50.3 GB. 22.31/10.26 * BlockEncodingV2 took 93.17 ms. Allocated memory is still 680.5 MB. Free memory was 624.0 MB in the beginning and 617.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 50.3 GB. 22.31/10.26 * TraceAbstraction took 2542.17 ms. Allocated memory was 680.5 MB in the beginning and 749.7 MB in the end (delta: 69.2 MB). Free memory was 617.3 MB in the beginning and 641.1 MB in the end (delta: -23.9 MB). Peak memory consumption was 45.3 MB. Max. memory is 50.3 GB. 22.31/10.26 * BuchiAutomizer took 2407.18 ms. Allocated memory was 749.7 MB in the beginning and 766.5 MB in the end (delta: 16.8 MB). Free memory was 641.1 MB in the beginning and 548.9 MB in the end (delta: 92.3 MB). Peak memory consumption was 109.0 MB. Max. memory is 50.3 GB. 22.31/10.26 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 22.31/10.26 - GenericResult: Unfinished Backtranslation 22.31/10.26 unknown boogie variable #length 22.31/10.26 - GenericResult: Unfinished Backtranslation 22.31/10.26 unknown boogie variable #length 22.31/10.26 - GenericResult: Unfinished Backtranslation 22.31/10.26 unknown boogie variable #length 22.31/10.26 - GenericResult: Unfinished Backtranslation 22.31/10.26 unknown boogie variable #length 22.31/10.26 - GenericResult: Unfinished Backtranslation 22.31/10.26 unknown boogie variable #length 22.31/10.26 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 22.31/10.26 - PositiveResult [Line: 14]: pointer dereference always succeeds 22.31/10.26 For all program executions holds that pointer dereference always succeeds at this location 22.31/10.26 - PositiveResult [Line: 14]: pointer dereference always succeeds 22.31/10.26 For all program executions holds that pointer dereference always succeeds at this location 22.31/10.26 - AllSpecificationsHoldResult: All specifications hold 22.31/10.26 2 specifications checked. All of them hold 22.31/10.26 - InvariantResult [Line: 13]: Loop Invariant 22.31/10.26 [2019-03-28 12:50:22,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.31/10.26 [2019-03-28 12:50:22,678 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.31/10.26 [2019-03-28 12:50:22,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.31/10.26 [2019-03-28 12:50:22,679 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 22.31/10.26 Derived loop invariant: ((((((1 == \valid[p] && 1 <= length) && length <= 0) && 1 <= p) && n <= 1) && 0 <= length) || (((((1 == \valid[p] && 1 <= length) && 1 <= p) && length + p <= unknown-#length-unknown[p]) && 1 <= n) && 0 <= length)) || (((((1 == \valid[p] && 1 <= length) && 0 == p) && length <= unknown-#length-unknown[p]) && 1 <= length) && 1 <= n) 22.31/10.26 - StatisticsResult: Ultimate Automizer benchmark data 22.31/10.26 CFG has 1 procedures, 9 locations, 2 error locations. SAFE Result, 2.4s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 28 SDtfs, 30 SDslu, 157 SDs, 0 SdLazy, 407 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=5, 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, 8 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 7 NumberOfFragments, 70 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 90 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 4563 SizeOfPredicates, 34 NumberOfNonLiveVariables, 302 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 10/39 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 22.31/10.26 - StatisticsResult: Constructed decomposition of program 22.31/10.26 Your program was decomposed into 4 terminating modules (2 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function length and consists of 5 locations. One nondeterministic module has affine ranking function -1 * p + unknown-#length-unknown[alloca(length * sizeof(char))] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. 22.31/10.26 - StatisticsResult: Timing statistics 22.31/10.26 BüchiAutomizer plugin needed 2.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 43 SDslu, 82 SDs, 0 SdLazy, 126 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf100 lsp95 ukn93 mio100 lsp60 div100 bol100 ite100 ukn100 eq192 hnf88 smp97 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 22.31/10.26 - TerminationAnalysisResult: Termination proven 22.31/10.26 Buchi Automizer proved that your program is terminating 22.31/10.26 RESULT: Ultimate proved your program to be correct! 22.31/10.26 22.31/10.26 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:50:22.903 22.31/10.26 !MESSAGE The workspace will exit with unsaved changes in this session. 22.31/10.26 Received shutdown request... 22.31/10.26 Ultimate: 22.31/10.26 GTK+ Version Check 22.31/10.26 EOF