176.10/129.74 YES 176.10/129.74 176.10/129.75 Ultimate: Cannot open display: 176.10/129.75 This is Ultimate 0.1.24-8dc7c08-m 176.10/129.75 [2019-03-28 12:46:31,148 INFO L170 SettingsManager]: Resetting all preferences to default values... 176.10/129.75 [2019-03-28 12:46:31,150 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 176.10/129.75 [2019-03-28 12:46:31,162 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 176.10/129.75 [2019-03-28 12:46:31,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 176.10/129.75 [2019-03-28 12:46:31,163 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 176.10/129.75 [2019-03-28 12:46:31,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 176.10/129.75 [2019-03-28 12:46:31,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 176.10/129.75 [2019-03-28 12:46:31,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 176.10/129.75 [2019-03-28 12:46:31,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 176.10/129.75 [2019-03-28 12:46:31,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 176.10/129.75 [2019-03-28 12:46:31,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 176.10/129.75 [2019-03-28 12:46:31,170 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 176.10/129.75 [2019-03-28 12:46:31,171 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 176.10/129.75 [2019-03-28 12:46:31,172 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 176.10/129.75 [2019-03-28 12:46:31,173 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 176.10/129.75 [2019-03-28 12:46:31,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 176.10/129.75 [2019-03-28 12:46:31,175 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 176.10/129.75 [2019-03-28 12:46:31,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 176.10/129.75 [2019-03-28 12:46:31,179 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 176.10/129.75 [2019-03-28 12:46:31,180 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 176.10/129.75 [2019-03-28 12:46:31,181 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 176.10/129.75 [2019-03-28 12:46:31,183 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 176.10/129.75 [2019-03-28 12:46:31,183 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 176.10/129.75 [2019-03-28 12:46:31,184 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 176.10/129.75 [2019-03-28 12:46:31,184 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 176.10/129.75 [2019-03-28 12:46:31,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 176.10/129.75 [2019-03-28 12:46:31,186 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 176.10/129.75 [2019-03-28 12:46:31,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 176.10/129.75 [2019-03-28 12:46:31,186 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 176.10/129.75 [2019-03-28 12:46:31,187 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 176.10/129.75 [2019-03-28 12:46:31,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 176.10/129.75 [2019-03-28 12:46:31,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 176.10/129.75 [2019-03-28 12:46:31,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 176.10/129.75 [2019-03-28 12:46:31,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 176.10/129.75 [2019-03-28 12:46:31,190 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 176.10/129.75 [2019-03-28 12:46:31,190 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 176.10/129.75 [2019-03-28 12:46:31,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 176.10/129.75 [2019-03-28 12:46:31,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 176.10/129.75 [2019-03-28 12:46:31,192 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 176.10/129.75 [2019-03-28 12:46:31,206 INFO L110 SettingsManager]: Loading preferences was successful 176.10/129.75 [2019-03-28 12:46:31,207 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 176.10/129.75 [2019-03-28 12:46:31,208 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 176.10/129.75 [2019-03-28 12:46:31,208 INFO L133 SettingsManager]: * Rewrite not-equals=true 176.10/129.75 [2019-03-28 12:46:31,208 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 176.10/129.75 [2019-03-28 12:46:31,208 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 176.10/129.75 [2019-03-28 12:46:31,208 INFO L133 SettingsManager]: * Use SBE=true 176.10/129.75 [2019-03-28 12:46:31,208 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 176.10/129.75 [2019-03-28 12:46:31,209 INFO L133 SettingsManager]: * Use old map elimination=false 176.10/129.75 [2019-03-28 12:46:31,209 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 176.10/129.75 [2019-03-28 12:46:31,209 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 176.10/129.75 [2019-03-28 12:46:31,209 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 176.10/129.75 [2019-03-28 12:46:31,209 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 176.10/129.75 [2019-03-28 12:46:31,209 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 176.10/129.75 [2019-03-28 12:46:31,210 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 176.10/129.75 [2019-03-28 12:46:31,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 176.10/129.75 [2019-03-28 12:46:31,210 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 176.10/129.75 [2019-03-28 12:46:31,210 INFO L133 SettingsManager]: * Check division by zero=IGNORE 176.10/129.75 [2019-03-28 12:46:31,210 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 176.10/129.75 [2019-03-28 12:46:31,211 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 176.10/129.75 [2019-03-28 12:46:31,211 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 176.10/129.75 [2019-03-28 12:46:31,211 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 176.10/129.75 [2019-03-28 12:46:31,211 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 176.10/129.75 [2019-03-28 12:46:31,211 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 176.10/129.75 [2019-03-28 12:46:31,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 176.10/129.75 [2019-03-28 12:46:31,212 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 176.10/129.75 [2019-03-28 12:46:31,212 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 176.10/129.75 [2019-03-28 12:46:31,212 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 176.10/129.75 [2019-03-28 12:46:31,212 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 176.10/129.75 [2019-03-28 12:46:31,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 176.10/129.75 [2019-03-28 12:46:31,250 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 176.10/129.75 [2019-03-28 12:46:31,254 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 176.10/129.75 [2019-03-28 12:46:31,255 INFO L271 PluginConnector]: Initializing CDTParser... 176.10/129.75 [2019-03-28 12:46:31,256 INFO L276 PluginConnector]: CDTParser initialized 176.10/129.75 [2019-03-28 12:46:31,256 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 176.10/129.75 [2019-03-28 12:46:31,362 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/e6b55e0ae4ab42eca8e22ede94c0ce3f/FLAGfc8ee395e 176.10/129.75 [2019-03-28 12:46:31,704 INFO L307 CDTParser]: Found 1 translation units. 176.10/129.75 [2019-03-28 12:46:31,704 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 176.10/129.75 [2019-03-28 12:46:31,705 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 176.10/129.75 [2019-03-28 12:46:31,711 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/e6b55e0ae4ab42eca8e22ede94c0ce3f/FLAGfc8ee395e 176.10/129.75 [2019-03-28 12:46:32,098 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/e6b55e0ae4ab42eca8e22ede94c0ce3f 176.10/129.75 [2019-03-28 12:46:32,110 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 176.10/129.75 [2019-03-28 12:46:32,111 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 176.10/129.75 [2019-03-28 12:46:32,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 176.10/129.75 [2019-03-28 12:46:32,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 176.10/129.75 [2019-03-28 12:46:32,116 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 176.10/129.75 [2019-03-28 12:46:32,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:32" (1/1) ... 176.10/129.75 [2019-03-28 12:46:32,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f407e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32, skipping insertion in model container 176.10/129.75 [2019-03-28 12:46:32,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:46:32" (1/1) ... 176.10/129.75 [2019-03-28 12:46:32,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 176.10/129.75 [2019-03-28 12:46:32,146 INFO L176 MainTranslator]: Built tables and reachable declarations 176.10/129.75 [2019-03-28 12:46:32,309 INFO L206 PostProcessor]: Analyzing one entry point: main 176.10/129.75 [2019-03-28 12:46:32,322 INFO L191 MainTranslator]: Completed pre-run 176.10/129.75 [2019-03-28 12:46:32,340 INFO L206 PostProcessor]: Analyzing one entry point: main 176.10/129.75 [2019-03-28 12:46:32,418 INFO L195 MainTranslator]: Completed translation 176.10/129.75 [2019-03-28 12:46:32,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32 WrapperNode 176.10/129.75 [2019-03-28 12:46:32,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 176.10/129.75 [2019-03-28 12:46:32,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 176.10/129.75 [2019-03-28 12:46:32,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 176.10/129.75 [2019-03-28 12:46:32,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 176.10/129.75 [2019-03-28 12:46:32,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 176.10/129.75 [2019-03-28 12:46:32,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 176.10/129.75 [2019-03-28 12:46:32,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 176.10/129.75 [2019-03-28 12:46:32,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 176.10/129.75 [2019-03-28 12:46:32,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 176.10/129.75 [2019-03-28 12:46:32,465 INFO L276 PluginConnector]: Boogie Preprocessor initialized 176.10/129.75 [2019-03-28 12:46:32,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 176.10/129.75 [2019-03-28 12:46:32,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 176.10/129.75 [2019-03-28 12:46:32,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 176.10/129.75 [2019-03-28 12:46:32,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 176.10/129.75 [2019-03-28 12:46:32,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 176.10/129.75 [2019-03-28 12:46:32,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 176.10/129.75 [2019-03-28 12:46:32,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 176.10/129.75 [2019-03-28 12:46:32,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 176.10/129.75 [2019-03-28 12:46:32,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 176.10/129.75 [2019-03-28 12:46:32,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... 176.10/129.75 [2019-03-28 12:46:32,491 INFO L276 PluginConnector]: RCFGBuilder initialized 176.10/129.75 [2019-03-28 12:46:32,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (1/1) ... 176.10/129.75 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 176.10/129.75 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 176.10/129.75 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 176.10/129.75 [2019-03-28 12:46:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 176.10/129.75 [2019-03-28 12:46:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 176.10/129.75 [2019-03-28 12:46:32,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 176.10/129.75 [2019-03-28 12:46:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 176.10/129.75 [2019-03-28 12:46:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 176.10/129.75 [2019-03-28 12:46:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 176.10/129.75 [2019-03-28 12:46:32,856 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 176.10/129.75 [2019-03-28 12:46:32,856 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 176.10/129.75 [2019-03-28 12:46:32,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:32 BoogieIcfgContainer 176.10/129.75 [2019-03-28 12:46:32,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 176.10/129.75 [2019-03-28 12:46:32,858 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 176.10/129.75 [2019-03-28 12:46:32,859 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 176.10/129.75 [2019-03-28 12:46:32,861 INFO L276 PluginConnector]: BlockEncodingV2 initialized 176.10/129.75 [2019-03-28 12:46:32,861 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:32" (1/1) ... 176.10/129.75 [2019-03-28 12:46:32,881 INFO L313 BlockEncoder]: Initial Icfg 47 locations, 48 edges 176.10/129.75 [2019-03-28 12:46:32,882 INFO L258 BlockEncoder]: Using Remove infeasible edges 176.10/129.75 [2019-03-28 12:46:32,883 INFO L263 BlockEncoder]: Using Maximize final states 176.10/129.75 [2019-03-28 12:46:32,884 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 176.10/129.75 [2019-03-28 12:46:32,884 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 176.10/129.75 [2019-03-28 12:46:32,886 INFO L296 BlockEncoder]: Using Remove sink states 176.10/129.75 [2019-03-28 12:46:32,887 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 176.10/129.75 [2019-03-28 12:46:32,887 INFO L179 BlockEncoder]: Using Rewrite not-equals 176.10/129.75 [2019-03-28 12:46:32,914 INFO L185 BlockEncoder]: Using Use SBE 176.10/129.75 [2019-03-28 12:46:32,961 INFO L200 BlockEncoder]: SBE split 27 edges 176.10/129.75 [2019-03-28 12:46:32,967 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 176.10/129.75 [2019-03-28 12:46:32,969 INFO L71 MaximizeFinalStates]: 0 new accepting states 176.10/129.75 [2019-03-28 12:46:33,020 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 176.10/129.75 [2019-03-28 12:46:33,023 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 176.10/129.75 [2019-03-28 12:46:33,025 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 176.10/129.75 [2019-03-28 12:46:33,025 INFO L71 MaximizeFinalStates]: 0 new accepting states 176.10/129.75 [2019-03-28 12:46:33,025 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 176.10/129.75 [2019-03-28 12:46:33,026 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 176.10/129.75 [2019-03-28 12:46:33,026 INFO L313 BlockEncoder]: Encoded RCFG 40 locations, 81 edges 176.10/129.75 [2019-03-28 12:46:33,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:33 BasicIcfg 176.10/129.75 [2019-03-28 12:46:33,027 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 176.10/129.75 [2019-03-28 12:46:33,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 176.10/129.75 [2019-03-28 12:46:33,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... 176.10/129.75 [2019-03-28 12:46:33,032 INFO L276 PluginConnector]: TraceAbstraction initialized 176.10/129.75 [2019-03-28 12:46:33,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:46:32" (1/4) ... 176.10/129.75 [2019-03-28 12:46:33,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622a29a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:33, skipping insertion in model container 176.10/129.75 [2019-03-28 12:46:33,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (2/4) ... 176.10/129.75 [2019-03-28 12:46:33,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622a29a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:46:33, skipping insertion in model container 176.10/129.75 [2019-03-28 12:46:33,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:32" (3/4) ... 176.10/129.75 [2019-03-28 12:46:33,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622a29a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:33, skipping insertion in model container 176.10/129.75 [2019-03-28 12:46:33,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:33" (4/4) ... 176.10/129.75 [2019-03-28 12:46:33,036 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 176.10/129.75 [2019-03-28 12:46:33,046 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 176.10/129.75 [2019-03-28 12:46:33,054 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. 176.10/129.75 [2019-03-28 12:46:33,071 INFO L257 AbstractCegarLoop]: Starting to check reachability of 24 error locations. 176.10/129.75 [2019-03-28 12:46:33,100 INFO L133 ementStrategyFactory]: Using default assertion order modulation 176.10/129.75 [2019-03-28 12:46:33,101 INFO L382 AbstractCegarLoop]: Interprodecural is true 176.10/129.75 [2019-03-28 12:46:33,101 INFO L383 AbstractCegarLoop]: Hoare is true 176.10/129.75 [2019-03-28 12:46:33,101 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 176.10/129.75 [2019-03-28 12:46:33,101 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 176.10/129.75 [2019-03-28 12:46:33,101 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 176.10/129.75 [2019-03-28 12:46:33,101 INFO L387 AbstractCegarLoop]: Difference is false 176.10/129.75 [2019-03-28 12:46:33,101 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 176.10/129.75 [2019-03-28 12:46:33,102 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 176.10/129.75 [2019-03-28 12:46:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. 176.10/129.75 [2019-03-28 12:46:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 176.10/129.75 [2019-03-28 12:46:33,123 INFO L394 BasicCegarLoop]: Found error trace 176.10/129.75 [2019-03-28 12:46:33,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 176.10/129.75 [2019-03-28 12:46:33,125 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 176.10/129.75 [2019-03-28 12:46:33,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:33,130 INFO L82 PathProgramCache]: Analyzing trace with hash 124461, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:46:33,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:46:33,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:46:33,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:33,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:33,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:46:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.75 [2019-03-28 12:46:33,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 176.10/129.75 [2019-03-28 12:46:33,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 176.10/129.75 [2019-03-28 12:46:33,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 176.10/129.75 [2019-03-28 12:46:33,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 176.10/129.75 [2019-03-28 12:46:33,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:33,351 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. 176.10/129.75 [2019-03-28 12:46:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 176.10/129.75 [2019-03-28 12:46:33,596 INFO L93 Difference]: Finished difference Result 40 states and 81 transitions. 176.10/129.75 [2019-03-28 12:46:33,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:33,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 176.10/129.75 [2019-03-28 12:46:33,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 176.10/129.75 [2019-03-28 12:46:33,633 INFO L225 Difference]: With dead ends: 40 176.10/129.75 [2019-03-28 12:46:33,633 INFO L226 Difference]: Without dead ends: 37 176.10/129.75 [2019-03-28 12:46:33,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. 176.10/129.75 [2019-03-28 12:46:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. 176.10/129.75 [2019-03-28 12:46:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 176.10/129.75 [2019-03-28 12:46:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 75 transitions. 176.10/129.75 [2019-03-28 12:46:33,677 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 75 transitions. Word has length 3 176.10/129.75 [2019-03-28 12:46:33,678 INFO L84 Accepts]: Finished accepts. word is rejected. 176.10/129.75 [2019-03-28 12:46:33,678 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 75 transitions. 176.10/129.75 [2019-03-28 12:46:33,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 75 transitions. 176.10/129.75 [2019-03-28 12:46:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 176.10/129.75 [2019-03-28 12:46:33,679 INFO L394 BasicCegarLoop]: Found error trace 176.10/129.75 [2019-03-28 12:46:33,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 176.10/129.75 [2019-03-28 12:46:33,680 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 176.10/129.75 [2019-03-28 12:46:33,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:33,680 INFO L82 PathProgramCache]: Analyzing trace with hash 124463, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:46:33,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:46:33,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:46:33,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:33,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:33,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:46:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.75 [2019-03-28 12:46:33,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 176.10/129.75 [2019-03-28 12:46:33,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 176.10/129.75 [2019-03-28 12:46:33,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 176.10/129.75 [2019-03-28 12:46:33,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 176.10/129.75 [2019-03-28 12:46:33,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:33,711 INFO L87 Difference]: Start difference. First operand 37 states and 75 transitions. Second operand 3 states. 176.10/129.75 [2019-03-28 12:46:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 176.10/129.75 [2019-03-28 12:46:33,845 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. 176.10/129.75 [2019-03-28 12:46:33,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:33,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 176.10/129.75 [2019-03-28 12:46:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 176.10/129.75 [2019-03-28 12:46:33,847 INFO L225 Difference]: With dead ends: 40 176.10/129.75 [2019-03-28 12:46:33,847 INFO L226 Difference]: Without dead ends: 37 176.10/129.75 [2019-03-28 12:46:33,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. 176.10/129.75 [2019-03-28 12:46:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. 176.10/129.75 [2019-03-28 12:46:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 176.10/129.75 [2019-03-28 12:46:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 72 transitions. 176.10/129.75 [2019-03-28 12:46:33,854 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 72 transitions. Word has length 3 176.10/129.75 [2019-03-28 12:46:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. 176.10/129.75 [2019-03-28 12:46:33,854 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 72 transitions. 176.10/129.75 [2019-03-28 12:46:33,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 72 transitions. 176.10/129.75 [2019-03-28 12:46:33,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 176.10/129.75 [2019-03-28 12:46:33,855 INFO L394 BasicCegarLoop]: Found error trace 176.10/129.75 [2019-03-28 12:46:33,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 176.10/129.75 [2019-03-28 12:46:33,855 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 176.10/129.75 [2019-03-28 12:46:33,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:33,856 INFO L82 PathProgramCache]: Analyzing trace with hash 124464, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:46:33,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:46:33,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:46:33,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:33,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:33,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:46:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.75 [2019-03-28 12:46:33,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 176.10/129.75 [2019-03-28 12:46:33,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 176.10/129.75 [2019-03-28 12:46:33,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 176.10/129.75 [2019-03-28 12:46:33,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 176.10/129.75 [2019-03-28 12:46:33,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:33,904 INFO L87 Difference]: Start difference. First operand 37 states and 72 transitions. Second operand 3 states. 176.10/129.75 [2019-03-28 12:46:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 176.10/129.75 [2019-03-28 12:46:34,056 INFO L93 Difference]: Finished difference Result 37 states and 72 transitions. 176.10/129.75 [2019-03-28 12:46:34,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 176.10/129.75 [2019-03-28 12:46:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 176.10/129.75 [2019-03-28 12:46:34,058 INFO L225 Difference]: With dead ends: 37 176.10/129.75 [2019-03-28 12:46:34,058 INFO L226 Difference]: Without dead ends: 34 176.10/129.75 [2019-03-28 12:46:34,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 176.10/129.75 [2019-03-28 12:46:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 176.10/129.75 [2019-03-28 12:46:34,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 176.10/129.75 [2019-03-28 12:46:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 69 transitions. 176.10/129.75 [2019-03-28 12:46:34,063 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 69 transitions. Word has length 3 176.10/129.75 [2019-03-28 12:46:34,064 INFO L84 Accepts]: Finished accepts. word is rejected. 176.10/129.75 [2019-03-28 12:46:34,064 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 69 transitions. 176.10/129.75 [2019-03-28 12:46:34,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 69 transitions. 176.10/129.75 [2019-03-28 12:46:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 176.10/129.75 [2019-03-28 12:46:34,065 INFO L394 BasicCegarLoop]: Found error trace 176.10/129.75 [2019-03-28 12:46:34,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:46:34,065 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 176.10/129.75 [2019-03-28 12:46:34,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:34,065 INFO L82 PathProgramCache]: Analyzing trace with hash 3856710, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:46:34,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:46:34,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:46:34,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:46:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.75 [2019-03-28 12:46:34,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 176.10/129.75 [2019-03-28 12:46:34,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 176.10/129.75 [2019-03-28 12:46:34,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 176.10/129.75 [2019-03-28 12:46:34,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 176.10/129.75 [2019-03-28 12:46:34,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:34,105 INFO L87 Difference]: Start difference. First operand 34 states and 69 transitions. Second operand 3 states. 176.10/129.75 [2019-03-28 12:46:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 176.10/129.75 [2019-03-28 12:46:34,241 INFO L93 Difference]: Finished difference Result 34 states and 69 transitions. 176.10/129.75 [2019-03-28 12:46:34,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 176.10/129.75 [2019-03-28 12:46:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 176.10/129.75 [2019-03-28 12:46:34,242 INFO L225 Difference]: With dead ends: 34 176.10/129.75 [2019-03-28 12:46:34,243 INFO L226 Difference]: Without dead ends: 32 176.10/129.75 [2019-03-28 12:46:34,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:34,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 176.10/129.75 [2019-03-28 12:46:34,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 176.10/129.75 [2019-03-28 12:46:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 176.10/129.75 [2019-03-28 12:46:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 65 transitions. 176.10/129.75 [2019-03-28 12:46:34,248 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 65 transitions. Word has length 4 176.10/129.75 [2019-03-28 12:46:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. 176.10/129.75 [2019-03-28 12:46:34,249 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 65 transitions. 176.10/129.75 [2019-03-28 12:46:34,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 65 transitions. 176.10/129.75 [2019-03-28 12:46:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 176.10/129.75 [2019-03-28 12:46:34,250 INFO L394 BasicCegarLoop]: Found error trace 176.10/129.75 [2019-03-28 12:46:34,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:46:34,250 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 176.10/129.75 [2019-03-28 12:46:34,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:34,250 INFO L82 PathProgramCache]: Analyzing trace with hash 3856712, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:46:34,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:46:34,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:46:34,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:46:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.75 [2019-03-28 12:46:34,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 176.10/129.75 [2019-03-28 12:46:34,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 176.10/129.75 [2019-03-28 12:46:34,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 176.10/129.75 [2019-03-28 12:46:34,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 176.10/129.75 [2019-03-28 12:46:34,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:34,278 INFO L87 Difference]: Start difference. First operand 32 states and 65 transitions. Second operand 3 states. 176.10/129.75 [2019-03-28 12:46:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 176.10/129.75 [2019-03-28 12:46:34,386 INFO L93 Difference]: Finished difference Result 34 states and 65 transitions. 176.10/129.75 [2019-03-28 12:46:34,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 176.10/129.75 [2019-03-28 12:46:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 176.10/129.75 [2019-03-28 12:46:34,388 INFO L225 Difference]: With dead ends: 34 176.10/129.75 [2019-03-28 12:46:34,388 INFO L226 Difference]: Without dead ends: 32 176.10/129.75 [2019-03-28 12:46:34,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:34,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 176.10/129.75 [2019-03-28 12:46:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 176.10/129.75 [2019-03-28 12:46:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 176.10/129.75 [2019-03-28 12:46:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 63 transitions. 176.10/129.75 [2019-03-28 12:46:34,393 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 63 transitions. Word has length 4 176.10/129.75 [2019-03-28 12:46:34,393 INFO L84 Accepts]: Finished accepts. word is rejected. 176.10/129.75 [2019-03-28 12:46:34,393 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 63 transitions. 176.10/129.75 [2019-03-28 12:46:34,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 63 transitions. 176.10/129.75 [2019-03-28 12:46:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 176.10/129.75 [2019-03-28 12:46:34,394 INFO L394 BasicCegarLoop]: Found error trace 176.10/129.75 [2019-03-28 12:46:34,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:46:34,394 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 176.10/129.75 [2019-03-28 12:46:34,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:34,395 INFO L82 PathProgramCache]: Analyzing trace with hash 3856713, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:46:34,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:46:34,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:46:34,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:46:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.75 [2019-03-28 12:46:34,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 176.10/129.75 [2019-03-28 12:46:34,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 176.10/129.75 [2019-03-28 12:46:34,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 176.10/129.75 [2019-03-28 12:46:34,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 176.10/129.75 [2019-03-28 12:46:34,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:34,441 INFO L87 Difference]: Start difference. First operand 32 states and 63 transitions. Second operand 3 states. 176.10/129.75 [2019-03-28 12:46:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 176.10/129.75 [2019-03-28 12:46:34,559 INFO L93 Difference]: Finished difference Result 32 states and 63 transitions. 176.10/129.75 [2019-03-28 12:46:34,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 176.10/129.75 [2019-03-28 12:46:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 176.10/129.75 [2019-03-28 12:46:34,561 INFO L225 Difference]: With dead ends: 32 176.10/129.75 [2019-03-28 12:46:34,561 INFO L226 Difference]: Without dead ends: 30 176.10/129.75 [2019-03-28 12:46:34,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 176.10/129.75 [2019-03-28 12:46:34,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 176.10/129.75 [2019-03-28 12:46:34,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 176.10/129.75 [2019-03-28 12:46:34,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 61 transitions. 176.10/129.75 [2019-03-28 12:46:34,565 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 61 transitions. Word has length 4 176.10/129.75 [2019-03-28 12:46:34,565 INFO L84 Accepts]: Finished accepts. word is rejected. 176.10/129.75 [2019-03-28 12:46:34,565 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 61 transitions. 176.10/129.75 [2019-03-28 12:46:34,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 61 transitions. 176.10/129.75 [2019-03-28 12:46:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 176.10/129.75 [2019-03-28 12:46:34,566 INFO L394 BasicCegarLoop]: Found error trace 176.10/129.75 [2019-03-28 12:46:34,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:46:34,566 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 176.10/129.75 [2019-03-28 12:46:34,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:34,567 INFO L82 PathProgramCache]: Analyzing trace with hash 119556186, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:46:34,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:46:34,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:46:34,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:46:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.75 [2019-03-28 12:46:34,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 176.10/129.75 [2019-03-28 12:46:34,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 176.10/129.75 [2019-03-28 12:46:34,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 176.10/129.75 [2019-03-28 12:46:34,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 176.10/129.75 [2019-03-28 12:46:34,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:34,599 INFO L87 Difference]: Start difference. First operand 30 states and 61 transitions. Second operand 3 states. 176.10/129.75 [2019-03-28 12:46:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 176.10/129.75 [2019-03-28 12:46:34,702 INFO L93 Difference]: Finished difference Result 30 states and 61 transitions. 176.10/129.75 [2019-03-28 12:46:34,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 176.10/129.75 [2019-03-28 12:46:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 176.10/129.75 [2019-03-28 12:46:34,703 INFO L225 Difference]: With dead ends: 30 176.10/129.75 [2019-03-28 12:46:34,704 INFO L226 Difference]: Without dead ends: 27 176.10/129.75 [2019-03-28 12:46:34,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:34,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 176.10/129.75 [2019-03-28 12:46:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 176.10/129.75 [2019-03-28 12:46:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 176.10/129.75 [2019-03-28 12:46:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 55 transitions. 176.10/129.75 [2019-03-28 12:46:34,708 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 55 transitions. Word has length 5 176.10/129.75 [2019-03-28 12:46:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. 176.10/129.75 [2019-03-28 12:46:34,708 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 55 transitions. 176.10/129.75 [2019-03-28 12:46:34,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 55 transitions. 176.10/129.75 [2019-03-28 12:46:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 176.10/129.75 [2019-03-28 12:46:34,709 INFO L394 BasicCegarLoop]: Found error trace 176.10/129.75 [2019-03-28 12:46:34,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:46:34,709 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 176.10/129.75 [2019-03-28 12:46:34,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:34,710 INFO L82 PathProgramCache]: Analyzing trace with hash 119556187, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:46:34,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:46:34,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:46:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:46:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.75 [2019-03-28 12:46:34,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 176.10/129.75 [2019-03-28 12:46:34,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 176.10/129.75 [2019-03-28 12:46:34,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 176.10/129.75 [2019-03-28 12:46:34,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 176.10/129.75 [2019-03-28 12:46:34,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:34,746 INFO L87 Difference]: Start difference. First operand 27 states and 55 transitions. Second operand 3 states. 176.10/129.75 [2019-03-28 12:46:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 176.10/129.75 [2019-03-28 12:46:34,834 INFO L93 Difference]: Finished difference Result 27 states and 55 transitions. 176.10/129.75 [2019-03-28 12:46:34,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 176.10/129.75 [2019-03-28 12:46:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 176.10/129.75 [2019-03-28 12:46:34,836 INFO L225 Difference]: With dead ends: 27 176.10/129.75 [2019-03-28 12:46:34,836 INFO L226 Difference]: Without dead ends: 24 176.10/129.75 [2019-03-28 12:46:34,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 176.10/129.75 [2019-03-28 12:46:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. 176.10/129.75 [2019-03-28 12:46:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 176.10/129.75 [2019-03-28 12:46:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 49 transitions. 176.10/129.75 [2019-03-28 12:46:34,839 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 49 transitions. Word has length 5 176.10/129.75 [2019-03-28 12:46:34,840 INFO L84 Accepts]: Finished accepts. word is rejected. 176.10/129.75 [2019-03-28 12:46:34,840 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 49 transitions. 176.10/129.75 [2019-03-28 12:46:34,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 49 transitions. 176.10/129.75 [2019-03-28 12:46:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 176.10/129.75 [2019-03-28 12:46:34,840 INFO L394 BasicCegarLoop]: Found error trace 176.10/129.75 [2019-03-28 12:46:34,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:46:34,841 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 176.10/129.75 [2019-03-28 12:46:34,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:34,841 INFO L82 PathProgramCache]: Analyzing trace with hash -588728281, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:46:34,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:46:34,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:46:34,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:46:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.75 [2019-03-28 12:46:34,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 176.10/129.75 [2019-03-28 12:46:34,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 176.10/129.75 [2019-03-28 12:46:34,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 176.10/129.75 [2019-03-28 12:46:34,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 176.10/129.75 [2019-03-28 12:46:34,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:34,870 INFO L87 Difference]: Start difference. First operand 24 states and 49 transitions. Second operand 3 states. 176.10/129.75 [2019-03-28 12:46:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 176.10/129.75 [2019-03-28 12:46:34,978 INFO L93 Difference]: Finished difference Result 24 states and 49 transitions. 176.10/129.75 [2019-03-28 12:46:34,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 176.10/129.75 [2019-03-28 12:46:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 176.10/129.75 [2019-03-28 12:46:34,979 INFO L225 Difference]: With dead ends: 24 176.10/129.75 [2019-03-28 12:46:34,979 INFO L226 Difference]: Without dead ends: 20 176.10/129.75 [2019-03-28 12:46:34,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:34,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 176.10/129.75 [2019-03-28 12:46:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 176.10/129.75 [2019-03-28 12:46:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 176.10/129.75 [2019-03-28 12:46:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. 176.10/129.75 [2019-03-28 12:46:34,983 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 6 176.10/129.75 [2019-03-28 12:46:34,983 INFO L84 Accepts]: Finished accepts. word is rejected. 176.10/129.75 [2019-03-28 12:46:34,983 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. 176.10/129.75 [2019-03-28 12:46:34,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:34,983 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. 176.10/129.75 [2019-03-28 12:46:34,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 176.10/129.75 [2019-03-28 12:46:34,984 INFO L394 BasicCegarLoop]: Found error trace 176.10/129.75 [2019-03-28 12:46:34,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:46:34,984 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION]=== 176.10/129.75 [2019-03-28 12:46:34,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:34,984 INFO L82 PathProgramCache]: Analyzing trace with hash -588728279, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:46:34,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:46:34,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:46:34,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:46:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.75 [2019-03-28 12:46:35,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 176.10/129.75 [2019-03-28 12:46:35,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 176.10/129.75 [2019-03-28 12:46:35,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 176.10/129.75 [2019-03-28 12:46:35,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 176.10/129.75 [2019-03-28 12:46:35,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:35,019 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 3 states. 176.10/129.75 [2019-03-28 12:46:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 176.10/129.75 [2019-03-28 12:46:35,104 INFO L93 Difference]: Finished difference Result 20 states and 41 transitions. 176.10/129.75 [2019-03-28 12:46:35,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:35,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 176.10/129.75 [2019-03-28 12:46:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 176.10/129.75 [2019-03-28 12:46:35,105 INFO L225 Difference]: With dead ends: 20 176.10/129.75 [2019-03-28 12:46:35,106 INFO L226 Difference]: Without dead ends: 0 176.10/129.75 [2019-03-28 12:46:35,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 176.10/129.75 [2019-03-28 12:46:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 176.10/129.75 [2019-03-28 12:46:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 176.10/129.75 [2019-03-28 12:46:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 176.10/129.75 [2019-03-28 12:46:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 176.10/129.75 [2019-03-28 12:46:35,107 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 176.10/129.75 [2019-03-28 12:46:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. 176.10/129.75 [2019-03-28 12:46:35,107 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 176.10/129.75 [2019-03-28 12:46:35,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 176.10/129.75 [2019-03-28 12:46:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 176.10/129.75 [2019-03-28 12:46:35,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 176.10/129.75 [2019-03-28 12:46:35,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 176.10/129.75 [2019-03-28 12:46:35,150 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,150 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,151 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,151 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,151 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,151 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,151 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,151 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,151 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,152 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,152 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,152 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,152 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,152 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,152 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,152 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,152 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,152 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,153 INFO L444 ceAbstractionStarter]: At program point L15-2(lines 14 18) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_f_~x_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~y_ref~0.base)) (= (select |#length| ULTIMATE.start_f_~y_ref~0.base) 4) (= 0 ULTIMATE.start_f_~flag~0.offset) (= (select |#valid| ULTIMATE.start_f_~c~0.base) 1) (= ULTIMATE.start_f_~y_ref~0.offset 0) (= 0 ULTIMATE.start_f_~c~0.offset) (= 1 (select |#valid| ULTIMATE.start_f_~flag~0.base)) (= (select |#length| ULTIMATE.start_f_~c~0.base) 4) (= 4 (select |#length| ULTIMATE.start_f_~flag~0.base)) (= 1 (select |#valid| ULTIMATE.start_f_~x_ref~0.base)) (= ULTIMATE.start_f_~x_ref~0.offset 0)) 176.10/129.75 [2019-03-28 12:46:35,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,153 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,153 INFO L448 ceAbstractionStarter]: For program point L15-3(lines 15 18) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,154 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,154 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,154 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,155 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,155 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,155 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,155 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,155 INFO L448 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,155 INFO L448 ceAbstractionStarter]: For program point L16-3(line 16) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,155 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,155 INFO L448 ceAbstractionStarter]: For program point L16-4(line 16) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,156 INFO L448 ceAbstractionStarter]: For program point L16-5(line 16) no Hoare annotation was computed. 176.10/129.75 [2019-03-28 12:46:35,156 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 176.10/129.75 [2019-03-28 12:46:35,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.75 [2019-03-28 12:46:35,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.75 [2019-03-28 12:46:35,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.75 [2019-03-28 12:46:35,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.75 [2019-03-28 12:46:35,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.75 [2019-03-28 12:46:35,175 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.75 [2019-03-28 12:46:35,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.75 [2019-03-28 12:46:35,176 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.75 [2019-03-28 12:46:35,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:35 BasicIcfg 176.10/129.75 [2019-03-28 12:46:35,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 176.10/129.75 [2019-03-28 12:46:35,179 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 176.10/129.75 [2019-03-28 12:46:35,179 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 176.10/129.75 [2019-03-28 12:46:35,182 INFO L276 PluginConnector]: BuchiAutomizer initialized 176.10/129.75 [2019-03-28 12:46:35,183 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 176.10/129.75 [2019-03-28 12:46:35,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:46:32" (1/5) ... 176.10/129.75 [2019-03-28 12:46:35,184 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bf6e79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:35, skipping insertion in model container 176.10/129.75 [2019-03-28 12:46:35,184 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 176.10/129.75 [2019-03-28 12:46:35,184 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:46:32" (2/5) ... 176.10/129.75 [2019-03-28 12:46:35,185 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bf6e79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:46:35, skipping insertion in model container 176.10/129.75 [2019-03-28 12:46:35,185 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 176.10/129.75 [2019-03-28 12:46:35,185 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:46:32" (3/5) ... 176.10/129.75 [2019-03-28 12:46:35,185 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bf6e79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:35, skipping insertion in model container 176.10/129.75 [2019-03-28 12:46:35,185 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 176.10/129.75 [2019-03-28 12:46:35,185 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:46:33" (4/5) ... 176.10/129.75 [2019-03-28 12:46:35,186 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bf6e79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:35, skipping insertion in model container 176.10/129.75 [2019-03-28 12:46:35,186 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 176.10/129.75 [2019-03-28 12:46:35,186 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:46:35" (5/5) ... 176.10/129.75 [2019-03-28 12:46:35,187 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 176.10/129.75 [2019-03-28 12:46:35,208 INFO L133 ementStrategyFactory]: Using default assertion order modulation 176.10/129.75 [2019-03-28 12:46:35,208 INFO L374 BuchiCegarLoop]: Interprodecural is true 176.10/129.75 [2019-03-28 12:46:35,208 INFO L375 BuchiCegarLoop]: Hoare is true 176.10/129.75 [2019-03-28 12:46:35,208 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 176.10/129.75 [2019-03-28 12:46:35,208 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 176.10/129.75 [2019-03-28 12:46:35,208 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 176.10/129.75 [2019-03-28 12:46:35,208 INFO L379 BuchiCegarLoop]: Difference is false 176.10/129.75 [2019-03-28 12:46:35,209 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 176.10/129.75 [2019-03-28 12:46:35,209 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 176.10/129.75 [2019-03-28 12:46:35,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. 176.10/129.75 [2019-03-28 12:46:35,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 176.10/129.75 [2019-03-28 12:46:35,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 176.10/129.75 [2019-03-28 12:46:35,219 INFO L119 BuchiIsEmpty]: Starting construction of run 176.10/129.75 [2019-03-28 12:46:35,223 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:46:35,223 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:46:35,223 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 176.10/129.75 [2019-03-28 12:46:35,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. 176.10/129.75 [2019-03-28 12:46:35,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 176.10/129.75 [2019-03-28 12:46:35,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 176.10/129.75 [2019-03-28 12:46:35,226 INFO L119 BuchiIsEmpty]: Starting construction of run 176.10/129.75 [2019-03-28 12:46:35,226 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:46:35,226 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:46:35,232 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [150] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 36#L11true [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 33#L11-1true [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 14#L12true [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 40#L13true [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 41#L15-2true 176.10/129.75 [2019-03-28 12:46:35,233 INFO L796 eck$LassoCheckResult]: Loop: 41#L15-2true [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 22#L15true [176] L15-->L16: Formula: (> |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 4#L16true [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 20#L16-2true [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 16#L16-3true [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 15#L16-4true [189] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (< |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 1)) |v_#memory_int_14|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 12#L16-5true [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 28#L17true [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 25#L17-1true [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 41#L15-2true 176.10/129.75 [2019-03-28 12:46:35,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:35,234 INFO L82 PathProgramCache]: Analyzing trace with hash -574875528, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:46:35,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:46:35,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:46:35,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:35,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:35,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:46:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:46:35,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:35,292 INFO L82 PathProgramCache]: Analyzing trace with hash -564015458, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:46:35,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:46:35,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:46:35,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:35,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:35,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:46:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:46:35,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:35,314 INFO L82 PathProgramCache]: Analyzing trace with hash 618941447, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:46:35,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:46:35,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:46:35,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:35,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:35,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:46:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:46:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:46:35,484 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 74 176.10/129.75 [2019-03-28 12:46:36,083 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 101 176.10/129.75 [2019-03-28 12:46:36,292 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 93 176.10/129.75 [2019-03-28 12:46:36,307 INFO L216 LassoAnalysis]: Preferences: 176.10/129.75 [2019-03-28 12:46:36,308 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 176.10/129.75 [2019-03-28 12:46:36,308 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 176.10/129.75 [2019-03-28 12:46:36,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 176.10/129.75 [2019-03-28 12:46:36,308 INFO L127 ssoRankerPreferences]: Use exernal solver: false 176.10/129.75 [2019-03-28 12:46:36,308 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 176.10/129.75 [2019-03-28 12:46:36,308 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 176.10/129.75 [2019-03-28 12:46:36,309 INFO L130 ssoRankerPreferences]: Path of dumped script: 176.10/129.75 [2019-03-28 12:46:36,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 176.10/129.75 [2019-03-28 12:46:36,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 176.10/129.75 [2019-03-28 12:46:36,309 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 176.10/129.75 [2019-03-28 12:46:36,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:46:36,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:46:36,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:46:36,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:46:36,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:46:36,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:46:36,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:46:36,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:46:36,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:46:36,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:46:36,881 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 176.10/129.75 [2019-03-28 12:46:37,046 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 176.10/129.75 [2019-03-28 12:46:37,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:46:37,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:46:37,288 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 176.10/129.75 [2019-03-28 12:46:37,603 INFO L300 LassoAnalysis]: Preprocessing complete. 176.10/129.75 [2019-03-28 12:46:37,609 INFO L497 LassoAnalysis]: Using template 'affine'. 176.10/129.75 [2019-03-28 12:46:37,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:46:37,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:46:37,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:46:37,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:46:37,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:46:37,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:46:37,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:46:37,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,776 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:46:37,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:46:37,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:46:37,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:46:37,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:46:37,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:46:37,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:46:37,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:46:37,798 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 176.10/129.75 [2019-03-28 12:46:37,814 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 176.10/129.75 [2019-03-28 12:46:37,814 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 176.10/129.75 [2019-03-28 12:46:37,816 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 176.10/129.75 [2019-03-28 12:46:37,818 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 176.10/129.75 [2019-03-28 12:46:37,818 INFO L518 LassoAnalysis]: Proved termination. 176.10/129.75 [2019-03-28 12:46:37,819 INFO L520 LassoAnalysis]: Termination argument consisting of: 176.10/129.75 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_1 176.10/129.75 Supporting invariants [] 176.10/129.75 [2019-03-28 12:46:38,004 INFO L297 tatePredicateManager]: 38 out of 42 supporting invariants were superfluous and have been removed 176.10/129.75 [2019-03-28 12:46:38,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 176.10/129.75 [2019-03-28 12:46:38,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 176.10/129.75 [2019-03-28 12:46:38,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:46:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:46:38,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core 176.10/129.75 [2019-03-28 12:46:38,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.75 [2019-03-28 12:46:38,099 INFO L189 IndexEqualityManager]: detected not equals via solver 176.10/129.75 [2019-03-28 12:46:38,113 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 176.10/129.75 [2019-03-28 12:46:38,114 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:46:38,128 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:46:38,128 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:46:38,129 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 176.10/129.75 [2019-03-28 12:46:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:46:38,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core 176.10/129.75 [2019-03-28 12:46:38,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.75 [2019-03-28 12:46:38,269 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:46:38,269 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 176.10/129.75 [2019-03-28 12:46:38,271 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:46:38,298 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 176.10/129.75 [2019-03-28 12:46:38,298 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:46:38,298 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 176.10/129.75 [2019-03-28 12:46:38,394 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:46:38,395 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 71 176.10/129.75 [2019-03-28 12:46:38,405 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:46:38,511 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 176.10/129.75 [2019-03-28 12:46:38,511 INFO L497 ElimStorePlain]: treesize reduction 70, result has 50.0 percent of original size 176.10/129.75 [2019-03-28 12:46:38,513 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 176.10/129.75 [2019-03-28 12:46:38,514 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:70 176.10/129.75 [2019-03-28 12:46:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.75 [2019-03-28 12:46:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:46:39,723 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.75 [2019-03-28 12:46:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:46:39,734 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.75 [2019-03-28 12:46:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:46:39,745 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.75 [2019-03-28 12:46:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:46:39,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core 176.10/129.75 [2019-03-28 12:46:39,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.75 [2019-03-28 12:46:39,834 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:46:39,834 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 70 176.10/129.75 [2019-03-28 12:46:39,840 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:46:39,895 INFO L497 ElimStorePlain]: treesize reduction 47, result has 57.7 percent of original size 176.10/129.75 [2019-03-28 12:46:39,897 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 176.10/129.75 [2019-03-28 12:46:39,897 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:58 176.10/129.75 [2019-03-28 12:46:46,594 WARN L188 SmtUtils]: Spent 3.71 s on a formula simplification that was a NOOP. DAG size: 38 176.10/129.75 [2019-03-28 12:46:46,624 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:46:46,625 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 176.10/129.75 [2019-03-28 12:46:46,626 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:46:46,653 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 176.10/129.75 [2019-03-28 12:46:46,653 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:46:46,653 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 176.10/129.75 [2019-03-28 12:46:47,702 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_f_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_f_~c~0.base c_ULTIMATE.start_f_~x_ref~0.base) (= c_ULTIMATE.start_f_~x_ref~0.offset ULTIMATE.start_f_~c~0.offset)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~y_ref~0.base) c_ULTIMATE.start_f_~y_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~c~0.base) c_ULTIMATE.start_f_~x_ref~0.offset) c_oldRank0))) is different from true 176.10/129.75 [2019-03-28 12:46:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:46:47,716 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.75 [2019-03-28 12:46:47,716 INFO L98 LoopCannibalizer]: 29 predicates before loop cannibalization 33 predicates after loop cannibalization 176.10/129.75 [2019-03-28 12:46:47,720 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 33 loop predicates 176.10/129.75 [2019-03-28 12:46:47,721 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 40 states. Second operand 10 states. 176.10/129.75 [2019-03-28 12:46:57,183 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 176.10/129.75 [2019-03-28 12:46:58,972 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 176.10/129.75 [2019-03-28 12:46:59,713 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 176.10/129.75 [2019-03-28 12:47:00,697 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 176.10/129.75 [2019-03-28 12:47:01,716 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 176.10/129.75 [2019-03-28 12:47:15,974 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 40 states.. Second operand 10 states. Result 4212 states and 7147 transitions. Complement of second has 1181 states. 176.10/129.75 [2019-03-28 12:47:15,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 189 states 17 stem states 166 non-accepting loop states 6 accepting loop states 176.10/129.75 [2019-03-28 12:47:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 176.10/129.75 [2019-03-28 12:47:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 2059 transitions. 176.10/129.75 [2019-03-28 12:47:15,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 2059 transitions. Stem has 6 letters. Loop has 9 letters. 176.10/129.75 [2019-03-28 12:47:15,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.75 [2019-03-28 12:47:15,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 2059 transitions. Stem has 15 letters. Loop has 9 letters. 176.10/129.75 [2019-03-28 12:47:15,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.75 [2019-03-28 12:47:15,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 2059 transitions. Stem has 6 letters. Loop has 18 letters. 176.10/129.75 [2019-03-28 12:47:15,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.75 [2019-03-28 12:47:16,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4212 states and 7147 transitions. 176.10/129.75 [2019-03-28 12:47:16,082 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 432 176.10/129.75 [2019-03-28 12:47:16,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4212 states to 822 states and 985 transitions. 176.10/129.75 [2019-03-28 12:47:16,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 756 176.10/129.75 [2019-03-28 12:47:16,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 788 176.10/129.75 [2019-03-28 12:47:16,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 822 states and 985 transitions. 176.10/129.75 [2019-03-28 12:47:16,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 176.10/129.75 [2019-03-28 12:47:16,096 INFO L706 BuchiCegarLoop]: Abstraction has 822 states and 985 transitions. 176.10/129.75 [2019-03-28 12:47:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states and 985 transitions. 176.10/129.75 [2019-03-28 12:47:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 62. 176.10/129.75 [2019-03-28 12:47:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. 176.10/129.75 [2019-03-28 12:47:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. 176.10/129.75 [2019-03-28 12:47:16,112 INFO L729 BuchiCegarLoop]: Abstraction has 62 states and 87 transitions. 176.10/129.75 [2019-03-28 12:47:16,112 INFO L609 BuchiCegarLoop]: Abstraction has 62 states and 87 transitions. 176.10/129.75 [2019-03-28 12:47:16,112 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 176.10/129.75 [2019-03-28 12:47:16,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 87 transitions. 176.10/129.75 [2019-03-28 12:47:16,113 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 176.10/129.75 [2019-03-28 12:47:16,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 176.10/129.75 [2019-03-28 12:47:16,113 INFO L119 BuchiIsEmpty]: Starting construction of run 176.10/129.75 [2019-03-28 12:47:16,114 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:47:16,114 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:47:16,114 INFO L794 eck$LassoCheckResult]: Stem: 6138#ULTIMATE.startENTRY [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 6132#L-1 [142] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (> |v_ULTIMATE.start_f_#t~malloc3.base_1| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 6134#L11 [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 6136#L11-1 [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 6137#L12 [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 6143#L13 [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 6123#L15-2 176.10/129.75 [2019-03-28 12:47:16,115 INFO L796 eck$LassoCheckResult]: Loop: 6123#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 6150#L15 [176] L15-->L16: Formula: (> |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 6126#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 6127#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 6147#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 6148#L16-4 [189] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (< |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 1)) |v_#memory_int_14|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 6139#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 6129#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 6122#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 6123#L15-2 176.10/129.75 [2019-03-28 12:47:16,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:47:16,116 INFO L82 PathProgramCache]: Analyzing trace with hash -582263696, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:47:16,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:47:16,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:47:16,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:16,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:16,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:16,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:47:16,142 INFO L82 PathProgramCache]: Analyzing trace with hash -564015458, now seen corresponding path program 2 times 176.10/129.75 [2019-03-28 12:47:16,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:47:16,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:47:16,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:16,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:16,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:16,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:47:16,158 INFO L82 PathProgramCache]: Analyzing trace with hash 368443151, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:47:16,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:47:16,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:47:16,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:16,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:16,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:16,305 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 176.10/129.75 [2019-03-28 12:47:17,085 WARN L188 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 176.10/129.75 [2019-03-28 12:47:17,436 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 104 176.10/129.75 [2019-03-28 12:47:17,441 INFO L216 LassoAnalysis]: Preferences: 176.10/129.75 [2019-03-28 12:47:17,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 176.10/129.75 [2019-03-28 12:47:17,441 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 176.10/129.75 [2019-03-28 12:47:17,441 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 176.10/129.75 [2019-03-28 12:47:17,441 INFO L127 ssoRankerPreferences]: Use exernal solver: false 176.10/129.75 [2019-03-28 12:47:17,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 176.10/129.75 [2019-03-28 12:47:17,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 176.10/129.75 [2019-03-28 12:47:17,442 INFO L130 ssoRankerPreferences]: Path of dumped script: 176.10/129.75 [2019-03-28 12:47:17,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 176.10/129.75 [2019-03-28 12:47:17,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 176.10/129.75 [2019-03-28 12:47:17,442 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 176.10/129.75 [2019-03-28 12:47:17,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:17,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:17,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:17,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:17,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:17,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:17,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:18,023 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 90 176.10/129.75 [2019-03-28 12:47:18,183 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 176.10/129.75 [2019-03-28 12:47:18,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:18,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:18,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:18,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:18,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:18,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:18,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:18,326 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 176.10/129.75 [2019-03-28 12:47:18,719 INFO L300 LassoAnalysis]: Preprocessing complete. 176.10/129.75 [2019-03-28 12:47:18,720 INFO L497 LassoAnalysis]: Using template 'affine'. 176.10/129.75 [2019-03-28 12:47:18,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:18,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:18,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:47:18,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:18,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:18,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:18,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:18,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:18,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:18,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:18,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:18,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:18,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:18,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:18,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:18,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:18,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:18,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:18,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:18,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:47:18,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:18,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:18,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:18,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:18,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:18,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:18,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:18,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:18,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:18,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:18,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:18,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:18,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:18,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:18,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:18,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:18,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:47:18,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:18,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:18,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:18,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:18,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:18,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:18,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:18,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:18,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:18,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:18,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:18,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:18,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:18,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:18,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:18,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:18,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:18,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:18,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:18,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:18,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:18,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:18,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:18,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:18,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:18,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:18,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:18,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:18,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:18,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:18,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:18,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:18,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:18,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:18,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:18,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:18,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:18,783 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 176.10/129.75 [2019-03-28 12:47:18,790 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 176.10/129.75 [2019-03-28 12:47:18,790 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 176.10/129.75 [2019-03-28 12:47:18,791 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 176.10/129.75 [2019-03-28 12:47:18,792 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 176.10/129.75 [2019-03-28 12:47:18,792 INFO L518 LassoAnalysis]: Proved termination. 176.10/129.75 [2019-03-28 12:47:18,792 INFO L520 LassoAnalysis]: Termination argument consisting of: 176.10/129.75 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_2 176.10/129.75 Supporting invariants [] 176.10/129.75 [2019-03-28 12:47:18,976 INFO L297 tatePredicateManager]: 38 out of 42 supporting invariants were superfluous and have been removed 176.10/129.75 [2019-03-28 12:47:18,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 176.10/129.75 [2019-03-28 12:47:18,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 176.10/129.75 [2019-03-28 12:47:19,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:47:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:47:19,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core 176.10/129.75 [2019-03-28 12:47:19,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.75 [2019-03-28 12:47:19,042 INFO L189 IndexEqualityManager]: detected not equals via solver 176.10/129.75 [2019-03-28 12:47:19,047 INFO L189 IndexEqualityManager]: detected not equals via solver 176.10/129.75 [2019-03-28 12:47:19,059 INFO L189 IndexEqualityManager]: detected not equals via solver 176.10/129.75 [2019-03-28 12:47:19,070 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:47:19,071 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 176.10/129.75 [2019-03-28 12:47:19,072 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:19,091 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:47:19,091 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:19,091 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 176.10/129.75 [2019-03-28 12:47:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:47:19,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core 176.10/129.75 [2019-03-28 12:47:19,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.75 [2019-03-28 12:47:19,256 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:47:19,256 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 176.10/129.75 [2019-03-28 12:47:19,257 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:19,291 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 176.10/129.75 [2019-03-28 12:47:19,292 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:19,292 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 176.10/129.75 [2019-03-28 12:47:19,407 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:47:19,407 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 71 176.10/129.75 [2019-03-28 12:47:19,413 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:19,479 INFO L497 ElimStorePlain]: treesize reduction 45, result has 61.2 percent of original size 176.10/129.75 [2019-03-28 12:47:19,480 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:19,481 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:70 176.10/129.75 [2019-03-28 12:47:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.75 [2019-03-28 12:47:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:20,567 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.75 [2019-03-28 12:47:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:20,579 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.75 [2019-03-28 12:47:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:20,590 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.75 [2019-03-28 12:47:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:47:20,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core 176.10/129.75 [2019-03-28 12:47:20,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.75 [2019-03-28 12:47:20,711 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:47:20,711 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 70 176.10/129.75 [2019-03-28 12:47:20,716 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:20,776 INFO L497 ElimStorePlain]: treesize reduction 47, result has 57.7 percent of original size 176.10/129.75 [2019-03-28 12:47:20,778 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:20,778 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:58 176.10/129.75 [2019-03-28 12:47:27,501 WARN L188 SmtUtils]: Spent 3.72 s on a formula simplification that was a NOOP. DAG size: 38 176.10/129.75 [2019-03-28 12:47:27,527 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:47:27,528 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 176.10/129.75 [2019-03-28 12:47:27,529 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:27,553 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 176.10/129.75 [2019-03-28 12:47:27,554 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:27,554 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 176.10/129.75 [2019-03-28 12:47:28,616 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_f_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_f_~c~0.base c_ULTIMATE.start_f_~x_ref~0.base) (= c_ULTIMATE.start_f_~x_ref~0.offset ULTIMATE.start_f_~c~0.offset)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~y_ref~0.base) c_ULTIMATE.start_f_~y_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~c~0.base) c_ULTIMATE.start_f_~x_ref~0.offset) c_oldRank0))) is different from true 176.10/129.75 [2019-03-28 12:47:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:28,629 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.75 [2019-03-28 12:47:28,630 INFO L98 LoopCannibalizer]: 29 predicates before loop cannibalization 33 predicates after loop cannibalization 176.10/129.75 [2019-03-28 12:47:28,630 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 33 loop predicates 176.10/129.75 [2019-03-28 12:47:28,630 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 62 states and 87 transitions. cyclomatic complexity: 28 Second operand 10 states. 176.10/129.75 [2019-03-28 12:47:32,724 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 176.10/129.75 [2019-03-28 12:47:34,324 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 176.10/129.75 [2019-03-28 12:47:43,314 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 62 states and 87 transitions. cyclomatic complexity: 28. Second operand 10 states. Result 1468 states and 1795 transitions. Complement of second has 827 states. 176.10/129.75 [2019-03-28 12:47:43,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 118 states 9 stem states 106 non-accepting loop states 3 accepting loop states 176.10/129.75 [2019-03-28 12:47:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 176.10/129.75 [2019-03-28 12:47:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 310 transitions. 176.10/129.75 [2019-03-28 12:47:43,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 310 transitions. Stem has 6 letters. Loop has 9 letters. 176.10/129.75 [2019-03-28 12:47:43,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.75 [2019-03-28 12:47:43,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 310 transitions. Stem has 15 letters. Loop has 9 letters. 176.10/129.75 [2019-03-28 12:47:43,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.75 [2019-03-28 12:47:43,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 310 transitions. Stem has 6 letters. Loop has 18 letters. 176.10/129.75 [2019-03-28 12:47:43,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.75 [2019-03-28 12:47:43,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1468 states and 1795 transitions. 176.10/129.75 [2019-03-28 12:47:43,339 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 458 176.10/129.75 [2019-03-28 12:47:43,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1468 states to 798 states and 969 transitions. 176.10/129.75 [2019-03-28 12:47:43,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 176.10/129.75 [2019-03-28 12:47:43,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 676 176.10/129.75 [2019-03-28 12:47:43,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 798 states and 969 transitions. 176.10/129.75 [2019-03-28 12:47:43,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 176.10/129.75 [2019-03-28 12:47:43,345 INFO L706 BuchiCegarLoop]: Abstraction has 798 states and 969 transitions. 176.10/129.75 [2019-03-28 12:47:43,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states and 969 transitions. 176.10/129.75 [2019-03-28 12:47:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 62. 176.10/129.75 [2019-03-28 12:47:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. 176.10/129.75 [2019-03-28 12:47:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. 176.10/129.75 [2019-03-28 12:47:43,353 INFO L729 BuchiCegarLoop]: Abstraction has 62 states and 87 transitions. 176.10/129.75 [2019-03-28 12:47:43,353 INFO L609 BuchiCegarLoop]: Abstraction has 62 states and 87 transitions. 176.10/129.75 [2019-03-28 12:47:43,353 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 176.10/129.75 [2019-03-28 12:47:43,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 87 transitions. 176.10/129.75 [2019-03-28 12:47:43,354 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 176.10/129.75 [2019-03-28 12:47:43,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 176.10/129.75 [2019-03-28 12:47:43,354 INFO L119 BuchiIsEmpty]: Starting construction of run 176.10/129.75 [2019-03-28 12:47:43,354 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:47:43,354 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 176.10/129.75 [2019-03-28 12:47:43,355 INFO L794 eck$LassoCheckResult]: Stem: 9027#ULTIMATE.startENTRY [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9021#L-1 [140] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 9023#L11 [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 9025#L11-1 [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 9026#L12 [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 9032#L13 [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 9014#L15-2 176.10/129.75 [2019-03-28 12:47:43,356 INFO L796 eck$LassoCheckResult]: Loop: 9014#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 9009#L15 [176] L15-->L16: Formula: (> |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 9010#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 9017#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 9036#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 9037#L16-4 [189] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (< |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 1)) |v_#memory_int_14|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 9028#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 9019#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 9013#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 9014#L15-2 176.10/129.75 [2019-03-28 12:47:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:47:43,356 INFO L82 PathProgramCache]: Analyzing trace with hash -584110738, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:47:43,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:47:43,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:47:43,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:43,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:43,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:43,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:47:43,379 INFO L82 PathProgramCache]: Analyzing trace with hash -564015458, now seen corresponding path program 3 times 176.10/129.75 [2019-03-28 12:47:43,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:47:43,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:47:43,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:43,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:43,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:43,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:47:43,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1379560401, now seen corresponding path program 1 times 176.10/129.75 [2019-03-28 12:47:43,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.75 [2019-03-28 12:47:43,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.75 [2019-03-28 12:47:43,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:43,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:43,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.75 [2019-03-28 12:47:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:43,533 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 74 176.10/129.75 [2019-03-28 12:47:44,009 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 101 176.10/129.75 [2019-03-28 12:47:44,217 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 93 176.10/129.75 [2019-03-28 12:47:44,221 INFO L216 LassoAnalysis]: Preferences: 176.10/129.75 [2019-03-28 12:47:44,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 176.10/129.75 [2019-03-28 12:47:44,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 176.10/129.75 [2019-03-28 12:47:44,222 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 176.10/129.75 [2019-03-28 12:47:44,222 INFO L127 ssoRankerPreferences]: Use exernal solver: false 176.10/129.75 [2019-03-28 12:47:44,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 176.10/129.75 [2019-03-28 12:47:44,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 176.10/129.75 [2019-03-28 12:47:44,222 INFO L130 ssoRankerPreferences]: Path of dumped script: 176.10/129.75 [2019-03-28 12:47:44,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 176.10/129.75 [2019-03-28 12:47:44,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 176.10/129.75 [2019-03-28 12:47:44,223 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 176.10/129.75 [2019-03-28 12:47:44,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:44,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:44,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:44,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:44,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:44,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:44,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:44,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:44,668 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 176.10/129.75 [2019-03-28 12:47:44,823 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 176.10/129.75 [2019-03-28 12:47:44,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:44,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:44,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:44,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:44,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.75 [2019-03-28 12:47:45,289 INFO L300 LassoAnalysis]: Preprocessing complete. 176.10/129.75 [2019-03-28 12:47:45,289 INFO L497 LassoAnalysis]: Using template 'affine'. 176.10/129.75 [2019-03-28 12:47:45,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:45,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:45,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:47:45,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:45,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:45,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:45,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:45,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:45,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:45,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:45,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:45,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:47:45,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:45,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:45,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:45,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:45,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:45,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:45,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:45,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:45,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:45,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:45,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:45,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:45,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:45,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:45,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:45,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:45,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:47:45,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:45,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:45,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:45,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:45,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:45,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:45,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:45,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:45,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:45,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:45,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:45,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:45,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:45,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:45,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:45,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:45,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.75 [2019-03-28 12:47:45,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:45,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:45,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:45,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:45,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:45,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:45,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:45,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:45,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:45,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:45,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:45,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:45,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:45,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:45,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:45,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:45,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:45,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:45,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:45,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:45,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:45,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:45,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:45,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:45,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:45,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:45,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:45,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:45,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:45,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:45,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:45,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:45,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:45,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:45,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:45,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:45,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:45,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:45,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:45,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:45,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:45,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:45,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:45,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:45,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:45,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.75 [2019-03-28 12:47:45,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.75 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.75 Number of strict supporting invariants: 0 176.10/129.75 Number of non-strict supporting invariants: 1 176.10/129.75 Consider only non-deceasing supporting invariants: true 176.10/129.75 Simplify termination arguments: true 176.10/129.75 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.75 [2019-03-28 12:47:45,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.75 [2019-03-28 12:47:45,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.75 [2019-03-28 12:47:45,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.75 [2019-03-28 12:47:45,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.75 [2019-03-28 12:47:45,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.75 [2019-03-28 12:47:45,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.75 [2019-03-28 12:47:45,346 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 176.10/129.75 [2019-03-28 12:47:45,353 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 176.10/129.75 [2019-03-28 12:47:45,353 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 176.10/129.75 [2019-03-28 12:47:45,354 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 176.10/129.75 [2019-03-28 12:47:45,354 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 176.10/129.75 [2019-03-28 12:47:45,376 INFO L518 LassoAnalysis]: Proved termination. 176.10/129.75 [2019-03-28 12:47:45,376 INFO L520 LassoAnalysis]: Termination argument consisting of: 176.10/129.75 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_3 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_3 176.10/129.75 Supporting invariants [] 176.10/129.75 [2019-03-28 12:47:45,546 INFO L297 tatePredicateManager]: 38 out of 42 supporting invariants were superfluous and have been removed 176.10/129.75 [2019-03-28 12:47:45,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 176.10/129.75 [2019-03-28 12:47:45,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 176.10/129.75 [2019-03-28 12:47:45,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.75 [2019-03-28 12:47:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:47:45,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core 176.10/129.75 [2019-03-28 12:47:45,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.75 [2019-03-28 12:47:45,597 INFO L189 IndexEqualityManager]: detected not equals via solver 176.10/129.75 [2019-03-28 12:47:45,598 INFO L189 IndexEqualityManager]: detected not equals via solver 176.10/129.75 [2019-03-28 12:47:45,601 INFO L189 IndexEqualityManager]: detected not equals via solver 176.10/129.75 [2019-03-28 12:47:45,608 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:47:45,609 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 176.10/129.75 [2019-03-28 12:47:45,609 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:45,622 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:47:45,622 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:45,623 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 176.10/129.75 [2019-03-28 12:47:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:47:45,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core 176.10/129.75 [2019-03-28 12:47:45,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.75 [2019-03-28 12:47:45,736 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:47:45,736 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 176.10/129.75 [2019-03-28 12:47:45,737 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:45,762 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 176.10/129.75 [2019-03-28 12:47:45,762 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:45,762 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 176.10/129.75 [2019-03-28 12:47:45,846 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:47:45,846 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 71 176.10/129.75 [2019-03-28 12:47:45,851 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:45,912 INFO L497 ElimStorePlain]: treesize reduction 45, result has 61.2 percent of original size 176.10/129.75 [2019-03-28 12:47:45,913 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:45,914 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:70 176.10/129.75 [2019-03-28 12:47:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.75 [2019-03-28 12:47:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:46,991 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.75 [2019-03-28 12:47:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:47,001 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.75 [2019-03-28 12:47:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:47,011 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.75 [2019-03-28 12:47:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.75 [2019-03-28 12:47:47,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core 176.10/129.75 [2019-03-28 12:47:47,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.75 [2019-03-28 12:47:47,102 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:47:47,103 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 70 176.10/129.75 [2019-03-28 12:47:47,107 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:47,168 INFO L497 ElimStorePlain]: treesize reduction 47, result has 57.7 percent of original size 176.10/129.75 [2019-03-28 12:47:47,170 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:47,170 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:58 176.10/129.75 [2019-03-28 12:47:53,979 WARN L188 SmtUtils]: Spent 3.75 s on a formula simplification that was a NOOP. DAG size: 38 176.10/129.75 [2019-03-28 12:47:54,007 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.75 [2019-03-28 12:47:54,008 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 176.10/129.75 [2019-03-28 12:47:54,009 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:54,038 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 176.10/129.75 [2019-03-28 12:47:54,038 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 176.10/129.75 [2019-03-28 12:47:54,038 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 176.10/129.75 [2019-03-28 12:47:55,103 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_f_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_f_~c~0.base c_ULTIMATE.start_f_~x_ref~0.base) (= c_ULTIMATE.start_f_~x_ref~0.offset ULTIMATE.start_f_~c~0.offset)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~y_ref~0.base) c_ULTIMATE.start_f_~y_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~c~0.base) c_ULTIMATE.start_f_~x_ref~0.offset) c_oldRank0))) is different from true 176.10/129.75 [2019-03-28 12:47:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.75 [2019-03-28 12:47:55,116 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.75 [2019-03-28 12:47:55,116 INFO L98 LoopCannibalizer]: 29 predicates before loop cannibalization 33 predicates after loop cannibalization 176.10/129.76 [2019-03-28 12:47:55,116 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 33 loop predicates 176.10/129.76 [2019-03-28 12:47:55,116 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 62 states and 87 transitions. cyclomatic complexity: 28 Second operand 10 states. 176.10/129.76 [2019-03-28 12:47:59,128 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 176.10/129.76 [2019-03-28 12:48:00,515 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 176.10/129.76 [2019-03-28 12:48:09,438 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 62 states and 87 transitions. cyclomatic complexity: 28. Second operand 10 states. Result 1637 states and 1997 transitions. Complement of second has 827 states. 176.10/129.76 [2019-03-28 12:48:09,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 118 states 9 stem states 106 non-accepting loop states 3 accepting loop states 176.10/129.76 [2019-03-28 12:48:09,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 176.10/129.76 [2019-03-28 12:48:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 310 transitions. 176.10/129.76 [2019-03-28 12:48:09,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 310 transitions. Stem has 6 letters. Loop has 9 letters. 176.10/129.76 [2019-03-28 12:48:09,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.76 [2019-03-28 12:48:09,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 310 transitions. Stem has 15 letters. Loop has 9 letters. 176.10/129.76 [2019-03-28 12:48:09,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.76 [2019-03-28 12:48:09,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 310 transitions. Stem has 6 letters. Loop has 18 letters. 176.10/129.76 [2019-03-28 12:48:09,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.76 [2019-03-28 12:48:09,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1637 states and 1997 transitions. 176.10/129.76 [2019-03-28 12:48:09,461 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 467 176.10/129.76 [2019-03-28 12:48:09,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1637 states to 888 states and 1077 transitions. 176.10/129.76 [2019-03-28 12:48:09,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 679 176.10/129.76 [2019-03-28 12:48:09,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 695 176.10/129.76 [2019-03-28 12:48:09,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 888 states and 1077 transitions. 176.10/129.76 [2019-03-28 12:48:09,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 176.10/129.76 [2019-03-28 12:48:09,469 INFO L706 BuchiCegarLoop]: Abstraction has 888 states and 1077 transitions. 176.10/129.76 [2019-03-28 12:48:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states and 1077 transitions. 176.10/129.76 [2019-03-28 12:48:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 77. 176.10/129.76 [2019-03-28 12:48:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. 176.10/129.76 [2019-03-28 12:48:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. 176.10/129.76 [2019-03-28 12:48:09,477 INFO L729 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. 176.10/129.76 [2019-03-28 12:48:09,477 INFO L609 BuchiCegarLoop]: Abstraction has 77 states and 104 transitions. 176.10/129.76 [2019-03-28 12:48:09,477 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 176.10/129.76 [2019-03-28 12:48:09,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 104 transitions. 176.10/129.76 [2019-03-28 12:48:09,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 176.10/129.76 [2019-03-28 12:48:09,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 176.10/129.76 [2019-03-28 12:48:09,478 INFO L119 BuchiIsEmpty]: Starting construction of run 176.10/129.76 [2019-03-28 12:48:09,479 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 176.10/129.76 [2019-03-28 12:48:09,479 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 176.10/129.76 [2019-03-28 12:48:09,480 INFO L794 eck$LassoCheckResult]: Stem: 12089#ULTIMATE.startENTRY [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12082#L-1 [139] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 12084#L11 [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 12107#L11-1 [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 12106#L12 [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 12100#L13 [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 12074#L15-2 176.10/129.76 [2019-03-28 12:48:09,480 INFO L796 eck$LassoCheckResult]: Loop: 12074#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 12069#L15 [176] L15-->L16: Formula: (> |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 12070#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 12077#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 12096#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 12097#L16-4 [189] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (< |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 1)) |v_#memory_int_14|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 12090#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 12079#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 12073#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 12074#L15-2 176.10/129.76 [2019-03-28 12:48:09,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.76 [2019-03-28 12:48:09,480 INFO L82 PathProgramCache]: Analyzing trace with hash -585034259, now seen corresponding path program 1 times 176.10/129.76 [2019-03-28 12:48:09,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.76 [2019-03-28 12:48:09,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.76 [2019-03-28 12:48:09,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:09,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:09,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:09,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.76 [2019-03-28 12:48:09,502 INFO L82 PathProgramCache]: Analyzing trace with hash -564015458, now seen corresponding path program 4 times 176.10/129.76 [2019-03-28 12:48:09,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.76 [2019-03-28 12:48:09,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.76 [2019-03-28 12:48:09,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:09,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:09,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:09,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.76 [2019-03-28 12:48:09,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1885119026, now seen corresponding path program 1 times 176.10/129.76 [2019-03-28 12:48:09,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.76 [2019-03-28 12:48:09,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.76 [2019-03-28 12:48:09,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:09,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:09,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:10,197 WARN L188 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 176.10/129.76 [2019-03-28 12:48:10,411 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 99 176.10/129.76 [2019-03-28 12:48:10,415 INFO L216 LassoAnalysis]: Preferences: 176.10/129.76 [2019-03-28 12:48:10,415 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 176.10/129.76 [2019-03-28 12:48:10,415 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 176.10/129.76 [2019-03-28 12:48:10,415 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 176.10/129.76 [2019-03-28 12:48:10,415 INFO L127 ssoRankerPreferences]: Use exernal solver: false 176.10/129.76 [2019-03-28 12:48:10,415 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 176.10/129.76 [2019-03-28 12:48:10,415 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 176.10/129.76 [2019-03-28 12:48:10,416 INFO L130 ssoRankerPreferences]: Path of dumped script: 176.10/129.76 [2019-03-28 12:48:10,416 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 176.10/129.76 [2019-03-28 12:48:10,416 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 176.10/129.76 [2019-03-28 12:48:10,416 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 176.10/129.76 [2019-03-28 12:48:10,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:10,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:10,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:10,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:10,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:10,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:10,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:10,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:10,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:10,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:10,911 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 176.10/129.76 [2019-03-28 12:48:11,068 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 176.10/129.76 [2019-03-28 12:48:11,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:11,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:11,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:11,547 INFO L300 LassoAnalysis]: Preprocessing complete. 176.10/129.76 [2019-03-28 12:48:11,547 INFO L497 LassoAnalysis]: Using template 'affine'. 176.10/129.76 [2019-03-28 12:48:11,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.76 [2019-03-28 12:48:11,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:11,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,551 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,551 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:11,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.76 [2019-03-28 12:48:11,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:11,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.76 [2019-03-28 12:48:11,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:11,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,557 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:11,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.76 [2019-03-28 12:48:11,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:11,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.76 [2019-03-28 12:48:11,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:11,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.76 [2019-03-28 12:48:11,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:11,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.76 [2019-03-28 12:48:11,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:11,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:11,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:11,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:11,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:11,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:11,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:11,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:11,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:11,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:11,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:11,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:11,602 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 176.10/129.76 [2019-03-28 12:48:11,607 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 176.10/129.76 [2019-03-28 12:48:11,607 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 176.10/129.76 [2019-03-28 12:48:11,607 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 176.10/129.76 [2019-03-28 12:48:11,608 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 176.10/129.76 [2019-03-28 12:48:11,608 INFO L518 LassoAnalysis]: Proved termination. 176.10/129.76 [2019-03-28 12:48:11,608 INFO L520 LassoAnalysis]: Termination argument consisting of: 176.10/129.76 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y_ref~0.base) ULTIMATE.start_f_~y_ref~0.offset)_4 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~x_ref~0.base) ULTIMATE.start_f_~x_ref~0.offset)_4 176.10/129.76 Supporting invariants [] 176.10/129.76 [2019-03-28 12:48:11,800 INFO L297 tatePredicateManager]: 38 out of 42 supporting invariants were superfluous and have been removed 176.10/129.76 [2019-03-28 12:48:11,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 176.10/129.76 [2019-03-28 12:48:11,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 176.10/129.76 [2019-03-28 12:48:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.76 [2019-03-28 12:48:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.76 [2019-03-28 12:48:11,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core 176.10/129.76 [2019-03-28 12:48:11,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.76 [2019-03-28 12:48:11,876 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.76 [2019-03-28 12:48:11,876 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 176.10/129.76 [2019-03-28 12:48:11,877 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:11,892 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.76 [2019-03-28 12:48:11,892 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:11,892 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:29 176.10/129.76 [2019-03-28 12:48:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.76 [2019-03-28 12:48:11,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core 176.10/129.76 [2019-03-28 12:48:11,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.76 [2019-03-28 12:48:12,030 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.76 [2019-03-28 12:48:12,031 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 176.10/129.76 [2019-03-28 12:48:12,032 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:12,063 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 176.10/129.76 [2019-03-28 12:48:12,064 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:12,064 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 176.10/129.76 [2019-03-28 12:48:12,165 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.76 [2019-03-28 12:48:12,166 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 71 176.10/129.76 [2019-03-28 12:48:12,170 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:12,235 INFO L497 ElimStorePlain]: treesize reduction 70, result has 50.0 percent of original size 176.10/129.76 [2019-03-28 12:48:12,236 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:12,236 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:70 176.10/129.76 [2019-03-28 12:48:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.76 [2019-03-28 12:48:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:13,254 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.76 [2019-03-28 12:48:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:13,263 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.76 [2019-03-28 12:48:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:13,272 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.76 [2019-03-28 12:48:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.76 [2019-03-28 12:48:13,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core 176.10/129.76 [2019-03-28 12:48:13,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.76 [2019-03-28 12:48:13,364 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.76 [2019-03-28 12:48:13,364 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 70 176.10/129.76 [2019-03-28 12:48:13,368 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:13,427 INFO L497 ElimStorePlain]: treesize reduction 47, result has 57.7 percent of original size 176.10/129.76 [2019-03-28 12:48:13,429 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:13,429 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:58 176.10/129.76 [2019-03-28 12:48:22,234 WARN L188 SmtUtils]: Spent 3.78 s on a formula simplification that was a NOOP. DAG size: 38 176.10/129.76 [2019-03-28 12:48:22,261 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.76 [2019-03-28 12:48:22,261 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 47 176.10/129.76 [2019-03-28 12:48:22,262 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:22,287 INFO L497 ElimStorePlain]: treesize reduction 20, result has 67.2 percent of original size 176.10/129.76 [2019-03-28 12:48:22,287 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:22,287 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 176.10/129.76 [2019-03-28 12:48:23,368 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_f_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_f_~c~0.base c_ULTIMATE.start_f_~x_ref~0.base) (= c_ULTIMATE.start_f_~x_ref~0.offset ULTIMATE.start_f_~c~0.offset)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~y_ref~0.base) c_ULTIMATE.start_f_~y_ref~0.offset) 1) (+ (select (select |c_#memory_int| c_ULTIMATE.start_f_~c~0.base) c_ULTIMATE.start_f_~x_ref~0.offset) c_oldRank0))) is different from true 176.10/129.76 [2019-03-28 12:48:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:23,381 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.76 [2019-03-28 12:48:23,381 INFO L98 LoopCannibalizer]: 29 predicates before loop cannibalization 33 predicates after loop cannibalization 176.10/129.76 [2019-03-28 12:48:23,381 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 33 loop predicates 176.10/129.76 [2019-03-28 12:48:23,382 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 77 states and 104 transitions. cyclomatic complexity: 30 Second operand 10 states. 176.10/129.76 [2019-03-28 12:48:25,580 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 176.10/129.76 [2019-03-28 12:48:27,636 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 176.10/129.76 [2019-03-28 12:48:33,816 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 77 states and 104 transitions. cyclomatic complexity: 30. Second operand 10 states. Result 270 states and 341 transitions. Complement of second has 120 states. 176.10/129.76 [2019-03-28 12:48:33,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 62 states 2 stem states 58 non-accepting loop states 2 accepting loop states 176.10/129.76 [2019-03-28 12:48:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 176.10/129.76 [2019-03-28 12:48:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 122 transitions. 176.10/129.76 [2019-03-28 12:48:33,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 122 transitions. Stem has 6 letters. Loop has 9 letters. 176.10/129.76 [2019-03-28 12:48:33,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.76 [2019-03-28 12:48:33,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 122 transitions. Stem has 15 letters. Loop has 9 letters. 176.10/129.76 [2019-03-28 12:48:33,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.76 [2019-03-28 12:48:33,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 122 transitions. Stem has 6 letters. Loop has 18 letters. 176.10/129.76 [2019-03-28 12:48:33,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.76 [2019-03-28 12:48:33,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 341 transitions. 176.10/129.76 [2019-03-28 12:48:33,829 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 67 176.10/129.76 [2019-03-28 12:48:33,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 168 states and 214 transitions. 176.10/129.76 [2019-03-28 12:48:33,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 176.10/129.76 [2019-03-28 12:48:33,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 176.10/129.76 [2019-03-28 12:48:33,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 214 transitions. 176.10/129.76 [2019-03-28 12:48:33,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 176.10/129.76 [2019-03-28 12:48:33,831 INFO L706 BuchiCegarLoop]: Abstraction has 168 states and 214 transitions. 176.10/129.76 [2019-03-28 12:48:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 214 transitions. 176.10/129.76 [2019-03-28 12:48:33,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 58. 176.10/129.76 [2019-03-28 12:48:33,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. 176.10/129.76 [2019-03-28 12:48:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. 176.10/129.76 [2019-03-28 12:48:33,835 INFO L729 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. 176.10/129.76 [2019-03-28 12:48:33,835 INFO L609 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. 176.10/129.76 [2019-03-28 12:48:33,835 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 176.10/129.76 [2019-03-28 12:48:33,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. 176.10/129.76 [2019-03-28 12:48:33,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 176.10/129.76 [2019-03-28 12:48:33,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 176.10/129.76 [2019-03-28 12:48:33,836 INFO L119 BuchiIsEmpty]: Starting construction of run 176.10/129.76 [2019-03-28 12:48:33,836 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 176.10/129.76 [2019-03-28 12:48:33,836 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 176.10/129.76 [2019-03-28 12:48:33,837 INFO L794 eck$LassoCheckResult]: Stem: 12972#ULTIMATE.startENTRY [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12967#L-1 [143] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (> |v_ULTIMATE.start_f_#t~malloc3.base_1| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 12968#L11 [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 12977#L11-1 [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 12982#L12 [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 12983#L13 [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 13000#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13001#L15 176.10/129.76 [2019-03-28 12:48:33,837 INFO L796 eck$LassoCheckResult]: Loop: 13001#L15 [176] L15-->L16: Formula: (> |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13005#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13004#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 12984#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 12978#L16-4 [190] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 0)) |v_#memory_int_14|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (>= |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 12979#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13011#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 13010#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 13009#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13001#L15 176.10/129.76 [2019-03-28 12:48:33,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.76 [2019-03-28 12:48:33,838 INFO L82 PathProgramCache]: Analyzing trace with hash -841676136, now seen corresponding path program 1 times 176.10/129.76 [2019-03-28 12:48:33,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.76 [2019-03-28 12:48:33,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.76 [2019-03-28 12:48:33,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:33,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:33,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:33,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.76 [2019-03-28 12:48:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash 455833011, now seen corresponding path program 1 times 176.10/129.76 [2019-03-28 12:48:33,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.76 [2019-03-28 12:48:33,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.76 [2019-03-28 12:48:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:33,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:33,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.76 [2019-03-28 12:48:33,867 INFO L82 PathProgramCache]: Analyzing trace with hash 45311228, now seen corresponding path program 1 times 176.10/129.76 [2019-03-28 12:48:33,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.76 [2019-03-28 12:48:33,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.76 [2019-03-28 12:48:33,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:33,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:33,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:33,994 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 75 176.10/129.76 [2019-03-28 12:48:34,552 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 110 176.10/129.76 [2019-03-28 12:48:34,793 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 102 176.10/129.76 [2019-03-28 12:48:34,797 INFO L216 LassoAnalysis]: Preferences: 176.10/129.76 [2019-03-28 12:48:34,797 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 176.10/129.76 [2019-03-28 12:48:34,797 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 176.10/129.76 [2019-03-28 12:48:34,797 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 176.10/129.76 [2019-03-28 12:48:34,797 INFO L127 ssoRankerPreferences]: Use exernal solver: false 176.10/129.76 [2019-03-28 12:48:34,798 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 176.10/129.76 [2019-03-28 12:48:34,798 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 176.10/129.76 [2019-03-28 12:48:34,798 INFO L130 ssoRankerPreferences]: Path of dumped script: 176.10/129.76 [2019-03-28 12:48:34,798 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 176.10/129.76 [2019-03-28 12:48:34,798 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 176.10/129.76 [2019-03-28 12:48:34,798 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 176.10/129.76 [2019-03-28 12:48:34,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:34,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:35,292 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 94 176.10/129.76 [2019-03-28 12:48:35,469 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 176.10/129.76 [2019-03-28 12:48:35,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:35,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:35,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:35,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:35,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:35,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:35,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:35,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:35,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:35,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 176.10/129.76 [2019-03-28 12:48:35,659 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 176.10/129.76 [2019-03-28 12:48:36,082 INFO L300 LassoAnalysis]: Preprocessing complete. 176.10/129.76 [2019-03-28 12:48:36,082 INFO L497 LassoAnalysis]: Using template 'affine'. 176.10/129.76 [2019-03-28 12:48:36,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:36,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:36,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 176.10/129.76 [2019-03-28 12:48:36,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:36,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:36,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:36,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:36,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:36,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:36,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:36,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:36,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:36,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:36,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:36,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:36,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:36,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:36,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:36,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:36,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:36,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:36,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:36,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:36,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:36,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:36,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:36,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:36,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:36,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:36,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:36,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:36,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:36,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:36,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:36,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:36,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:36,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:36,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:36,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:36,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:36,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:36,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:36,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:36,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:36,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:36,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:36,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:36,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:36,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:36,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:36,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:36,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:36,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:36,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:36,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:36,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:36,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:36,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:36,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:36,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:36,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:36,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:36,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:36,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:36,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:36,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:36,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:36,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:36,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:36,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:36,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:36,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:36,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 176.10/129.76 [2019-03-28 12:48:36,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 176.10/129.76 Termination analysis: LINEAR_WITH_GUESSES 176.10/129.76 Number of strict supporting invariants: 0 176.10/129.76 Number of non-strict supporting invariants: 1 176.10/129.76 Consider only non-deceasing supporting invariants: true 176.10/129.76 Simplify termination arguments: true 176.10/129.76 Simplify supporting invariants: trueOverapproximate stem: false 176.10/129.76 [2019-03-28 12:48:36,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. 176.10/129.76 [2019-03-28 12:48:36,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 176.10/129.76 [2019-03-28 12:48:36,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 176.10/129.76 [2019-03-28 12:48:36,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 176.10/129.76 [2019-03-28 12:48:36,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 176.10/129.76 [2019-03-28 12:48:36,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 176.10/129.76 [2019-03-28 12:48:36,144 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 176.10/129.76 [2019-03-28 12:48:36,148 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 176.10/129.76 [2019-03-28 12:48:36,148 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. 176.10/129.76 [2019-03-28 12:48:36,148 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 176.10/129.76 [2019-03-28 12:48:36,149 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 176.10/129.76 [2019-03-28 12:48:36,149 INFO L518 LassoAnalysis]: Proved termination. 176.10/129.76 [2019-03-28 12:48:36,149 INFO L520 LassoAnalysis]: Termination argument consisting of: 176.10/129.76 Ranking function f(ULTIMATE.start_f_#t~mem8) = 1*ULTIMATE.start_f_#t~mem8 176.10/129.76 Supporting invariants [] 176.10/129.76 [2019-03-28 12:48:36,308 INFO L297 tatePredicateManager]: 41 out of 42 supporting invariants were superfluous and have been removed 176.10/129.76 [2019-03-28 12:48:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.76 [2019-03-28 12:48:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.76 [2019-03-28 12:48:36,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core 176.10/129.76 [2019-03-28 12:48:36,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.76 [2019-03-28 12:48:36,360 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 176.10/129.76 [2019-03-28 12:48:36,360 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:36,367 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.76 [2019-03-28 12:48:36,368 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:36,368 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:6 176.10/129.76 [2019-03-28 12:48:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.76 [2019-03-28 12:48:36,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core 176.10/129.76 [2019-03-28 12:48:36,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.76 [2019-03-28 12:48:36,398 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 176.10/129.76 [2019-03-28 12:48:36,398 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:36,404 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.76 [2019-03-28 12:48:36,404 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:36,404 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 176.10/129.76 [2019-03-28 12:48:36,452 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 176.10/129.76 [2019-03-28 12:48:36,453 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:36,460 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.76 [2019-03-28 12:48:36,461 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:36,461 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:15 176.10/129.76 [2019-03-28 12:48:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.76 [2019-03-28 12:48:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:36,495 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.76 [2019-03-28 12:48:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:36,504 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.76 [2019-03-28 12:48:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 176.10/129.76 [2019-03-28 12:48:36,513 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 176.10/129.76 [2019-03-28 12:48:36,513 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization 176.10/129.76 [2019-03-28 12:48:36,513 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 176.10/129.76 [2019-03-28 12:48:36,513 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 58 states and 83 transitions. cyclomatic complexity: 28 Second operand 5 states. 176.10/129.76 [2019-03-28 12:48:36,689 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 58 states and 83 transitions. cyclomatic complexity: 28. Second operand 5 states. Result 352 states and 433 transitions. Complement of second has 64 states. 176.10/129.76 [2019-03-28 12:48:36,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 4 non-accepting loop states 2 accepting loop states 176.10/129.76 [2019-03-28 12:48:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 176.10/129.76 [2019-03-28 12:48:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. 176.10/129.76 [2019-03-28 12:48:36,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 7 letters. Loop has 9 letters. 176.10/129.76 [2019-03-28 12:48:36,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.76 [2019-03-28 12:48:36,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 16 letters. Loop has 9 letters. 176.10/129.76 [2019-03-28 12:48:36,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.76 [2019-03-28 12:48:36,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 7 letters. Loop has 18 letters. 176.10/129.76 [2019-03-28 12:48:36,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. 176.10/129.76 [2019-03-28 12:48:36,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 352 states and 433 transitions. 176.10/129.76 [2019-03-28 12:48:36,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 176.10/129.76 [2019-03-28 12:48:36,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 352 states to 133 states and 172 transitions. 176.10/129.76 [2019-03-28 12:48:36,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 176.10/129.76 [2019-03-28 12:48:36,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 176.10/129.76 [2019-03-28 12:48:36,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 172 transitions. 176.10/129.76 [2019-03-28 12:48:36,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 176.10/129.76 [2019-03-28 12:48:36,702 INFO L706 BuchiCegarLoop]: Abstraction has 133 states and 172 transitions. 176.10/129.76 [2019-03-28 12:48:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 172 transitions. 176.10/129.76 [2019-03-28 12:48:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 82. 176.10/129.76 [2019-03-28 12:48:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. 176.10/129.76 [2019-03-28 12:48:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. 176.10/129.76 [2019-03-28 12:48:36,705 INFO L729 BuchiCegarLoop]: Abstraction has 82 states and 114 transitions. 176.10/129.76 [2019-03-28 12:48:36,705 INFO L609 BuchiCegarLoop]: Abstraction has 82 states and 114 transitions. 176.10/129.76 [2019-03-28 12:48:36,705 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 176.10/129.76 [2019-03-28 12:48:36,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 114 transitions. 176.10/129.76 [2019-03-28 12:48:36,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 176.10/129.76 [2019-03-28 12:48:36,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 176.10/129.76 [2019-03-28 12:48:36,706 INFO L119 BuchiIsEmpty]: Starting construction of run 176.10/129.76 [2019-03-28 12:48:36,707 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 176.10/129.76 [2019-03-28 12:48:36,707 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 176.10/129.76 [2019-03-28 12:48:36,707 INFO L794 eck$LassoCheckResult]: Stem: 13697#ULTIMATE.startENTRY [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13692#L-1 [143] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (> |v_ULTIMATE.start_f_#t~malloc3.base_1| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 13693#L11 [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 13695#L11-1 [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 13696#L12 [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 13713#L13 [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 13714#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13708#L15 [175] L15-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13719#L16 176.10/129.76 [2019-03-28 12:48:36,708 INFO L796 eck$LassoCheckResult]: Loop: 13719#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13718#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 13709#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 13710#L16-4 [189] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (< |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 1)) |v_#memory_int_14|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 13698#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13699#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 13728#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 13725#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13724#L15 [175] L15-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13719#L16 176.10/129.76 [2019-03-28 12:48:36,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.76 [2019-03-28 12:48:36,708 INFO L82 PathProgramCache]: Analyzing trace with hash -322156265, now seen corresponding path program 1 times 176.10/129.76 [2019-03-28 12:48:36,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.76 [2019-03-28 12:48:36,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.76 [2019-03-28 12:48:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:36,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.76 [2019-03-28 12:48:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.76 [2019-03-28 12:48:36,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 176.10/129.76 [2019-03-28 12:48:36,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 176.10/129.76 [2019-03-28 12:48:36,747 INFO L799 eck$LassoCheckResult]: stem already infeasible 176.10/129.76 [2019-03-28 12:48:36,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.76 [2019-03-28 12:48:36,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1250598453, now seen corresponding path program 1 times 176.10/129.76 [2019-03-28 12:48:36,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.76 [2019-03-28 12:48:36,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.76 [2019-03-28 12:48:36,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:36,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:36,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.76 [2019-03-28 12:48:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.76 [2019-03-28 12:48:36,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 176.10/129.76 [2019-03-28 12:48:36,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 176.10/129.76 [2019-03-28 12:48:36,842 INFO L811 eck$LassoCheckResult]: loop already infeasible 176.10/129.76 [2019-03-28 12:48:36,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 176.10/129.76 [2019-03-28 12:48:36,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 176.10/129.76 [2019-03-28 12:48:36,843 INFO L87 Difference]: Start difference. First operand 82 states and 114 transitions. cyclomatic complexity: 36 Second operand 6 states. 176.10/129.76 [2019-03-28 12:48:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 176.10/129.76 [2019-03-28 12:48:37,014 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. 176.10/129.76 [2019-03-28 12:48:37,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 176.10/129.76 [2019-03-28 12:48:37,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 124 transitions. 176.10/129.76 [2019-03-28 12:48:37,021 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 176.10/129.76 [2019-03-28 12:48:37,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 96 states and 124 transitions. 176.10/129.76 [2019-03-28 12:48:37,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 176.10/129.76 [2019-03-28 12:48:37,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 176.10/129.76 [2019-03-28 12:48:37,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 124 transitions. 176.10/129.76 [2019-03-28 12:48:37,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 176.10/129.76 [2019-03-28 12:48:37,022 INFO L706 BuchiCegarLoop]: Abstraction has 96 states and 124 transitions. 176.10/129.76 [2019-03-28 12:48:37,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 124 transitions. 176.10/129.76 [2019-03-28 12:48:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. 176.10/129.76 [2019-03-28 12:48:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. 176.10/129.76 [2019-03-28 12:48:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. 176.10/129.76 [2019-03-28 12:48:37,025 INFO L729 BuchiCegarLoop]: Abstraction has 83 states and 111 transitions. 176.10/129.76 [2019-03-28 12:48:37,025 INFO L609 BuchiCegarLoop]: Abstraction has 83 states and 111 transitions. 176.10/129.76 [2019-03-28 12:48:37,026 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 176.10/129.76 [2019-03-28 12:48:37,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 111 transitions. 176.10/129.76 [2019-03-28 12:48:37,026 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 176.10/129.76 [2019-03-28 12:48:37,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 176.10/129.76 [2019-03-28 12:48:37,026 INFO L119 BuchiIsEmpty]: Starting construction of run 176.10/129.76 [2019-03-28 12:48:37,027 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 176.10/129.76 [2019-03-28 12:48:37,027 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 176.10/129.76 [2019-03-28 12:48:37,028 INFO L794 eck$LassoCheckResult]: Stem: 13891#ULTIMATE.startENTRY [94] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13886#L-1 [143] L-1-->L11: Formula: (let ((.cse2 (store |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (and (= |v_ULTIMATE.start_f_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~c~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= v_ULTIMATE.start_f_~x_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~c~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#valid_3| (store .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1)) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~flag~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_f_~x_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~y_1 |v_ULTIMATE.start_f_#in~y_1|) (= v_ULTIMATE.start_f_~x_1 |v_ULTIMATE.start_f_#in~x_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~flag~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~y_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (> |v_ULTIMATE.start_f_#t~malloc3.base_1| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_f_#res=|v_ULTIMATE.start_f_#res_1|, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_1, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_1, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_1|, ULTIMATE.start_f_#in~y=|v_ULTIMATE.start_f_#in~y_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, ULTIMATE.start_f_#in~x=|v_ULTIMATE.start_f_#in~x_1|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_1, #length=|v_#length_1|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_1, ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_1, ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_1, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_1, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_1, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_1, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_1, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_f_#res, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_~y_ref~0.base, ULTIMATE.start_f_~flag~0.base, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem4, ULTIMATE.start_f_#in~y, ULTIMATE.start_f_#t~malloc2.offset, ULTIMATE.start_f_#in~x, ULTIMATE.start_f_~c~0.offset, #length, ULTIMATE.start_f_~x_ref~0.base, ULTIMATE.start_f_~y, ULTIMATE.start_f_~x, ULTIMATE.start_f_~x_ref~0.offset, ULTIMATE.start_f_~flag~0.offset, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~y_ref~0.offset, ULTIMATE.start_f_~c~0.base, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base] 13887#L11 [95] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_3) (= (select |v_#valid_8| v_ULTIMATE.start_f_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~x_ref~0.base_3) v_ULTIMATE.start_f_~x_ref~0.offset_3 v_ULTIMATE.start_f_~x_3)) |v_#memory_int_1|) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_f_~x_ref~0.base_3))) InVars {ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} OutVars{ULTIMATE.start_f_~x=v_ULTIMATE.start_f_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_3, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 13889#L11-1 [91] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_f_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~y_ref~0.base_3) v_ULTIMATE.start_f_~y_ref~0.offset_3 v_ULTIMATE.start_f_~y_3))) (= (select |v_#valid_10| v_ULTIMATE.start_f_~y_ref~0.base_3) 1)) InVars {ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_f_~y=v_ULTIMATE.start_f_~y_3, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 13890#L12 [66] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_f_~flag~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~flag~0.base_3) v_ULTIMATE.start_f_~flag~0.offset_3 1)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_f_~flag~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_3, #length=|v_#length_10|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_3, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 13905#L13 [101] L13-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_f_~c~0.base_3)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_3) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~c~0.base_3) v_ULTIMATE.start_f_~c~0.offset_3 0))) (= 1 (select |v_#valid_14| v_ULTIMATE.start_f_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_3, #length=|v_#length_12|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 13906#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13872#L15 [176] L15-->L16: Formula: (> |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13873#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13936#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 13933#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 13931#L16-4 [190] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 0)) |v_#memory_int_14|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (>= |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 13927#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13924#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 13921#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 13918#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13915#L15 [175] L15-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13914#L16 176.10/129.76 [2019-03-28 12:48:37,028 INFO L796 eck$LassoCheckResult]: Loop: 13914#L16 [204] L16-->L16-2: Formula: (and (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem4_5| |v_ULTIMATE.start_f_#t~post5_6|) (= (select |v_#valid_39| v_ULTIMATE.start_f_~x_ref~0.base_12) 1) (= |v_ULTIMATE.start_f_#t~mem4_5| (select (select |v_#memory_int_21| v_ULTIMATE.start_f_~x_ref~0.base_12) v_ULTIMATE.start_f_~x_ref~0.offset_9)) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_9 4) (select |v_#length_31| v_ULTIMATE.start_f_~x_ref~0.base_12))) InVars {#valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_6|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, #length=|v_#length_31|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_12, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13907#L16-2 [77] L16-2-->L16-3: Formula: (and (= (select |v_#valid_20| v_ULTIMATE.start_f_~x_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_f_~x_ref~0.offset_7 4) (select |v_#length_18| v_ULTIMATE.start_f_~x_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x_ref~0.offset_7) (= (store |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9 (store (select |v_#memory_int_12| v_ULTIMATE.start_f_~x_ref~0.base_9) v_ULTIMATE.start_f_~x_ref~0.offset_7 (+ |v_ULTIMATE.start_f_#t~post5_3| 1))) |v_#memory_int_11|)) InVars {ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} OutVars{ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_3|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_f_~x_ref~0.base=v_ULTIMATE.start_f_~x_ref~0.base_9, ULTIMATE.start_f_~x_ref~0.offset=v_ULTIMATE.start_f_~x_ref~0.offset_7} AuxVars[] AssignedVars[#memory_int] 13901#L16-3 [73] L16-3-->L16-4: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_f_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_f_~y_ref~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~y_ref~0.base_6) v_ULTIMATE.start_f_~y_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~y_ref~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_f_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~y_ref~0.base=v_ULTIMATE.start_f_~y_ref~0.base_6, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_f_~y_ref~0.offset=v_ULTIMATE.start_f_~y_ref~0.offset_5, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 13902#L16-4 [190] L16-4-->L16-5: Formula: (and (= (select |v_#valid_24| v_ULTIMATE.start_f_~flag~0.base_9) 1) (= (store |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9 (store (select |v_#memory_int_15| v_ULTIMATE.start_f_~flag~0.base_9) v_ULTIMATE.start_f_~flag~0.offset_7 0)) |v_#memory_int_14|) (<= 0 v_ULTIMATE.start_f_~flag~0.offset_7) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_f_~flag~0.base_9)) (>= |v_ULTIMATE.start_f_#t~post5_4| |v_ULTIMATE.start_f_#t~mem6_3|)) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_15|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_9, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_4|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_7} AuxVars[] AssignedVars[#memory_int] 13928#L16-5 [65] L16-5-->L17: Formula: true InVars {} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~post5=|v_ULTIMATE.start_f_#t~post5_5|, ULTIMATE.start_f_#t~mem4=|v_ULTIMATE.start_f_#t~mem4_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~post5, ULTIMATE.start_f_#t~mem4] 13925#L17 [86] L17-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~c~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_f_~c~0.base_6) v_ULTIMATE.start_f_~c~0.offset_5)) (= (select |v_#valid_26| v_ULTIMATE.start_f_~c~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~c~0.offset_5 4) (select |v_#length_24| v_ULTIMATE.start_f_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6, #valid=|v_#valid_26|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_5, #length=|v_#length_24|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 13922#L17-1 [208] L17-1-->L15-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_f_~c~0.base_19)) (<= 0 v_ULTIMATE.start_f_~c~0.offset_15) (= 1 (select |v_#valid_46| v_ULTIMATE.start_f_~c~0.base_19)) (= (store |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19 (store (select |v_#memory_int_26| v_ULTIMATE.start_f_~c~0.base_19) v_ULTIMATE.start_f_~c~0.offset_15 (+ |v_ULTIMATE.start_f_#t~mem7_6| 1))) |v_#memory_int_25|)) InVars {ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_~c~0.offset=v_ULTIMATE.start_f_~c~0.offset_15, #length=|v_#length_35|, ULTIMATE.start_f_~c~0.base=v_ULTIMATE.start_f_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7, #memory_int] 13919#L15-2 [105] L15-2-->L15: Formula: (and (<= 0 v_ULTIMATE.start_f_~flag~0.offset_5) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_f_~flag~0.base_6) v_ULTIMATE.start_f_~flag~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~flag~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_f_~flag~0.base_6)) (= (select |v_#valid_16| v_ULTIMATE.start_f_~flag~0.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~flag~0.base=v_ULTIMATE.start_f_~flag~0.base_6, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, #length=|v_#length_14|, ULTIMATE.start_f_~flag~0.offset=v_ULTIMATE.start_f_~flag~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13916#L15 [175] L15-->L16: Formula: (< |v_ULTIMATE.start_f_#t~mem8_6| 0) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_6|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 13914#L16 176.10/129.76 [2019-03-28 12:48:37,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.76 [2019-03-28 12:48:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1404648243, now seen corresponding path program 1 times 176.10/129.76 [2019-03-28 12:48:37,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.76 [2019-03-28 12:48:37,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.76 [2019-03-28 12:48:37,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:37,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:37,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.76 [2019-03-28 12:48:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.76 [2019-03-28 12:48:37,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 176.10/129.76 [2019-03-28 12:48:37,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 176.10/129.76 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 176.10/129.76 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 176.10/129.76 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 176.10/129.76 [2019-03-28 12:48:37,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.76 [2019-03-28 12:48:37,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core 176.10/129.76 [2019-03-28 12:48:37,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... 176.10/129.76 [2019-03-28 12:48:37,128 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 176.10/129.76 [2019-03-28 12:48:37,128 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:37,134 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.76 [2019-03-28 12:48:37,134 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:37,134 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:4 176.10/129.76 [2019-03-28 12:48:37,150 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 176.10/129.76 [2019-03-28 12:48:37,150 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:37,155 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.76 [2019-03-28 12:48:37,155 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:37,156 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 176.10/129.76 [2019-03-28 12:48:37,166 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 176.10/129.76 [2019-03-28 12:48:37,167 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:37,174 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.76 [2019-03-28 12:48:37,174 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:37,175 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 176.10/129.76 [2019-03-28 12:48:37,179 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 176.10/129.76 [2019-03-28 12:48:37,180 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:37,193 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 176.10/129.76 [2019-03-28 12:48:37,194 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 176.10/129.76 [2019-03-28 12:48:37,194 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 176.10/129.76 [2019-03-28 12:48:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.76 [2019-03-28 12:48:37,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 176.10/129.76 [2019-03-28 12:48:37,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 176.10/129.76 [2019-03-28 12:48:37,230 INFO L799 eck$LassoCheckResult]: stem already infeasible 176.10/129.76 [2019-03-28 12:48:37,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 176.10/129.76 [2019-03-28 12:48:37,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1221969302, now seen corresponding path program 1 times 176.10/129.76 [2019-03-28 12:48:37,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 176.10/129.76 [2019-03-28 12:48:37,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 176.10/129.76 [2019-03-28 12:48:37,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:37,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:37,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 176.10/129.76 [2019-03-28 12:48:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 176.10/129.76 [2019-03-28 12:48:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 176.10/129.76 [2019-03-28 12:48:37,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 176.10/129.76 [2019-03-28 12:48:37,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 176.10/129.76 [2019-03-28 12:48:37,301 INFO L811 eck$LassoCheckResult]: loop already infeasible 176.10/129.76 [2019-03-28 12:48:37,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 176.10/129.76 [2019-03-28 12:48:37,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 176.10/129.76 [2019-03-28 12:48:37,301 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. cyclomatic complexity: 32 Second operand 6 states. 176.10/129.76 [2019-03-28 12:48:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 176.10/129.76 [2019-03-28 12:48:37,513 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. 176.10/129.76 [2019-03-28 12:48:37,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 176.10/129.76 [2019-03-28 12:48:37,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 74 transitions. 176.10/129.76 [2019-03-28 12:48:37,519 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 176.10/129.76 [2019-03-28 12:48:37,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. 176.10/129.76 [2019-03-28 12:48:37,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 176.10/129.76 [2019-03-28 12:48:37,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 176.10/129.76 [2019-03-28 12:48:37,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 176.10/129.76 [2019-03-28 12:48:37,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 176.10/129.76 [2019-03-28 12:48:37,520 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 176.10/129.76 [2019-03-28 12:48:37,520 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 176.10/129.76 [2019-03-28 12:48:37,520 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 176.10/129.76 [2019-03-28 12:48:37,520 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 176.10/129.76 [2019-03-28 12:48:37,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 176.10/129.76 [2019-03-28 12:48:37,520 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 176.10/129.76 [2019-03-28 12:48:37,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 176.10/129.76 [2019-03-28 12:48:37,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:48:37 BasicIcfg 176.10/129.76 [2019-03-28 12:48:37,526 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 176.10/129.76 [2019-03-28 12:48:37,527 INFO L168 Benchmark]: Toolchain (without parser) took 125416.49 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 440.9 MB). Free memory was 564.9 MB in the beginning and 791.4 MB in the end (delta: -226.5 MB). Peak memory consumption was 214.4 MB. Max. memory is 50.3 GB. 176.10/129.76 [2019-03-28 12:48:37,527 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 584.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 176.10/129.76 [2019-03-28 12:48:37,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.98 ms. Allocated memory was 649.6 MB in the beginning and 686.8 MB in the end (delta: 37.2 MB). Free memory was 564.9 MB in the beginning and 654.4 MB in the end (delta: -89.5 MB). Peak memory consumption was 31.6 MB. Max. memory is 50.3 GB. 176.10/129.76 [2019-03-28 12:48:37,528 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.65 ms. Allocated memory is still 686.8 MB. Free memory was 654.4 MB in the beginning and 650.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 176.10/129.76 [2019-03-28 12:48:37,529 INFO L168 Benchmark]: Boogie Preprocessor took 25.68 ms. Allocated memory is still 686.8 MB. Free memory was 650.5 MB in the beginning and 649.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 176.10/129.76 [2019-03-28 12:48:37,530 INFO L168 Benchmark]: RCFGBuilder took 367.21 ms. Allocated memory is still 686.8 MB. Free memory was 649.4 MB in the beginning and 623.7 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 50.3 GB. 176.10/129.76 [2019-03-28 12:48:37,530 INFO L168 Benchmark]: BlockEncodingV2 took 168.92 ms. Allocated memory is still 686.8 MB. Free memory was 623.7 MB in the beginning and 610.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 50.3 GB. 176.10/129.76 [2019-03-28 12:48:37,531 INFO L168 Benchmark]: TraceAbstraction took 2150.38 ms. Allocated memory was 686.8 MB in the beginning and 750.8 MB in the end (delta: 64.0 MB). Free memory was 610.8 MB in the beginning and 673.2 MB in the end (delta: -62.4 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. 176.10/129.76 [2019-03-28 12:48:37,531 INFO L168 Benchmark]: BuchiAutomizer took 122347.38 ms. Allocated memory was 750.8 MB in the beginning and 1.1 GB in the end (delta: 339.7 MB). Free memory was 673.2 MB in the beginning and 791.4 MB in the end (delta: -118.2 MB). Peak memory consumption was 221.5 MB. Max. memory is 50.3 GB. 176.10/129.76 [2019-03-28 12:48:37,534 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 176.10/129.76 --- Results --- 176.10/129.76 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 176.10/129.76 - StatisticsResult: Initial Icfg 176.10/129.76 47 locations, 48 edges 176.10/129.76 - StatisticsResult: Encoded RCFG 176.10/129.76 40 locations, 81 edges 176.10/129.76 * Results from de.uni_freiburg.informatik.ultimate.core: 176.10/129.76 - StatisticsResult: Toolchain Benchmarks 176.10/129.76 Benchmark results are: 176.10/129.76 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 584.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 176.10/129.76 * CACSL2BoogieTranslator took 306.98 ms. Allocated memory was 649.6 MB in the beginning and 686.8 MB in the end (delta: 37.2 MB). Free memory was 564.9 MB in the beginning and 654.4 MB in the end (delta: -89.5 MB). Peak memory consumption was 31.6 MB. Max. memory is 50.3 GB. 176.10/129.76 * Boogie Procedure Inliner took 44.65 ms. Allocated memory is still 686.8 MB. Free memory was 654.4 MB in the beginning and 650.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 176.10/129.76 * Boogie Preprocessor took 25.68 ms. Allocated memory is still 686.8 MB. Free memory was 650.5 MB in the beginning and 649.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 176.10/129.76 * RCFGBuilder took 367.21 ms. Allocated memory is still 686.8 MB. Free memory was 649.4 MB in the beginning and 623.7 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 50.3 GB. 176.10/129.76 * BlockEncodingV2 took 168.92 ms. Allocated memory is still 686.8 MB. Free memory was 623.7 MB in the beginning and 610.8 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 50.3 GB. 176.10/129.76 * TraceAbstraction took 2150.38 ms. Allocated memory was 686.8 MB in the beginning and 750.8 MB in the end (delta: 64.0 MB). Free memory was 610.8 MB in the beginning and 673.2 MB in the end (delta: -62.4 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. 176.10/129.76 * BuchiAutomizer took 122347.38 ms. Allocated memory was 750.8 MB in the beginning and 1.1 GB in the end (delta: 339.7 MB). Free memory was 673.2 MB in the beginning and 791.4 MB in the end (delta: -118.2 MB). Peak memory consumption was 221.5 MB. Max. memory is 50.3 GB. 176.10/129.76 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #length 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #length 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #length 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #length 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #length 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #length 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #length 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #length 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #memory_int 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #memory_int 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #memory_int 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #memory_int 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #memory_int 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #memory_int 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #memory_int 176.10/129.76 - GenericResult: Unfinished Backtranslation 176.10/129.76 unknown boogie variable #memory_int 176.10/129.76 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 176.10/129.76 - PositiveResult [Line: 19]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 11]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 16]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 16]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 19]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 12]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 16]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 16]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 13]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 12]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 16]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 16]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 13]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 14]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 17]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 15]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 14]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 16]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 16]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 17]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 11]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 17]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 15]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - PositiveResult [Line: 17]: pointer dereference always succeeds 176.10/129.76 For all program executions holds that pointer dereference always succeeds at this location 176.10/129.76 - AllSpecificationsHoldResult: All specifications hold 176.10/129.76 24 specifications checked. All of them hold 176.10/129.76 - InvariantResult [Line: 14]: Loop Invariant 176.10/129.76 [2019-03-28 12:48:37,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.76 [2019-03-28 12:48:37,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.76 [2019-03-28 12:48:37,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.76 [2019-03-28 12:48:37,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.76 [2019-03-28 12:48:37,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.76 [2019-03-28 12:48:37,543 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.76 [2019-03-28 12:48:37,543 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.76 [2019-03-28 12:48:37,543 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 176.10/129.76 Derived loop invariant: ((((((((((4 == unknown-#length-unknown[x_ref] && 1 == \valid[y_ref]) && unknown-#length-unknown[y_ref] == 4) && 0 == flag) && \valid[c] == 1) && y_ref == 0) && 0 == c) && 1 == \valid[flag]) && unknown-#length-unknown[c] == 4) && 4 == unknown-#length-unknown[flag]) && 1 == \valid[x_ref]) && x_ref == 0 176.10/129.76 - StatisticsResult: Ultimate Automizer benchmark data 176.10/129.76 CFG has 1 procedures, 40 locations, 24 error locations. SAFE Result, 2.0s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 45 SDtfs, 400 SDslu, 6 SDs, 0 SdLazy, 542 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 53 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 617 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 176.10/129.76 - StatisticsResult: Constructed decomposition of program 176.10/129.76 Your program was decomposed into 7 terminating modules (2 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x_ref][x_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 189 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[x_ref][x_ref] and consists of 118 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[x_ref][x_ref] and consists of 118 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[x_ref][x_ref] and consists of 62 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2b90eccb and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. 176.10/129.76 - StatisticsResult: Timing statistics 176.10/129.76 BüchiAutomizer plugin needed 122.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 13.0s. Construction of modules took 8.1s. Büchi inclusion checks took 100.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 2481 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 6. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 69 SDtfs, 7728 SDslu, 935 SDs, 0 SdLazy, 10263 SolverSat, 2011 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital514 mio100 ax100 hnf100 lsp98 ukn46 mio100 lsp39 div100 bol100 ite100 ukn100 eq190 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 176.10/129.76 - TerminationAnalysisResult: Termination proven 176.10/129.76 Buchi Automizer proved that your program is terminating 176.10/129.76 RESULT: Ultimate proved your program to be correct! 176.10/129.76 !SESSION 2019-03-28 12:46:28.810 ----------------------------------------------- 176.10/129.76 eclipse.buildId=unknown 176.10/129.76 java.version=1.8.0_181 176.10/129.76 java.vendor=Oracle Corporation 176.10/129.76 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 176.10/129.76 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 176.10/129.76 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 176.10/129.76 176.10/129.76 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:48:37.768 176.10/129.76 !MESSAGE The workspace will exit with unsaved changes in this session. 176.10/129.76 Received shutdown request... 176.10/129.76 Ultimate: 176.10/129.76 GTK+ Version Check 176.10/129.76 EOF