88.12/64.48 YES 88.12/64.48 88.12/64.48 Ultimate: Cannot open display: 88.12/64.48 This is Ultimate 0.1.24-8dc7c08-m 88.12/64.48 [2019-03-28 12:37:00,223 INFO L170 SettingsManager]: Resetting all preferences to default values... 88.12/64.48 [2019-03-28 12:37:00,225 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 88.12/64.48 [2019-03-28 12:37:00,236 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 88.12/64.48 [2019-03-28 12:37:00,237 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 88.12/64.48 [2019-03-28 12:37:00,238 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 88.12/64.48 [2019-03-28 12:37:00,239 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 88.12/64.48 [2019-03-28 12:37:00,240 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 88.12/64.48 [2019-03-28 12:37:00,242 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 88.12/64.48 [2019-03-28 12:37:00,243 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 88.12/64.48 [2019-03-28 12:37:00,243 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 88.12/64.48 [2019-03-28 12:37:00,244 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 88.12/64.48 [2019-03-28 12:37:00,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 88.12/64.48 [2019-03-28 12:37:00,245 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 88.12/64.48 [2019-03-28 12:37:00,246 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 88.12/64.48 [2019-03-28 12:37:00,247 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 88.12/64.48 [2019-03-28 12:37:00,248 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 88.12/64.48 [2019-03-28 12:37:00,250 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 88.12/64.48 [2019-03-28 12:37:00,251 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 88.12/64.48 [2019-03-28 12:37:00,253 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 88.12/64.48 [2019-03-28 12:37:00,254 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 88.12/64.48 [2019-03-28 12:37:00,255 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 88.12/64.48 [2019-03-28 12:37:00,257 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 88.12/64.48 [2019-03-28 12:37:00,257 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 88.12/64.48 [2019-03-28 12:37:00,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 88.12/64.48 [2019-03-28 12:37:00,258 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 88.12/64.48 [2019-03-28 12:37:00,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 88.12/64.48 [2019-03-28 12:37:00,260 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 88.12/64.48 [2019-03-28 12:37:00,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 88.12/64.48 [2019-03-28 12:37:00,261 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 88.12/64.48 [2019-03-28 12:37:00,261 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 88.12/64.48 [2019-03-28 12:37:00,262 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 88.12/64.48 [2019-03-28 12:37:00,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 88.12/64.48 [2019-03-28 12:37:00,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 88.12/64.48 [2019-03-28 12:37:00,264 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 88.12/64.48 [2019-03-28 12:37:00,264 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 88.12/64.48 [2019-03-28 12:37:00,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 88.12/64.48 [2019-03-28 12:37:00,265 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 88.12/64.48 [2019-03-28 12:37:00,266 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 88.12/64.48 [2019-03-28 12:37:00,266 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 88.12/64.48 [2019-03-28 12:37:00,281 INFO L110 SettingsManager]: Loading preferences was successful 88.12/64.48 [2019-03-28 12:37:00,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 88.12/64.48 [2019-03-28 12:37:00,282 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 88.12/64.48 [2019-03-28 12:37:00,282 INFO L133 SettingsManager]: * Rewrite not-equals=true 88.12/64.48 [2019-03-28 12:37:00,282 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 88.12/64.48 [2019-03-28 12:37:00,282 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 88.12/64.48 [2019-03-28 12:37:00,283 INFO L133 SettingsManager]: * Use SBE=true 88.12/64.48 [2019-03-28 12:37:00,283 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 88.12/64.48 [2019-03-28 12:37:00,283 INFO L133 SettingsManager]: * Use old map elimination=false 88.12/64.48 [2019-03-28 12:37:00,283 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 88.12/64.48 [2019-03-28 12:37:00,283 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 88.12/64.48 [2019-03-28 12:37:00,283 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 88.12/64.48 [2019-03-28 12:37:00,284 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 88.12/64.48 [2019-03-28 12:37:00,284 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 88.12/64.48 [2019-03-28 12:37:00,284 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 88.12/64.48 [2019-03-28 12:37:00,284 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 88.12/64.48 [2019-03-28 12:37:00,284 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 88.12/64.48 [2019-03-28 12:37:00,285 INFO L133 SettingsManager]: * Check division by zero=IGNORE 88.12/64.48 [2019-03-28 12:37:00,285 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 88.12/64.48 [2019-03-28 12:37:00,285 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 88.12/64.48 [2019-03-28 12:37:00,285 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 88.12/64.48 [2019-03-28 12:37:00,285 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 88.12/64.48 [2019-03-28 12:37:00,285 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 88.12/64.48 [2019-03-28 12:37:00,286 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 88.12/64.48 [2019-03-28 12:37:00,286 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 88.12/64.48 [2019-03-28 12:37:00,286 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 88.12/64.48 [2019-03-28 12:37:00,286 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 88.12/64.48 [2019-03-28 12:37:00,286 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 88.12/64.48 [2019-03-28 12:37:00,286 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 88.12/64.48 [2019-03-28 12:37:00,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 88.12/64.48 [2019-03-28 12:37:00,325 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 88.12/64.48 [2019-03-28 12:37:00,329 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 88.12/64.48 [2019-03-28 12:37:00,330 INFO L271 PluginConnector]: Initializing CDTParser... 88.12/64.48 [2019-03-28 12:37:00,331 INFO L276 PluginConnector]: CDTParser initialized 88.12/64.48 [2019-03-28 12:37:00,332 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 88.12/64.48 [2019-03-28 12:37:00,389 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/8c655c3b61f742d1b7f6b265f8525e53/FLAGa991e1de9 88.12/64.48 [2019-03-28 12:37:00,742 INFO L307 CDTParser]: Found 1 translation units. 88.12/64.48 [2019-03-28 12:37:00,743 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 88.12/64.48 [2019-03-28 12:37:00,743 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 88.12/64.48 [2019-03-28 12:37:00,750 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/8c655c3b61f742d1b7f6b265f8525e53/FLAGa991e1de9 88.12/64.48 [2019-03-28 12:37:01,131 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/8c655c3b61f742d1b7f6b265f8525e53 88.12/64.48 [2019-03-28 12:37:01,142 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 88.12/64.48 [2019-03-28 12:37:01,144 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 88.12/64.48 [2019-03-28 12:37:01,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 88.12/64.48 [2019-03-28 12:37:01,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 88.12/64.48 [2019-03-28 12:37:01,149 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 88.12/64.48 [2019-03-28 12:37:01,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:01" (1/1) ... 88.12/64.48 [2019-03-28 12:37:01,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64209681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:01, skipping insertion in model container 88.12/64.48 [2019-03-28 12:37:01,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:37:01" (1/1) ... 88.12/64.48 [2019-03-28 12:37:01,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 88.12/64.48 [2019-03-28 12:37:01,178 INFO L176 MainTranslator]: Built tables and reachable declarations 88.12/64.48 [2019-03-28 12:37:01,343 INFO L206 PostProcessor]: Analyzing one entry point: main 88.12/64.48 [2019-03-28 12:37:01,356 INFO L191 MainTranslator]: Completed pre-run 88.12/64.48 [2019-03-28 12:37:01,436 INFO L206 PostProcessor]: Analyzing one entry point: main 88.12/64.48 [2019-03-28 12:37:01,453 INFO L195 MainTranslator]: Completed translation 88.12/64.48 [2019-03-28 12:37:01,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:01 WrapperNode 88.12/64.48 [2019-03-28 12:37:01,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 88.12/64.48 [2019-03-28 12:37:01,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 88.12/64.48 [2019-03-28 12:37:01,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 88.12/64.48 [2019-03-28 12:37:01,455 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 88.12/64.48 [2019-03-28 12:37:01,464 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:37:01" (1/1) ... 88.12/64.48 [2019-03-28 12:37:01,475 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:37:01" (1/1) ... 88.12/64.48 [2019-03-28 12:37:01,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 88.12/64.48 [2019-03-28 12:37:01,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 88.12/64.48 [2019-03-28 12:37:01,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 88.12/64.48 [2019-03-28 12:37:01,500 INFO L276 PluginConnector]: Boogie Preprocessor initialized 88.12/64.48 [2019-03-28 12:37:01,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:01" (1/1) ... 88.12/64.48 [2019-03-28 12:37:01,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:01" (1/1) ... 88.12/64.48 [2019-03-28 12:37:01,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:01" (1/1) ... 88.12/64.48 [2019-03-28 12:37:01,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:01" (1/1) ... 88.12/64.48 [2019-03-28 12:37:01,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:01" (1/1) ... 88.12/64.48 [2019-03-28 12:37:01,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:01" (1/1) ... 88.12/64.48 [2019-03-28 12:37:01,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:01" (1/1) ... 88.12/64.48 [2019-03-28 12:37:01,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 88.12/64.48 [2019-03-28 12:37:01,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 88.12/64.48 [2019-03-28 12:37:01,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... 88.12/64.48 [2019-03-28 12:37:01,527 INFO L276 PluginConnector]: RCFGBuilder initialized 88.12/64.48 [2019-03-28 12:37:01,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:01" (1/1) ... 88.12/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 88.12/64.48 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 88.12/64.48 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 88.12/64.48 [2019-03-28 12:37:01,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 88.12/64.48 [2019-03-28 12:37:01,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 88.12/64.48 [2019-03-28 12:37:01,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 88.12/64.48 [2019-03-28 12:37:01,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 88.12/64.48 [2019-03-28 12:37:01,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 88.12/64.48 [2019-03-28 12:37:01,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 88.12/64.48 [2019-03-28 12:37:01,918 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 88.12/64.48 [2019-03-28 12:37:01,919 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. 88.12/64.48 [2019-03-28 12:37:01,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:01 BoogieIcfgContainer 88.12/64.48 [2019-03-28 12:37:01,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 88.12/64.48 [2019-03-28 12:37:01,921 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 88.12/64.48 [2019-03-28 12:37:01,921 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 88.12/64.48 [2019-03-28 12:37:01,924 INFO L276 PluginConnector]: BlockEncodingV2 initialized 88.12/64.48 [2019-03-28 12:37:01,925 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:01" (1/1) ... 88.12/64.48 [2019-03-28 12:37:01,946 INFO L313 BlockEncoder]: Initial Icfg 57 locations, 61 edges 88.12/64.48 [2019-03-28 12:37:01,947 INFO L258 BlockEncoder]: Using Remove infeasible edges 88.12/64.48 [2019-03-28 12:37:01,948 INFO L263 BlockEncoder]: Using Maximize final states 88.12/64.48 [2019-03-28 12:37:01,949 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 88.12/64.48 [2019-03-28 12:37:01,949 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 88.12/64.48 [2019-03-28 12:37:01,951 INFO L296 BlockEncoder]: Using Remove sink states 88.12/64.48 [2019-03-28 12:37:01,952 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 88.12/64.48 [2019-03-28 12:37:01,952 INFO L179 BlockEncoder]: Using Rewrite not-equals 88.12/64.48 [2019-03-28 12:37:01,981 INFO L185 BlockEncoder]: Using Use SBE 88.12/64.48 [2019-03-28 12:37:02,020 INFO L200 BlockEncoder]: SBE split 31 edges 88.12/64.48 [2019-03-28 12:37:02,026 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 88.12/64.48 [2019-03-28 12:37:02,027 INFO L71 MaximizeFinalStates]: 0 new accepting states 88.12/64.48 [2019-03-28 12:37:02,056 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 88.12/64.48 [2019-03-28 12:37:02,059 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 88.12/64.48 [2019-03-28 12:37:02,060 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 88.12/64.48 [2019-03-28 12:37:02,061 INFO L71 MaximizeFinalStates]: 0 new accepting states 88.12/64.48 [2019-03-28 12:37:02,061 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 88.12/64.48 [2019-03-28 12:37:02,062 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 88.12/64.48 [2019-03-28 12:37:02,062 INFO L313 BlockEncoder]: Encoded RCFG 49 locations, 89 edges 88.12/64.48 [2019-03-28 12:37:02,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:02 BasicIcfg 88.12/64.48 [2019-03-28 12:37:02,063 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 88.12/64.48 [2019-03-28 12:37:02,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 88.12/64.48 [2019-03-28 12:37:02,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... 88.12/64.48 [2019-03-28 12:37:02,067 INFO L276 PluginConnector]: TraceAbstraction initialized 88.12/64.48 [2019-03-28 12:37:02,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:37:01" (1/4) ... 88.12/64.48 [2019-03-28 12:37:02,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5481d482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:37:02, skipping insertion in model container 88.12/64.48 [2019-03-28 12:37:02,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:01" (2/4) ... 88.12/64.48 [2019-03-28 12:37:02,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5481d482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:37:02, skipping insertion in model container 88.12/64.48 [2019-03-28 12:37:02,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:01" (3/4) ... 88.12/64.48 [2019-03-28 12:37:02,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5481d482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:37:02, skipping insertion in model container 88.12/64.48 [2019-03-28 12:37:02,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:02" (4/4) ... 88.12/64.48 [2019-03-28 12:37:02,071 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 88.12/64.48 [2019-03-28 12:37:02,081 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 88.12/64.48 [2019-03-28 12:37:02,089 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. 88.12/64.48 [2019-03-28 12:37:02,107 INFO L257 AbstractCegarLoop]: Starting to check reachability of 28 error locations. 88.12/64.48 [2019-03-28 12:37:02,136 INFO L133 ementStrategyFactory]: Using default assertion order modulation 88.12/64.48 [2019-03-28 12:37:02,137 INFO L382 AbstractCegarLoop]: Interprodecural is true 88.12/64.48 [2019-03-28 12:37:02,137 INFO L383 AbstractCegarLoop]: Hoare is true 88.12/64.48 [2019-03-28 12:37:02,137 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 88.12/64.48 [2019-03-28 12:37:02,138 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 88.12/64.48 [2019-03-28 12:37:02,138 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 88.12/64.48 [2019-03-28 12:37:02,138 INFO L387 AbstractCegarLoop]: Difference is false 88.12/64.48 [2019-03-28 12:37:02,138 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 88.12/64.48 [2019-03-28 12:37:02,138 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 88.12/64.48 [2019-03-28 12:37:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. 88.12/64.48 [2019-03-28 12:37:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 88.12/64.48 [2019-03-28 12:37:02,160 INFO L394 BasicCegarLoop]: Found error trace 88.12/64.48 [2019-03-28 12:37:02,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 88.12/64.48 [2019-03-28 12:37:02,161 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 88.12/64.48 [2019-03-28 12:37:02,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:02,167 INFO L82 PathProgramCache]: Analyzing trace with hash 135471, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:02,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:02,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:02,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:02,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:02,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.48 [2019-03-28 12:37:02,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 88.12/64.48 [2019-03-28 12:37:02,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 88.12/64.48 [2019-03-28 12:37:02,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 88.12/64.48 [2019-03-28 12:37:02,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 88.12/64.48 [2019-03-28 12:37:02,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 88.12/64.48 [2019-03-28 12:37:02,380 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. 88.12/64.48 [2019-03-28 12:37:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 88.12/64.48 [2019-03-28 12:37:02,585 INFO L93 Difference]: Finished difference Result 49 states and 89 transitions. 88.12/64.48 [2019-03-28 12:37:02,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:02,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 88.12/64.48 [2019-03-28 12:37:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 88.12/64.48 [2019-03-28 12:37:02,601 INFO L225 Difference]: With dead ends: 49 88.12/64.48 [2019-03-28 12:37:02,602 INFO L226 Difference]: Without dead ends: 44 88.12/64.48 [2019-03-28 12:37:02,605 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 88.12/64.48 [2019-03-28 12:37:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. 88.12/64.48 [2019-03-28 12:37:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. 88.12/64.48 [2019-03-28 12:37:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 88.12/64.48 [2019-03-28 12:37:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 79 transitions. 88.12/64.48 [2019-03-28 12:37:02,646 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 79 transitions. Word has length 3 88.12/64.48 [2019-03-28 12:37:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. 88.12/64.48 [2019-03-28 12:37:02,647 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 79 transitions. 88.12/64.48 [2019-03-28 12:37:02,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 79 transitions. 88.12/64.48 [2019-03-28 12:37:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 88.12/64.48 [2019-03-28 12:37:02,648 INFO L394 BasicCegarLoop]: Found error trace 88.12/64.48 [2019-03-28 12:37:02,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 88.12/64.48 [2019-03-28 12:37:02,648 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 88.12/64.48 [2019-03-28 12:37:02,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:02,649 INFO L82 PathProgramCache]: Analyzing trace with hash 135473, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:02,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:02,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:02,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:02,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:02,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.48 [2019-03-28 12:37:02,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 88.12/64.48 [2019-03-28 12:37:02,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 88.12/64.48 [2019-03-28 12:37:02,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 88.12/64.48 [2019-03-28 12:37:02,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 88.12/64.48 [2019-03-28 12:37:02,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 88.12/64.48 [2019-03-28 12:37:02,677 INFO L87 Difference]: Start difference. First operand 44 states and 79 transitions. Second operand 3 states. 88.12/64.48 [2019-03-28 12:37:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 88.12/64.48 [2019-03-28 12:37:02,786 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. 88.12/64.48 [2019-03-28 12:37:02,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:02,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 88.12/64.48 [2019-03-28 12:37:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 88.12/64.48 [2019-03-28 12:37:02,788 INFO L225 Difference]: With dead ends: 49 88.12/64.48 [2019-03-28 12:37:02,788 INFO L226 Difference]: Without dead ends: 44 88.12/64.48 [2019-03-28 12:37:02,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 88.12/64.48 [2019-03-28 12:37:02,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. 88.12/64.48 [2019-03-28 12:37:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. 88.12/64.48 [2019-03-28 12:37:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 88.12/64.48 [2019-03-28 12:37:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 74 transitions. 88.12/64.48 [2019-03-28 12:37:02,795 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 74 transitions. Word has length 3 88.12/64.48 [2019-03-28 12:37:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. 88.12/64.48 [2019-03-28 12:37:02,796 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 74 transitions. 88.12/64.48 [2019-03-28 12:37:02,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 74 transitions. 88.12/64.48 [2019-03-28 12:37:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 88.12/64.48 [2019-03-28 12:37:02,797 INFO L394 BasicCegarLoop]: Found error trace 88.12/64.48 [2019-03-28 12:37:02,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 88.12/64.48 [2019-03-28 12:37:02,797 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 88.12/64.48 [2019-03-28 12:37:02,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:02,797 INFO L82 PathProgramCache]: Analyzing trace with hash 135474, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:02,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:02,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:02,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.48 [2019-03-28 12:37:02,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 88.12/64.48 [2019-03-28 12:37:02,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 88.12/64.48 [2019-03-28 12:37:02,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 88.12/64.48 [2019-03-28 12:37:02,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 88.12/64.48 [2019-03-28 12:37:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 88.12/64.48 [2019-03-28 12:37:02,841 INFO L87 Difference]: Start difference. First operand 44 states and 74 transitions. Second operand 3 states. 88.12/64.48 [2019-03-28 12:37:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 88.12/64.48 [2019-03-28 12:37:02,960 INFO L93 Difference]: Finished difference Result 44 states and 74 transitions. 88.12/64.48 [2019-03-28 12:37:02,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:02,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 88.12/64.48 [2019-03-28 12:37:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 88.12/64.48 [2019-03-28 12:37:02,962 INFO L225 Difference]: With dead ends: 44 88.12/64.48 [2019-03-28 12:37:02,962 INFO L226 Difference]: Without dead ends: 39 88.12/64.48 [2019-03-28 12:37:02,963 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 88.12/64.48 [2019-03-28 12:37:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 88.12/64.48 [2019-03-28 12:37:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. 88.12/64.48 [2019-03-28 12:37:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. 88.12/64.48 [2019-03-28 12:37:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 69 transitions. 88.12/64.48 [2019-03-28 12:37:02,968 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 69 transitions. Word has length 3 88.12/64.48 [2019-03-28 12:37:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. 88.12/64.48 [2019-03-28 12:37:02,968 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 69 transitions. 88.12/64.48 [2019-03-28 12:37:02,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 69 transitions. 88.12/64.48 [2019-03-28 12:37:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 88.12/64.48 [2019-03-28 12:37:02,969 INFO L394 BasicCegarLoop]: Found error trace 88.12/64.48 [2019-03-28 12:37:02,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:02,970 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 88.12/64.48 [2019-03-28 12:37:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:02,970 INFO L82 PathProgramCache]: Analyzing trace with hash 4196693, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:02,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:02,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:02,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:02,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:02,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.48 [2019-03-28 12:37:03,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 88.12/64.48 [2019-03-28 12:37:03,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 88.12/64.48 [2019-03-28 12:37:03,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 88.12/64.48 [2019-03-28 12:37:03,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 88.12/64.48 [2019-03-28 12:37:03,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 88.12/64.48 [2019-03-28 12:37:03,007 INFO L87 Difference]: Start difference. First operand 39 states and 69 transitions. Second operand 3 states. 88.12/64.48 [2019-03-28 12:37:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 88.12/64.48 [2019-03-28 12:37:03,144 INFO L93 Difference]: Finished difference Result 39 states and 69 transitions. 88.12/64.48 [2019-03-28 12:37:03,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:03,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 88.12/64.48 [2019-03-28 12:37:03,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 88.12/64.48 [2019-03-28 12:37:03,146 INFO L225 Difference]: With dead ends: 39 88.12/64.48 [2019-03-28 12:37:03,146 INFO L226 Difference]: Without dead ends: 34 88.12/64.48 [2019-03-28 12:37:03,147 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 88.12/64.48 [2019-03-28 12:37:03,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 88.12/64.48 [2019-03-28 12:37:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 88.12/64.48 [2019-03-28 12:37:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 88.12/64.48 [2019-03-28 12:37:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. 88.12/64.48 [2019-03-28 12:37:03,152 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 4 88.12/64.48 [2019-03-28 12:37:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. 88.12/64.48 [2019-03-28 12:37:03,152 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 59 transitions. 88.12/64.48 [2019-03-28 12:37:03,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. 88.12/64.48 [2019-03-28 12:37:03,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 88.12/64.48 [2019-03-28 12:37:03,153 INFO L394 BasicCegarLoop]: Found error trace 88.12/64.48 [2019-03-28 12:37:03,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:03,153 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 88.12/64.48 [2019-03-28 12:37:03,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:03,154 INFO L82 PathProgramCache]: Analyzing trace with hash 4196694, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:03,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:03,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.48 [2019-03-28 12:37:03,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 88.12/64.48 [2019-03-28 12:37:03,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 88.12/64.48 [2019-03-28 12:37:03,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 88.12/64.48 [2019-03-28 12:37:03,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 88.12/64.48 [2019-03-28 12:37:03,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 88.12/64.48 [2019-03-28 12:37:03,193 INFO L87 Difference]: Start difference. First operand 34 states and 59 transitions. Second operand 3 states. 88.12/64.48 [2019-03-28 12:37:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 88.12/64.48 [2019-03-28 12:37:03,264 INFO L93 Difference]: Finished difference Result 39 states and 59 transitions. 88.12/64.48 [2019-03-28 12:37:03,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:03,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 88.12/64.48 [2019-03-28 12:37:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 88.12/64.48 [2019-03-28 12:37:03,266 INFO L225 Difference]: With dead ends: 39 88.12/64.48 [2019-03-28 12:37:03,266 INFO L226 Difference]: Without dead ends: 34 88.12/64.48 [2019-03-28 12:37:03,267 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 88.12/64.48 [2019-03-28 12:37:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 88.12/64.48 [2019-03-28 12:37:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 88.12/64.48 [2019-03-28 12:37:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 88.12/64.48 [2019-03-28 12:37:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 54 transitions. 88.12/64.48 [2019-03-28 12:37:03,271 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 54 transitions. Word has length 4 88.12/64.48 [2019-03-28 12:37:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. 88.12/64.48 [2019-03-28 12:37:03,271 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 54 transitions. 88.12/64.48 [2019-03-28 12:37:03,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. 88.12/64.48 [2019-03-28 12:37:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 88.12/64.48 [2019-03-28 12:37:03,272 INFO L394 BasicCegarLoop]: Found error trace 88.12/64.48 [2019-03-28 12:37:03,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:03,272 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 88.12/64.48 [2019-03-28 12:37:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash 4196695, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:03,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:03,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:03,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.48 [2019-03-28 12:37:03,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 88.12/64.48 [2019-03-28 12:37:03,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 88.12/64.48 [2019-03-28 12:37:03,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 88.12/64.48 [2019-03-28 12:37:03,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 88.12/64.48 [2019-03-28 12:37:03,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 88.12/64.48 [2019-03-28 12:37:03,308 INFO L87 Difference]: Start difference. First operand 34 states and 54 transitions. Second operand 3 states. 88.12/64.48 [2019-03-28 12:37:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 88.12/64.48 [2019-03-28 12:37:03,391 INFO L93 Difference]: Finished difference Result 34 states and 54 transitions. 88.12/64.48 [2019-03-28 12:37:03,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:03,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 88.12/64.48 [2019-03-28 12:37:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 88.12/64.48 [2019-03-28 12:37:03,393 INFO L225 Difference]: With dead ends: 34 88.12/64.48 [2019-03-28 12:37:03,393 INFO L226 Difference]: Without dead ends: 29 88.12/64.48 [2019-03-28 12:37:03,393 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 88.12/64.48 [2019-03-28 12:37:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 88.12/64.48 [2019-03-28 12:37:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 88.12/64.48 [2019-03-28 12:37:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 88.12/64.48 [2019-03-28 12:37:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 49 transitions. 88.12/64.48 [2019-03-28 12:37:03,397 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 49 transitions. Word has length 4 88.12/64.48 [2019-03-28 12:37:03,398 INFO L84 Accepts]: Finished accepts. word is rejected. 88.12/64.48 [2019-03-28 12:37:03,398 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 49 transitions. 88.12/64.48 [2019-03-28 12:37:03,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 49 transitions. 88.12/64.48 [2019-03-28 12:37:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 88.12/64.48 [2019-03-28 12:37:03,398 INFO L394 BasicCegarLoop]: Found error trace 88.12/64.48 [2019-03-28 12:37:03,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:03,399 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 88.12/64.48 [2019-03-28 12:37:03,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:03,399 INFO L82 PathProgramCache]: Analyzing trace with hash 130095880, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:03,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:03,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:03,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.48 [2019-03-28 12:37:03,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 88.12/64.48 [2019-03-28 12:37:03,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 88.12/64.48 [2019-03-28 12:37:03,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 88.12/64.48 [2019-03-28 12:37:03,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 88.12/64.48 [2019-03-28 12:37:03,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 88.12/64.48 [2019-03-28 12:37:03,427 INFO L87 Difference]: Start difference. First operand 29 states and 49 transitions. Second operand 3 states. 88.12/64.48 [2019-03-28 12:37:03,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 88.12/64.48 [2019-03-28 12:37:03,496 INFO L93 Difference]: Finished difference Result 29 states and 49 transitions. 88.12/64.48 [2019-03-28 12:37:03,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:03,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 88.12/64.48 [2019-03-28 12:37:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 88.12/64.48 [2019-03-28 12:37:03,498 INFO L225 Difference]: With dead ends: 29 88.12/64.48 [2019-03-28 12:37:03,498 INFO L226 Difference]: Without dead ends: 25 88.12/64.48 [2019-03-28 12:37:03,499 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 88.12/64.48 [2019-03-28 12:37:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 88.12/64.48 [2019-03-28 12:37:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 88.12/64.48 [2019-03-28 12:37:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 88.12/64.48 [2019-03-28 12:37:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 41 transitions. 88.12/64.48 [2019-03-28 12:37:03,502 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 41 transitions. Word has length 5 88.12/64.48 [2019-03-28 12:37:03,502 INFO L84 Accepts]: Finished accepts. word is rejected. 88.12/64.48 [2019-03-28 12:37:03,503 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 41 transitions. 88.12/64.48 [2019-03-28 12:37:03,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:03,503 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 41 transitions. 88.12/64.48 [2019-03-28 12:37:03,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 88.12/64.48 [2019-03-28 12:37:03,503 INFO L394 BasicCegarLoop]: Found error trace 88.12/64.48 [2019-03-28 12:37:03,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:03,504 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 88.12/64.48 [2019-03-28 12:37:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:03,504 INFO L82 PathProgramCache]: Analyzing trace with hash 130095882, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:03,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:03,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.48 [2019-03-28 12:37:03,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 88.12/64.48 [2019-03-28 12:37:03,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 88.12/64.48 [2019-03-28 12:37:03,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 88.12/64.48 [2019-03-28 12:37:03,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 88.12/64.48 [2019-03-28 12:37:03,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 88.12/64.48 [2019-03-28 12:37:03,532 INFO L87 Difference]: Start difference. First operand 25 states and 41 transitions. Second operand 3 states. 88.12/64.48 [2019-03-28 12:37:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 88.12/64.48 [2019-03-28 12:37:03,575 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. 88.12/64.48 [2019-03-28 12:37:03,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:03,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 88.12/64.48 [2019-03-28 12:37:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 88.12/64.48 [2019-03-28 12:37:03,576 INFO L225 Difference]: With dead ends: 29 88.12/64.48 [2019-03-28 12:37:03,576 INFO L226 Difference]: Without dead ends: 25 88.12/64.48 [2019-03-28 12:37:03,577 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 88.12/64.48 [2019-03-28 12:37:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 88.12/64.48 [2019-03-28 12:37:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 88.12/64.48 [2019-03-28 12:37:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 88.12/64.48 [2019-03-28 12:37:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. 88.12/64.48 [2019-03-28 12:37:03,581 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 5 88.12/64.48 [2019-03-28 12:37:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. 88.12/64.48 [2019-03-28 12:37:03,581 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 37 transitions. 88.12/64.48 [2019-03-28 12:37:03,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 37 transitions. 88.12/64.48 [2019-03-28 12:37:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 88.12/64.48 [2019-03-28 12:37:03,582 INFO L394 BasicCegarLoop]: Found error trace 88.12/64.48 [2019-03-28 12:37:03,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:03,582 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION]=== 88.12/64.48 [2019-03-28 12:37:03,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:03,583 INFO L82 PathProgramCache]: Analyzing trace with hash 130095883, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:03,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:03,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:03,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.48 [2019-03-28 12:37:03,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 88.12/64.48 [2019-03-28 12:37:03,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 88.12/64.48 [2019-03-28 12:37:03,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 88.12/64.48 [2019-03-28 12:37:03,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 88.12/64.48 [2019-03-28 12:37:03,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 88.12/64.48 [2019-03-28 12:37:03,611 INFO L87 Difference]: Start difference. First operand 25 states and 37 transitions. Second operand 3 states. 88.12/64.48 [2019-03-28 12:37:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 88.12/64.48 [2019-03-28 12:37:03,668 INFO L93 Difference]: Finished difference Result 25 states and 37 transitions. 88.12/64.48 [2019-03-28 12:37:03,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:03,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 88.12/64.48 [2019-03-28 12:37:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 88.12/64.48 [2019-03-28 12:37:03,669 INFO L225 Difference]: With dead ends: 25 88.12/64.48 [2019-03-28 12:37:03,669 INFO L226 Difference]: Without dead ends: 0 88.12/64.48 [2019-03-28 12:37:03,670 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 88.12/64.48 [2019-03-28 12:37:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 88.12/64.48 [2019-03-28 12:37:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 88.12/64.48 [2019-03-28 12:37:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 88.12/64.48 [2019-03-28 12:37:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 88.12/64.48 [2019-03-28 12:37:03,671 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 88.12/64.48 [2019-03-28 12:37:03,671 INFO L84 Accepts]: Finished accepts. word is rejected. 88.12/64.48 [2019-03-28 12:37:03,671 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 88.12/64.48 [2019-03-28 12:37:03,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:03,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 88.12/64.48 [2019-03-28 12:37:03,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 88.12/64.48 [2019-03-28 12:37:03,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 88.12/64.48 [2019-03-28 12:37:03,722 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,724 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,724 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,724 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,724 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,724 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,724 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,725 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,725 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,725 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,725 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,725 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,725 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,726 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,726 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,726 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,726 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,726 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,726 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,726 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,727 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,727 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,727 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,727 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,727 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,727 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,727 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,727 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,727 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,728 INFO L448 ceAbstractionStarter]: For program point L13-3(line 13) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,728 INFO L448 ceAbstractionStarter]: For program point L13-4(line 13) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,728 INFO L448 ceAbstractionStarter]: For program point L13-6(lines 13 19) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,728 INFO L448 ceAbstractionStarter]: For program point L13-8(lines 13 19) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,728 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,729 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,729 INFO L448 ceAbstractionStarter]: For program point L14-1(lines 14 18) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,729 INFO L444 ceAbstractionStarter]: At program point L14-3(lines 14 18) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) 88.12/64.48 [2019-03-28 12:37:03,729 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,730 INFO L444 ceAbstractionStarter]: At program point L14-4(lines 12 19) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= ULTIMATE.start_test_fun_~x_ref~0.offset 0) (= (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base) 1) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base))) 88.12/64.48 [2019-03-28 12:37:03,730 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 88.12/64.48 [2019-03-28 12:37:03,730 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 88.12/64.48 [2019-03-28 12:37:03,739 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.48 [2019-03-28 12:37:03,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.48 [2019-03-28 12:37:03,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.48 [2019-03-28 12:37:03,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.48 [2019-03-28 12:37:03,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.48 [2019-03-28 12:37:03,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.48 [2019-03-28 12:37:03,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.48 [2019-03-28 12:37:03,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.48 [2019-03-28 12:37:03,749 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.48 [2019-03-28 12:37:03,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.48 [2019-03-28 12:37:03,750 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.48 [2019-03-28 12:37:03,751 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.48 [2019-03-28 12:37:03,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:37:03 BasicIcfg 88.12/64.48 [2019-03-28 12:37:03,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 88.12/64.48 [2019-03-28 12:37:03,753 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 88.12/64.48 [2019-03-28 12:37:03,754 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 88.12/64.48 [2019-03-28 12:37:03,757 INFO L276 PluginConnector]: BuchiAutomizer initialized 88.12/64.48 [2019-03-28 12:37:03,758 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 88.12/64.48 [2019-03-28 12:37:03,758 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:37:01" (1/5) ... 88.12/64.48 [2019-03-28 12:37:03,758 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c5502d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:37:03, skipping insertion in model container 88.12/64.48 [2019-03-28 12:37:03,758 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 88.12/64.48 [2019-03-28 12:37:03,758 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:37:01" (2/5) ... 88.12/64.48 [2019-03-28 12:37:03,759 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c5502d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:37:03, skipping insertion in model container 88.12/64.48 [2019-03-28 12:37:03,759 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 88.12/64.48 [2019-03-28 12:37:03,759 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:37:01" (3/5) ... 88.12/64.48 [2019-03-28 12:37:03,759 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c5502d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:37:03, skipping insertion in model container 88.12/64.48 [2019-03-28 12:37:03,760 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 88.12/64.48 [2019-03-28 12:37:03,760 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:37:02" (4/5) ... 88.12/64.48 [2019-03-28 12:37:03,760 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c5502d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:37:03, skipping insertion in model container 88.12/64.48 [2019-03-28 12:37:03,760 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 88.12/64.48 [2019-03-28 12:37:03,760 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:37:03" (5/5) ... 88.12/64.48 [2019-03-28 12:37:03,762 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 88.12/64.48 [2019-03-28 12:37:03,782 INFO L133 ementStrategyFactory]: Using default assertion order modulation 88.12/64.48 [2019-03-28 12:37:03,783 INFO L374 BuchiCegarLoop]: Interprodecural is true 88.12/64.48 [2019-03-28 12:37:03,783 INFO L375 BuchiCegarLoop]: Hoare is true 88.12/64.48 [2019-03-28 12:37:03,783 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 88.12/64.48 [2019-03-28 12:37:03,783 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 88.12/64.48 [2019-03-28 12:37:03,783 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 88.12/64.48 [2019-03-28 12:37:03,783 INFO L379 BuchiCegarLoop]: Difference is false 88.12/64.48 [2019-03-28 12:37:03,783 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 88.12/64.48 [2019-03-28 12:37:03,783 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 88.12/64.48 [2019-03-28 12:37:03,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. 88.12/64.48 [2019-03-28 12:37:03,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 88.12/64.48 [2019-03-28 12:37:03,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 88.12/64.48 [2019-03-28 12:37:03,794 INFO L119 BuchiIsEmpty]: Starting construction of run 88.12/64.48 [2019-03-28 12:37:03,798 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:03,798 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:03,799 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 88.12/64.48 [2019-03-28 12:37:03,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. 88.12/64.48 [2019-03-28 12:37:03,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 88.12/64.48 [2019-03-28 12:37:03,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 88.12/64.48 [2019-03-28 12:37:03,801 INFO L119 BuchiIsEmpty]: Starting construction of run 88.12/64.48 [2019-03-28 12:37:03,802 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:03,802 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:03,807 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue [104] 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] 5#L-1true [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short6, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 6#L10true [87] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 44#L10-1true [134] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 23#L11true [105] L11-->L14-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 7#L14-4true 88.12/64.48 [2019-03-28 12:37:03,808 INFO L796 eck$LassoCheckResult]: Loop: 7#L14-4true [91] L14-4-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 50#L13true [143] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 48#L13-1true [211] L13-1-->L13-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_3| |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short6_2|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 47#L13-2true [141] L13-2-->L13-6: Formula: (not |v_ULTIMATE.start_test_fun_#t~short6_5|) InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_5|} OutVars{ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_5|} AuxVars[] AssignedVars[] 31#L13-6true [122] L13-6-->L14-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_9| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short6] 9#L14-3true [95] L14-3-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 12#L14-1true [166] L14-1-->L14-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 7#L14-4true 88.12/64.48 [2019-03-28 12:37:03,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:03,809 INFO L82 PathProgramCache]: Analyzing trace with hash 130304327, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:03,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:03,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:03,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.48 [2019-03-28 12:37:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.48 [2019-03-28 12:37:03,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:03,857 INFO L82 PathProgramCache]: Analyzing trace with hash 899451794, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:03,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:03,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.48 [2019-03-28 12:37:03,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 88.12/64.48 [2019-03-28 12:37:03,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 88.12/64.48 [2019-03-28 12:37:03,873 INFO L811 eck$LassoCheckResult]: loop already infeasible 88.12/64.48 [2019-03-28 12:37:03,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 88.12/64.48 [2019-03-28 12:37:03,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 88.12/64.48 [2019-03-28 12:37:03,874 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. 88.12/64.48 [2019-03-28 12:37:04,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 88.12/64.48 [2019-03-28 12:37:04,022 INFO L93 Difference]: Finished difference Result 51 states and 91 transitions. 88.12/64.48 [2019-03-28 12:37:04,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:04,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 91 transitions. 88.12/64.48 [2019-03-28 12:37:04,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 88.12/64.48 [2019-03-28 12:37:04,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 22 states and 34 transitions. 88.12/64.48 [2019-03-28 12:37:04,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 88.12/64.48 [2019-03-28 12:37:04,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 88.12/64.48 [2019-03-28 12:37:04,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 34 transitions. 88.12/64.48 [2019-03-28 12:37:04,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 88.12/64.48 [2019-03-28 12:37:04,030 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 34 transitions. 88.12/64.48 [2019-03-28 12:37:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 34 transitions. 88.12/64.48 [2019-03-28 12:37:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. 88.12/64.48 [2019-03-28 12:37:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 88.12/64.48 [2019-03-28 12:37:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. 88.12/64.48 [2019-03-28 12:37:04,033 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. 88.12/64.48 [2019-03-28 12:37:04,034 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. 88.12/64.48 [2019-03-28 12:37:04,034 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 88.12/64.48 [2019-03-28 12:37:04,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. 88.12/64.48 [2019-03-28 12:37:04,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 88.12/64.48 [2019-03-28 12:37:04,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 88.12/64.48 [2019-03-28 12:37:04,035 INFO L119 BuchiIsEmpty]: Starting construction of run 88.12/64.48 [2019-03-28 12:37:04,035 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:04,035 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:04,036 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY [104] 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] 120#L-1 [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short6, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 121#L10 [87] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 118#L10-1 [134] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 119#L11 [105] L11-->L14-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 122#L14-4 88.12/64.48 [2019-03-28 12:37:04,037 INFO L796 eck$LassoCheckResult]: Loop: 122#L14-4 [91] L14-4-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 123#L13 [143] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 128#L13-1 [212] L13-1-->L13-2: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short6_2|) (> |v_ULTIMATE.start_test_fun_#t~mem4_3| |v_ULTIMATE.start_test_fun_#t~mem3_3|)) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 129#L13-2 [141] L13-2-->L13-6: Formula: (not |v_ULTIMATE.start_test_fun_#t~short6_5|) InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_5|} OutVars{ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_5|} AuxVars[] AssignedVars[] 116#L13-6 [122] L13-6-->L14-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_9| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short6] 115#L14-3 [95] L14-3-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 127#L14-1 [166] L14-1-->L14-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 122#L14-4 88.12/64.48 [2019-03-28 12:37:04,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:04,037 INFO L82 PathProgramCache]: Analyzing trace with hash 130304327, now seen corresponding path program 2 times 88.12/64.48 [2019-03-28 12:37:04,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:04,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:04,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.48 [2019-03-28 12:37:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.48 [2019-03-28 12:37:04,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:04,061 INFO L82 PathProgramCache]: Analyzing trace with hash 900375315, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:04,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:04,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:04,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.48 [2019-03-28 12:37:04,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 88.12/64.48 [2019-03-28 12:37:04,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 88.12/64.48 [2019-03-28 12:37:04,072 INFO L811 eck$LassoCheckResult]: loop already infeasible 88.12/64.48 [2019-03-28 12:37:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 88.12/64.48 [2019-03-28 12:37:04,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 88.12/64.48 [2019-03-28 12:37:04,072 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. 88.12/64.48 [2019-03-28 12:37:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 88.12/64.48 [2019-03-28 12:37:04,109 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. 88.12/64.48 [2019-03-28 12:37:04,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 88.12/64.48 [2019-03-28 12:37:04,110 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 32 transitions. 88.12/64.48 [2019-03-28 12:37:04,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 88.12/64.48 [2019-03-28 12:37:04,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 28 transitions. 88.12/64.48 [2019-03-28 12:37:04,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 88.12/64.48 [2019-03-28 12:37:04,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 88.12/64.48 [2019-03-28 12:37:04,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. 88.12/64.48 [2019-03-28 12:37:04,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 88.12/64.48 [2019-03-28 12:37:04,112 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. 88.12/64.48 [2019-03-28 12:37:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. 88.12/64.48 [2019-03-28 12:37:04,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 88.12/64.48 [2019-03-28 12:37:04,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 88.12/64.48 [2019-03-28 12:37:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. 88.12/64.48 [2019-03-28 12:37:04,114 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. 88.12/64.48 [2019-03-28 12:37:04,114 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. 88.12/64.48 [2019-03-28 12:37:04,114 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 88.12/64.48 [2019-03-28 12:37:04,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. 88.12/64.48 [2019-03-28 12:37:04,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 88.12/64.48 [2019-03-28 12:37:04,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 88.12/64.48 [2019-03-28 12:37:04,115 INFO L119 BuchiIsEmpty]: Starting construction of run 88.12/64.48 [2019-03-28 12:37:04,116 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:04,116 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:04,116 INFO L794 eck$LassoCheckResult]: Stem: 174#ULTIMATE.startENTRY [104] 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] 169#L-1 [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short6, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 170#L10 [87] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 166#L10-1 [134] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 167#L11 [105] L11-->L14-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 171#L14-4 88.12/64.48 [2019-03-28 12:37:04,117 INFO L796 eck$LassoCheckResult]: Loop: 171#L14-4 [91] L14-4-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 172#L13 [143] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 177#L13-1 [211] L13-1-->L13-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_3| |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short6_2|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 175#L13-2 [140] L13-2-->L13-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_3| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_3|} OutVars{ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_3|} AuxVars[] AssignedVars[] 173#L13-3 [137] L13-3-->L13-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 168#L13-4 [218] L13-4-->L13-6: Formula: (and |v_ULTIMATE.start_test_fun_#t~short6_4| (< 0 |v_ULTIMATE.start_test_fun_#t~mem5_3|)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 165#L13-6 [122] L13-6-->L14-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_9| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short6] 164#L14-3 [95] L14-3-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 176#L14-1 [166] L14-1-->L14-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 171#L14-4 88.12/64.48 [2019-03-28 12:37:04,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:04,117 INFO L82 PathProgramCache]: Analyzing trace with hash 130304327, now seen corresponding path program 3 times 88.12/64.48 [2019-03-28 12:37:04,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:04,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:04,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.48 [2019-03-28 12:37:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.48 [2019-03-28 12:37:04,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:04,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1073596322, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:04,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:04,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:04,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.48 [2019-03-28 12:37:04,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 88.12/64.48 [2019-03-28 12:37:04,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 88.12/64.48 [2019-03-28 12:37:04,193 INFO L811 eck$LassoCheckResult]: loop already infeasible 88.12/64.48 [2019-03-28 12:37:04,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 88.12/64.48 [2019-03-28 12:37:04,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 88.12/64.48 [2019-03-28 12:37:04,193 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 9 Second operand 8 states. 88.12/64.48 [2019-03-28 12:37:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 88.12/64.48 [2019-03-28 12:37:04,360 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. 88.12/64.48 [2019-03-28 12:37:04,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 88.12/64.48 [2019-03-28 12:37:04,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 32 transitions. 88.12/64.48 [2019-03-28 12:37:04,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 88.12/64.48 [2019-03-28 12:37:04,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 32 transitions. 88.12/64.48 [2019-03-28 12:37:04,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 88.12/64.48 [2019-03-28 12:37:04,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 88.12/64.48 [2019-03-28 12:37:04,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. 88.12/64.48 [2019-03-28 12:37:04,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 88.12/64.48 [2019-03-28 12:37:04,363 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. 88.12/64.48 [2019-03-28 12:37:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. 88.12/64.48 [2019-03-28 12:37:04,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. 88.12/64.48 [2019-03-28 12:37:04,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 88.12/64.48 [2019-03-28 12:37:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. 88.12/64.48 [2019-03-28 12:37:04,365 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. 88.12/64.48 [2019-03-28 12:37:04,365 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. 88.12/64.48 [2019-03-28 12:37:04,365 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 88.12/64.48 [2019-03-28 12:37:04,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. 88.12/64.48 [2019-03-28 12:37:04,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 88.12/64.48 [2019-03-28 12:37:04,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 88.12/64.48 [2019-03-28 12:37:04,366 INFO L119 BuchiIsEmpty]: Starting construction of run 88.12/64.48 [2019-03-28 12:37:04,367 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:04,367 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 88.12/64.48 [2019-03-28 12:37:04,368 INFO L794 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY [104] 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] 235#L-1 [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short6, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 236#L10 [87] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 232#L10-1 [134] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 233#L11 [105] L11-->L14-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 237#L14-4 88.12/64.48 [2019-03-28 12:37:04,369 INFO L796 eck$LassoCheckResult]: Loop: 237#L14-4 [91] L14-4-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 238#L13 [143] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 243#L13-1 [211] L13-1-->L13-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_3| |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short6_2|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 241#L13-2 [140] L13-2-->L13-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_3| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_3|} OutVars{ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_3|} AuxVars[] AssignedVars[] 239#L13-3 [137] L13-3-->L13-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 234#L13-4 [218] L13-4-->L13-6: Formula: (and |v_ULTIMATE.start_test_fun_#t~short6_4| (< 0 |v_ULTIMATE.start_test_fun_#t~mem5_3|)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 230#L13-6 [122] L13-6-->L14-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_9| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short6] 231#L14-3 [95] L14-3-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 244#L14-1 [99] L14-1-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem7_6|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 223#L15 [101] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 224#L15-1 [252] L15-1-->L16: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| (- 1)))) |v_#memory_int_25|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_18))) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 227#L16 [118] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 225#L16-1 [253] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13) (= |v_#memory_int_27| (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~y_ref~0.base_18))) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 226#L17 [131] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 228#L17-1 [254] L17-1-->L14-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 229#L14-3 [95] L14-3-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 242#L14-1 [166] L14-1-->L14-4: Formula: (>= 0 |v_ULTIMATE.start_test_fun_#t~mem7_4|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_4|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 237#L14-4 88.12/64.48 [2019-03-28 12:37:04,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:04,369 INFO L82 PathProgramCache]: Analyzing trace with hash 130304327, now seen corresponding path program 4 times 88.12/64.48 [2019-03-28 12:37:04,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:04,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:04,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.48 [2019-03-28 12:37:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.48 [2019-03-28 12:37:04,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:04,390 INFO L82 PathProgramCache]: Analyzing trace with hash 279799391, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:04,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:04,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:04,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.48 [2019-03-28 12:37:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.48 [2019-03-28 12:37:04,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:04,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1657278937, now seen corresponding path program 1 times 88.12/64.48 [2019-03-28 12:37:04,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.48 [2019-03-28 12:37:04,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.48 [2019-03-28 12:37:04,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.48 [2019-03-28 12:37:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.48 [2019-03-28 12:37:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.48 [2019-03-28 12:37:04,698 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 88.12/64.48 [2019-03-28 12:37:05,101 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 88.12/64.48 [2019-03-28 12:37:05,267 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 82 88.12/64.48 [2019-03-28 12:37:05,281 INFO L216 LassoAnalysis]: Preferences: 88.12/64.48 [2019-03-28 12:37:05,282 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 88.12/64.48 [2019-03-28 12:37:05,282 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 88.12/64.48 [2019-03-28 12:37:05,282 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 88.12/64.48 [2019-03-28 12:37:05,283 INFO L127 ssoRankerPreferences]: Use exernal solver: false 88.12/64.48 [2019-03-28 12:37:05,283 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 88.12/64.48 [2019-03-28 12:37:05,283 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 88.12/64.48 [2019-03-28 12:37:05,283 INFO L130 ssoRankerPreferences]: Path of dumped script: 88.12/64.48 [2019-03-28 12:37:05,283 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 88.12/64.48 [2019-03-28 12:37:05,283 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 88.12/64.48 [2019-03-28 12:37:05,284 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 88.12/64.48 [2019-03-28 12:37:05,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,635 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 88.12/64.48 [2019-03-28 12:37:05,764 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 88.12/64.48 [2019-03-28 12:37:05,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:05,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.48 [2019-03-28 12:37:06,225 INFO L300 LassoAnalysis]: Preprocessing complete. 88.12/64.48 [2019-03-28 12:37:06,231 INFO L497 LassoAnalysis]: Using template 'affine'. 88.12/64.48 [2019-03-28 12:37:06,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.48 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.48 Number of strict supporting invariants: 0 88.12/64.48 Number of non-strict supporting invariants: 1 88.12/64.48 Consider only non-deceasing supporting invariants: true 88.12/64.48 Simplify termination arguments: true 88.12/64.48 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.48 [2019-03-28 12:37:06,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.48 [2019-03-28 12:37:06,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 88.12/64.48 [2019-03-28 12:37:06,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.48 [2019-03-28 12:37:06,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.48 [2019-03-28 12:37:06,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.48 [2019-03-28 12:37:06,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 88.12/64.48 [2019-03-28 12:37:06,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 88.12/64.48 [2019-03-28 12:37:06,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.48 [2019-03-28 12:37:06,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.48 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.48 Number of strict supporting invariants: 0 88.12/64.48 Number of non-strict supporting invariants: 1 88.12/64.48 Consider only non-deceasing supporting invariants: true 88.12/64.48 Simplify termination arguments: true 88.12/64.48 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.48 [2019-03-28 12:37:06,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.48 [2019-03-28 12:37:06,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 88.12/64.48 [2019-03-28 12:37:06,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.48 [2019-03-28 12:37:06,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.48 [2019-03-28 12:37:06,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.48 [2019-03-28 12:37:06,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 88.12/64.48 [2019-03-28 12:37:06,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 88.12/64.48 [2019-03-28 12:37:06,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.48 [2019-03-28 12:37:06,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.48 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.48 Number of strict supporting invariants: 0 88.12/64.48 Number of non-strict supporting invariants: 1 88.12/64.48 Consider only non-deceasing supporting invariants: true 88.12/64.48 Simplify termination arguments: true 88.12/64.48 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.48 [2019-03-28 12:37:06,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.48 [2019-03-28 12:37:06,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 88.12/64.48 [2019-03-28 12:37:06,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.48 [2019-03-28 12:37:06,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.48 [2019-03-28 12:37:06,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.48 [2019-03-28 12:37:06,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 88.12/64.48 [2019-03-28 12:37:06,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 88.12/64.48 [2019-03-28 12:37:06,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.48 [2019-03-28 12:37:06,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.48 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.48 Number of strict supporting invariants: 0 88.12/64.48 Number of non-strict supporting invariants: 1 88.12/64.48 Consider only non-deceasing supporting invariants: true 88.12/64.48 Simplify termination arguments: true 88.12/64.48 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.48 [2019-03-28 12:37:06,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.48 [2019-03-28 12:37:06,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 88.12/64.48 [2019-03-28 12:37:06,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.48 [2019-03-28 12:37:06,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.48 [2019-03-28 12:37:06,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.48 [2019-03-28 12:37:06,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 88.12/64.48 [2019-03-28 12:37:06,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 88.12/64.48 [2019-03-28 12:37:06,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.48 [2019-03-28 12:37:06,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.48 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.48 Number of strict supporting invariants: 0 88.12/64.48 Number of non-strict supporting invariants: 1 88.12/64.48 Consider only non-deceasing supporting invariants: true 88.12/64.48 Simplify termination arguments: true 88.12/64.48 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.48 [2019-03-28 12:37:06,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.48 [2019-03-28 12:37:06,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.48 [2019-03-28 12:37:06,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.48 [2019-03-28 12:37:06,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.48 [2019-03-28 12:37:06,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 88.12/64.48 [2019-03-28 12:37:06,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 88.12/64.48 [2019-03-28 12:37:06,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.48 [2019-03-28 12:37:06,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.48 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.48 Number of strict supporting invariants: 0 88.12/64.48 Number of non-strict supporting invariants: 1 88.12/64.48 Consider only non-deceasing supporting invariants: true 88.12/64.48 Simplify termination arguments: true 88.12/64.48 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.48 [2019-03-28 12:37:06,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.48 [2019-03-28 12:37:06,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 88.12/64.48 [2019-03-28 12:37:06,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.48 [2019-03-28 12:37:06,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.48 [2019-03-28 12:37:06,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.48 [2019-03-28 12:37:06,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 88.12/64.48 [2019-03-28 12:37:06,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 88.12/64.48 [2019-03-28 12:37:06,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.48 [2019-03-28 12:37:06,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.48 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.48 Number of strict supporting invariants: 0 88.12/64.48 Number of non-strict supporting invariants: 1 88.12/64.48 Consider only non-deceasing supporting invariants: true 88.12/64.48 Simplify termination arguments: true 88.12/64.48 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.48 [2019-03-28 12:37:06,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.48 [2019-03-28 12:37:06,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.48 [2019-03-28 12:37:06,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.48 [2019-03-28 12:37:06,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.48 [2019-03-28 12:37:06,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 88.12/64.48 [2019-03-28 12:37:06,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 88.12/64.48 [2019-03-28 12:37:06,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.48 [2019-03-28 12:37:06,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.48 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.48 Number of strict supporting invariants: 0 88.12/64.48 Number of non-strict supporting invariants: 1 88.12/64.48 Consider only non-deceasing supporting invariants: true 88.12/64.48 Simplify termination arguments: true 88.12/64.48 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.48 [2019-03-28 12:37:06,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.48 [2019-03-28 12:37:06,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.48 [2019-03-28 12:37:06,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.48 [2019-03-28 12:37:06,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.48 [2019-03-28 12:37:06,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 88.12/64.48 [2019-03-28 12:37:06,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 88.12/64.48 [2019-03-28 12:37:06,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.48 [2019-03-28 12:37:06,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.48 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.48 Number of strict supporting invariants: 0 88.12/64.48 Number of non-strict supporting invariants: 1 88.12/64.48 Consider only non-deceasing supporting invariants: true 88.12/64.48 Simplify termination arguments: true 88.12/64.48 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.48 [2019-03-28 12:37:06,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.48 [2019-03-28 12:37:06,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.48 [2019-03-28 12:37:06,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.48 [2019-03-28 12:37:06,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.48 [2019-03-28 12:37:06,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 88.12/64.48 [2019-03-28 12:37:06,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 88.12/64.48 [2019-03-28 12:37:06,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 88.12/64.48 [2019-03-28 12:37:06,322 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 88.12/64.48 [2019-03-28 12:37:06,323 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. 88.12/64.48 [2019-03-28 12:37:06,325 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 88.12/64.48 [2019-03-28 12:37:06,327 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 88.12/64.48 [2019-03-28 12:37:06,327 INFO L518 LassoAnalysis]: Proved termination. 88.12/64.48 [2019-03-28 12:37:06,328 INFO L520 LassoAnalysis]: Termination argument consisting of: 88.12/64.48 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 88.12/64.48 Supporting invariants [] 88.12/64.48 [2019-03-28 12:37:06,422 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 88.12/64.48 [2019-03-28 12:37:06,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 88.12/64.48 [2019-03-28 12:37:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.48 [2019-03-28 12:37:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:06,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core 88.12/64.48 [2019-03-28 12:37:06,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.48 [2019-03-28 12:37:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:06,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core 88.12/64.48 [2019-03-28 12:37:06,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.48 [2019-03-28 12:37:06,590 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 35 treesize of output 19 88.12/64.48 [2019-03-28 12:37:06,591 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:06,599 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:06,600 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:06,600 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 88.12/64.48 [2019-03-28 12:37:06,641 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:06,641 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 1 case distinctions, treesize of input 23 treesize of output 48 88.12/64.48 [2019-03-28 12:37:06,645 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:06,671 INFO L497 ElimStorePlain]: treesize reduction 18, result has 65.4 percent of original size 88.12/64.48 [2019-03-28 12:37:06,672 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:06,672 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:25 88.12/64.48 [2019-03-28 12:37:06,704 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 27 treesize of output 23 88.12/64.48 [2019-03-28 12:37:06,704 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:06,711 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 30 treesize of output 29 88.12/64.48 [2019-03-28 12:37:06,712 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:06,731 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:06,732 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 88.12/64.48 [2019-03-28 12:37:06,732 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:32 88.12/64.48 [2019-03-28 12:37:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.48 [2019-03-28 12:37:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:07,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core 88.12/64.48 [2019-03-28 12:37:07,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.48 [2019-03-28 12:37:07,033 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 35 treesize of output 19 88.12/64.48 [2019-03-28 12:37:07,034 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:07,043 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:07,043 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:07,043 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 88.12/64.48 [2019-03-28 12:37:07,100 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:07,101 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 63 88.12/64.48 [2019-03-28 12:37:07,107 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:07,178 INFO L497 ElimStorePlain]: treesize reduction 35, result has 57.8 percent of original size 88.12/64.48 [2019-03-28 12:37:07,180 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:07,180 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 88.12/64.48 [2019-03-28 12:37:12,851 WARN L188 SmtUtils]: Spent 2.82 s on a formula simplification that was a NOOP. DAG size: 26 88.12/64.48 [2019-03-28 12:37:12,872 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 23 treesize of output 22 88.12/64.48 [2019-03-28 12:37:12,873 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:12,880 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:12,881 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:12,881 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 88.12/64.48 [2019-03-28 12:37:14,312 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_test_fun_~y_ref~0.offset Int) (ULTIMATE.start_test_fun_~y_ref~0.base Int)) (not (and (= ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (= c_ULTIMATE.start_test_fun_~x_ref~0.base ULTIMATE.start_test_fun_~y_ref~0.base)))) (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~x_ref~0.base) c_ULTIMATE.start_test_fun_~x_ref~0.offset) 2) c_oldRank0)) is different from true 88.12/64.48 [2019-03-28 12:37:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:14,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core 88.12/64.48 [2019-03-28 12:37:14,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.48 [2019-03-28 12:37:14,496 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:14,497 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 88.12/64.48 [2019-03-28 12:37:14,503 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:14,568 INFO L497 ElimStorePlain]: treesize reduction 56, result has 41.1 percent of original size 88.12/64.48 [2019-03-28 12:37:14,569 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:14,569 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:42 88.12/64.48 [2019-03-28 12:37:14,729 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:14,730 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 70 88.12/64.48 [2019-03-28 12:37:14,736 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:14,747 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 88.12/64.48 [2019-03-28 12:37:14,748 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:14,830 INFO L497 ElimStorePlain]: treesize reduction 71, result has 41.8 percent of original size 88.12/64.48 [2019-03-28 12:37:14,831 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 88.12/64.48 [2019-03-28 12:37:14,831 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:36 88.12/64.48 [2019-03-28 12:37:14,943 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 34 treesize of output 26 88.12/64.48 [2019-03-28 12:37:14,944 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:14,998 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:14,999 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 89 88.12/64.48 [2019-03-28 12:37:15,009 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:15,092 INFO L497 ElimStorePlain]: treesize reduction 94, result has 44.0 percent of original size 88.12/64.48 [2019-03-28 12:37:15,094 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 2 xjuncts. 88.12/64.48 [2019-03-28 12:37:15,094 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:57 88.12/64.48 [2019-03-28 12:37:19,920 WARN L188 SmtUtils]: Spent 3.82 s on a formula simplification that was a NOOP. DAG size: 36 88.12/64.48 [2019-03-28 12:37:26,426 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset)) (= c_ULTIMATE.start_test_fun_~y_ref~0.offset c_ULTIMATE.start_test_fun_~x_ref~0.offset) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 88.12/64.48 [2019-03-28 12:37:27,540 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset)) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base)))) (= c_ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base)) is different from true 88.12/64.48 [2019-03-28 12:37:28,472 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~c~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset)) (<= 1 c_oldRank0) (exists ((ULTIMATE.start_test_fun_~c~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~c~0.offset) (= c_ULTIMATE.start_test_fun_~y_ref~0.base c_ULTIMATE.start_test_fun_~c~0.base))))) is different from true 88.12/64.48 [2019-03-28 12:37:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:29,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core 88.12/64.48 [2019-03-28 12:37:29,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.48 [2019-03-28 12:37:29,005 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 88.12/64.48 [2019-03-28 12:37:29,006 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:29,007 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:29,007 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:29,008 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:4 88.12/64.48 [2019-03-28 12:37:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:29,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core 88.12/64.48 [2019-03-28 12:37:29,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.48 [2019-03-28 12:37:29,704 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 88.12/64.48 [2019-03-28 12:37:29,704 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:29,706 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:29,706 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:29,707 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:4 88.12/64.48 [2019-03-28 12:37:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:29,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core 88.12/64.48 [2019-03-28 12:37:29,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.48 [2019-03-28 12:37:29,937 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 88.12/64.48 [2019-03-28 12:37:29,937 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:29,939 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:29,939 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:29,939 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:4 88.12/64.48 [2019-03-28 12:37:29,955 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:29,956 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 88.12/64.48 [2019-03-28 12:37:29,959 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 88.12/64.48 [2019-03-28 12:37:29,969 INFO L497 ElimStorePlain]: treesize reduction 13, result has 38.1 percent of original size 88.12/64.48 [2019-03-28 12:37:29,969 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:29,970 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:8 88.12/64.48 [2019-03-28 12:37:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:30,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core 88.12/64.48 [2019-03-28 12:37:30,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.48 [2019-03-28 12:37:30,204 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 88.12/64.48 [2019-03-28 12:37:30,204 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:30,206 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:30,206 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:30,206 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:4 88.12/64.48 [2019-03-28 12:37:30,219 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:30,219 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 88.12/64.48 [2019-03-28 12:37:30,221 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 88.12/64.48 [2019-03-28 12:37:30,230 INFO L497 ElimStorePlain]: treesize reduction 13, result has 38.1 percent of original size 88.12/64.48 [2019-03-28 12:37:30,231 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:30,231 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:8 88.12/64.48 [2019-03-28 12:37:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:30,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core 88.12/64.48 [2019-03-28 12:37:30,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.48 [2019-03-28 12:37:30,373 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 88.12/64.48 [2019-03-28 12:37:30,374 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:30,375 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:30,375 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:30,375 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:4 88.12/64.48 [2019-03-28 12:37:30,397 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:30,398 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 88.12/64.48 [2019-03-28 12:37:30,400 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 88.12/64.48 [2019-03-28 12:37:30,413 INFO L497 ElimStorePlain]: treesize reduction 13, result has 38.1 percent of original size 88.12/64.48 [2019-03-28 12:37:30,414 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:30,414 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:8 88.12/64.48 [2019-03-28 12:37:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.48 [2019-03-28 12:37:30,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core 88.12/64.48 [2019-03-28 12:37:30,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.48 [2019-03-28 12:37:30,560 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 88.12/64.48 [2019-03-28 12:37:30,560 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:30,562 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.48 [2019-03-28 12:37:30,562 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.48 [2019-03-28 12:37:30,562 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:4 88.12/64.48 [2019-03-28 12:37:30,577 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.49 [2019-03-28 12:37:30,578 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 88.12/64.49 [2019-03-28 12:37:30,579 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 88.12/64.49 [2019-03-28 12:37:30,590 INFO L497 ElimStorePlain]: treesize reduction 13, result has 38.1 percent of original size 88.12/64.49 [2019-03-28 12:37:30,590 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:30,590 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:8 88.12/64.49 [2019-03-28 12:37:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.49 [2019-03-28 12:37:30,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core 88.12/64.49 [2019-03-28 12:37:30,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.49 [2019-03-28 12:37:31,111 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.49 [2019-03-28 12:37:31,112 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 88.12/64.49 [2019-03-28 12:37:31,114 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 88.12/64.49 [2019-03-28 12:37:31,130 INFO L497 ElimStorePlain]: treesize reduction 16, result has 42.9 percent of original size 88.12/64.49 [2019-03-28 12:37:31,130 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:31,131 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 88.12/64.49 [2019-03-28 12:37:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.49 [2019-03-28 12:37:31,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core 88.12/64.49 [2019-03-28 12:37:31,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.49 [2019-03-28 12:37:31,378 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 35 treesize of output 19 88.12/64.49 [2019-03-28 12:37:31,379 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:31,387 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.49 [2019-03-28 12:37:31,387 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:31,387 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:17 88.12/64.49 [2019-03-28 12:37:31,413 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.49 [2019-03-28 12:37:31,413 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 63 88.12/64.49 [2019-03-28 12:37:31,417 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:31,462 INFO L497 ElimStorePlain]: treesize reduction 43, result has 52.7 percent of original size 88.12/64.49 [2019-03-28 12:37:31,463 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:31,464 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 88.12/64.49 [2019-03-28 12:37:31,480 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 23 treesize of output 22 88.12/64.49 [2019-03-28 12:37:31,481 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:31,489 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.49 [2019-03-28 12:37:31,489 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:31,489 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 88.12/64.49 [2019-03-28 12:37:31,508 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 48 predicates after loop cannibalization 88.12/64.49 [2019-03-28 12:37:31,514 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 48 loop predicates 88.12/64.49 [2019-03-28 12:37:31,515 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 22 states and 30 transitions. cyclomatic complexity: 9 Second operand 10 states. 88.12/64.49 [2019-03-28 12:37:45,669 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 88.12/64.49 [2019-03-28 12:37:46,842 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 22 states and 30 transitions. cyclomatic complexity: 9. Second operand 10 states. Result 325 states and 345 transitions. Complement of second has 217 states. 88.12/64.49 [2019-03-28 12:37:46,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 64 states 4 stem states 54 non-accepting loop states 5 accepting loop states 88.12/64.49 [2019-03-28 12:37:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 88.12/64.49 [2019-03-28 12:37:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 176 transitions. 88.12/64.49 [2019-03-28 12:37:46,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 176 transitions. Stem has 5 letters. Loop has 17 letters. 88.12/64.49 [2019-03-28 12:37:46,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. 88.12/64.49 [2019-03-28 12:37:46,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 176 transitions. Stem has 22 letters. Loop has 17 letters. 88.12/64.49 [2019-03-28 12:37:46,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. 88.12/64.49 [2019-03-28 12:37:46,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 176 transitions. Stem has 5 letters. Loop has 34 letters. 88.12/64.49 [2019-03-28 12:37:46,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. 88.12/64.49 [2019-03-28 12:37:46,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 345 transitions. 88.12/64.49 [2019-03-28 12:37:46,866 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 88.12/64.49 [2019-03-28 12:37:46,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 110 states and 117 transitions. 88.12/64.49 [2019-03-28 12:37:46,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 88.12/64.49 [2019-03-28 12:37:46,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 88.12/64.49 [2019-03-28 12:37:46,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 117 transitions. 88.12/64.49 [2019-03-28 12:37:46,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 88.12/64.49 [2019-03-28 12:37:46,869 INFO L706 BuchiCegarLoop]: Abstraction has 110 states and 117 transitions. 88.12/64.49 [2019-03-28 12:37:46,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 117 transitions. 88.12/64.49 [2019-03-28 12:37:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 20. 88.12/64.49 [2019-03-28 12:37:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 88.12/64.49 [2019-03-28 12:37:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. 88.12/64.49 [2019-03-28 12:37:46,872 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. 88.12/64.49 [2019-03-28 12:37:46,872 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. 88.12/64.49 [2019-03-28 12:37:46,872 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 88.12/64.49 [2019-03-28 12:37:46,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. 88.12/64.49 [2019-03-28 12:37:46,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 88.12/64.49 [2019-03-28 12:37:46,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 88.12/64.49 [2019-03-28 12:37:46,873 INFO L119 BuchiIsEmpty]: Starting construction of run 88.12/64.49 [2019-03-28 12:37:46,874 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 88.12/64.49 [2019-03-28 12:37:46,874 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 88.12/64.49 [2019-03-28 12:37:46,875 INFO L794 eck$LassoCheckResult]: Stem: 1671#ULTIMATE.startENTRY [104] 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] 1666#L-1 [186] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (= (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~short6, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 1667#L10 [87] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 1664#L10-1 [134] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3)) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 1665#L11 [105] L11-->L14-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 1669#L14-4 [91] L14-4-->L13: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 1670#L13 [143] L13-->L13-1: Formula: (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (= (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) 1) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 1674#L13-1 [211] L13-1-->L13-2: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem4_3| |v_ULTIMATE.start_test_fun_#t~mem3_3|) |v_ULTIMATE.start_test_fun_#t~short6_2|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_2|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 1673#L13-2 [140] L13-2-->L13-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_3| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_3|} OutVars{ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_3|} AuxVars[] AssignedVars[] 1668#L13-3 [137] L13-3-->L13-4: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 1663#L13-4 [218] L13-4-->L13-6: Formula: (and |v_ULTIMATE.start_test_fun_#t~short6_4| (< 0 |v_ULTIMATE.start_test_fun_#t~mem5_3|)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_4|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short6] 1662#L13-6 [122] L13-6-->L14-3: Formula: |v_ULTIMATE.start_test_fun_#t~short6_9| InVars {ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_9|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short6=|v_ULTIMATE.start_test_fun_#t~short6_8|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#t~short6] 1661#L14-3 88.12/64.49 [2019-03-28 12:37:46,875 INFO L796 eck$LassoCheckResult]: Loop: 1661#L14-3 [95] L14-3-->L14-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 1672#L14-1 [99] L14-1-->L15: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem7_6|) InVars {ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 1655#L15 [101] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) 1)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 1656#L15-1 [252] L15-1-->L16: Formula: (and (= (select |v_#valid_47| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) 1) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| (- 1)))) |v_#memory_int_25|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_18))) InVars {#valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{#valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_37|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 1659#L16 [118] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_9 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~y_ref~0.base_12)) (= (select |v_#valid_25| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) 1) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_9) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_test_fun_~y_ref~0.base_12) v_ULTIMATE.start_test_fun_~y_ref~0.offset_9))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9, #valid=|v_#valid_25|} OutVars{#valid=|v_#valid_25|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_12, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 1657#L16-1 [253] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~y_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_13) (= |v_#memory_int_27| (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~y_ref~0.base_18) v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| (- 1))))) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~y_ref~0.base_18))) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_27|, #length=|v_#length_38|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_18, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_13} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 1658#L17 [131] L17-->L17-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 1660#L17-1 [254] L17-1-->L14-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= (select |v_#valid_49| v_ULTIMATE.start_test_fun_~c~0.base_19) 1) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_30| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_29|)) InVars {ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_30|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 1661#L14-3 88.12/64.49 [2019-03-28 12:37:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.49 [2019-03-28 12:37:46,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1186347573, now seen corresponding path program 1 times 88.12/64.49 [2019-03-28 12:37:46,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.49 [2019-03-28 12:37:46,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.49 [2019-03-28 12:37:46,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.49 [2019-03-28 12:37:46,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.49 [2019-03-28 12:37:46,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.49 [2019-03-28 12:37:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.49 [2019-03-28 12:37:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.49 [2019-03-28 12:37:46,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.49 [2019-03-28 12:37:46,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1347355646, now seen corresponding path program 1 times 88.12/64.49 [2019-03-28 12:37:46,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.49 [2019-03-28 12:37:46,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.49 [2019-03-28 12:37:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.49 [2019-03-28 12:37:46,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.49 [2019-03-28 12:37:46,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.49 [2019-03-28 12:37:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.49 [2019-03-28 12:37:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.49 [2019-03-28 12:37:46,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.49 [2019-03-28 12:37:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash 538036786, now seen corresponding path program 1 times 88.12/64.49 [2019-03-28 12:37:46,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 88.12/64.49 [2019-03-28 12:37:46,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 88.12/64.49 [2019-03-28 12:37:46,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.49 [2019-03-28 12:37:46,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 88.12/64.49 [2019-03-28 12:37:46,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 88.12/64.49 [2019-03-28 12:37:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.49 [2019-03-28 12:37:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.49 [2019-03-28 12:37:47,406 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 88.12/64.49 [2019-03-28 12:37:47,546 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 85 88.12/64.49 [2019-03-28 12:37:47,549 INFO L216 LassoAnalysis]: Preferences: 88.12/64.49 [2019-03-28 12:37:47,550 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 88.12/64.49 [2019-03-28 12:37:47,550 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 88.12/64.49 [2019-03-28 12:37:47,550 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 88.12/64.49 [2019-03-28 12:37:47,550 INFO L127 ssoRankerPreferences]: Use exernal solver: false 88.12/64.49 [2019-03-28 12:37:47,550 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 88.12/64.49 [2019-03-28 12:37:47,550 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 88.12/64.49 [2019-03-28 12:37:47,550 INFO L130 ssoRankerPreferences]: Path of dumped script: 88.12/64.49 [2019-03-28 12:37:47,550 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso 88.12/64.49 [2019-03-28 12:37:47,551 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 88.12/64.49 [2019-03-28 12:37:47,551 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 88.12/64.49 [2019-03-28 12:37:47,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,867 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 88.12/64.49 [2019-03-28 12:37:47,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:47,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 88.12/64.49 [2019-03-28 12:37:48,400 INFO L300 LassoAnalysis]: Preprocessing complete. 88.12/64.49 [2019-03-28 12:37:48,400 INFO L497 LassoAnalysis]: Using template 'affine'. 88.12/64.49 [2019-03-28 12:37:48,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 88.12/64.49 [2019-03-28 12:37:48,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 88.12/64.49 [2019-03-28 12:37:48,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 88.12/64.49 [2019-03-28 12:37:48,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 88.12/64.49 [2019-03-28 12:37:48,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 88.12/64.49 [2019-03-28 12:37:48,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 88.12/64.49 [2019-03-28 12:37:48,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 88.12/64.49 [2019-03-28 12:37:48,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 88.12/64.49 [2019-03-28 12:37:48,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 88.12/64.49 [2019-03-28 12:37:48,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 88.12/64.49 Termination analysis: LINEAR_WITH_GUESSES 88.12/64.49 Number of strict supporting invariants: 0 88.12/64.49 Number of non-strict supporting invariants: 1 88.12/64.49 Consider only non-deceasing supporting invariants: true 88.12/64.49 Simplify termination arguments: true 88.12/64.49 Simplify supporting invariants: trueOverapproximate stem: false 88.12/64.49 [2019-03-28 12:37:48,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. 88.12/64.49 [2019-03-28 12:37:48,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 88.12/64.49 [2019-03-28 12:37:48,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 88.12/64.49 [2019-03-28 12:37:48,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 88.12/64.49 [2019-03-28 12:37:48,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 88.12/64.49 [2019-03-28 12:37:48,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 88.12/64.49 [2019-03-28 12:37:48,493 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 88.12/64.49 [2019-03-28 12:37:48,507 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 88.12/64.49 [2019-03-28 12:37:48,508 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. 88.12/64.49 [2019-03-28 12:37:48,508 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 88.12/64.49 [2019-03-28 12:37:48,509 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 88.12/64.49 [2019-03-28 12:37:48,509 INFO L518 LassoAnalysis]: Proved termination. 88.12/64.49 [2019-03-28 12:37:48,510 INFO L520 LassoAnalysis]: Termination argument consisting of: 88.12/64.49 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 88.12/64.49 Supporting invariants [] 88.12/64.49 [2019-03-28 12:37:48,599 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed 88.12/64.49 [2019-03-28 12:37:48,602 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 88.12/64.49 [2019-03-28 12:37:48,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 88.12/64.49 [2019-03-28 12:37:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.49 [2019-03-28 12:37:48,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core 88.12/64.49 [2019-03-28 12:37:48,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.49 [2019-03-28 12:37:48,655 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 14 treesize of output 12 88.12/64.49 [2019-03-28 12:37:48,656 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:48,662 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.49 [2019-03-28 12:37:48,662 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:48,663 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 88.12/64.49 [2019-03-28 12:37:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.49 [2019-03-28 12:37:48,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core 88.12/64.49 [2019-03-28 12:37:48,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.49 [2019-03-28 12:37:48,749 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.49 [2019-03-28 12:37:48,750 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 88.12/64.49 [2019-03-28 12:37:48,753 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:48,813 INFO L497 ElimStorePlain]: treesize reduction 39, result has 57.1 percent of original size 88.12/64.49 [2019-03-28 12:37:48,814 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:48,815 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 88.12/64.49 [2019-03-28 12:37:53,131 WARN L188 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 26 88.12/64.49 [2019-03-28 12:37:54,605 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 39 treesize of output 23 88.12/64.49 [2019-03-28 12:37:54,606 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:54,612 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 37 treesize of output 25 88.12/64.49 [2019-03-28 12:37:54,612 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:54,639 INFO L497 ElimStorePlain]: treesize reduction 23, result has 46.5 percent of original size 88.12/64.49 [2019-03-28 12:37:54,640 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:54,640 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:17 88.12/64.49 [2019-03-28 12:37:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 88.12/64.49 [2019-03-28 12:37:56,121 WARN L860 $PredicateComparison]: unable to prove that (or (<= 1 c_oldRank0) (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base))))) is different from true 88.12/64.49 [2019-03-28 12:37:57,605 WARN L860 $PredicateComparison]: unable to prove that (or (<= (+ (select (select |c_#memory_int| c_ULTIMATE.start_test_fun_~y_ref~0.base) c_ULTIMATE.start_test_fun_~y_ref~0.offset) 1) c_oldRank0) (exists ((ULTIMATE.start_test_fun_~x_ref~0.base Int) (ULTIMATE.start_test_fun_~x_ref~0.offset Int)) (not (and (= c_ULTIMATE.start_test_fun_~y_ref~0.offset ULTIMATE.start_test_fun_~x_ref~0.offset) (= ULTIMATE.start_test_fun_~x_ref~0.base c_ULTIMATE.start_test_fun_~y_ref~0.base))))) is different from true 88.12/64.49 [2019-03-28 12:37:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.49 [2019-03-28 12:37:57,681 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 88.12/64.49 [2019-03-28 12:37:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.49 [2019-03-28 12:37:57,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core 88.12/64.49 [2019-03-28 12:37:57,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.49 [2019-03-28 12:37:57,718 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 28 treesize of output 16 88.12/64.49 [2019-03-28 12:37:57,719 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:57,724 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.49 [2019-03-28 12:37:57,724 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:57,724 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 88.12/64.49 [2019-03-28 12:37:57,749 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 23 treesize of output 22 88.12/64.49 [2019-03-28 12:37:57,749 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:57,756 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.49 [2019-03-28 12:37:57,756 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:57,756 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 88.12/64.49 [2019-03-28 12:37:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 88.12/64.49 [2019-03-28 12:37:57,841 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 88.12/64.49 [2019-03-28 12:37:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.49 [2019-03-28 12:37:57,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core 88.12/64.49 [2019-03-28 12:37:57,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.49 [2019-03-28 12:37:57,857 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 88.12/64.49 [2019-03-28 12:37:57,857 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:57,864 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.49 [2019-03-28 12:37:57,864 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:57,864 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 88.12/64.49 [2019-03-28 12:37:57,892 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.49 [2019-03-28 12:37:57,892 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 88.12/64.49 [2019-03-28 12:37:57,896 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:57,990 INFO L497 ElimStorePlain]: treesize reduction 51, result has 50.5 percent of original size 88.12/64.49 [2019-03-28 12:37:57,991 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:57,992 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 88.12/64.49 [2019-03-28 12:37:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 88.12/64.49 [2019-03-28 12:37:58,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core 88.12/64.49 [2019-03-28 12:37:58,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... 88.12/64.49 [2019-03-28 12:37:58,038 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 88.12/64.49 [2019-03-28 12:37:58,039 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:58,046 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.49 [2019-03-28 12:37:58,046 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:58,047 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:12 88.12/64.49 [2019-03-28 12:37:58,076 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 88.12/64.49 [2019-03-28 12:37:58,077 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 64 88.12/64.49 [2019-03-28 12:37:58,080 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:58,140 INFO L497 ElimStorePlain]: treesize reduction 39, result has 57.1 percent of original size 88.12/64.49 [2019-03-28 12:37:58,141 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:58,142 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:42 88.12/64.49 [2019-03-28 12:37:58,154 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 37 treesize of output 25 88.12/64.49 [2019-03-28 12:37:58,155 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:58,160 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 39 treesize of output 23 88.12/64.49 [2019-03-28 12:37:58,160 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:58,180 INFO L497 ElimStorePlain]: treesize reduction 23, result has 46.5 percent of original size 88.12/64.49 [2019-03-28 12:37:58,181 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 88.12/64.49 [2019-03-28 12:37:58,181 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:17 88.12/64.49 [2019-03-28 12:37:58,204 INFO L98 LoopCannibalizer]: 13 predicates before loop cannibalization 13 predicates after loop cannibalization 88.12/64.49 [2019-03-28 12:37:58,204 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 13 loop predicates 88.12/64.49 [2019-03-28 12:37:58,204 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 27 transitions. cyclomatic complexity: 8 Second operand 9 states. 88.12/64.49 [2019-03-28 12:38:01,300 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 27 transitions. cyclomatic complexity: 8. Second operand 9 states. Result 29 states and 37 transitions. Complement of second has 15 states. 88.12/64.49 [2019-03-28 12:38:01,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states 88.12/64.49 [2019-03-28 12:38:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. 88.12/64.49 [2019-03-28 12:38:01,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. 88.12/64.49 [2019-03-28 12:38:01,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 12 letters. Loop has 8 letters. 88.12/64.49 [2019-03-28 12:38:01,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. 88.12/64.49 [2019-03-28 12:38:01,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 20 letters. Loop has 8 letters. 88.12/64.49 [2019-03-28 12:38:01,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. 88.12/64.49 [2019-03-28 12:38:01,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 37 transitions. Stem has 12 letters. Loop has 16 letters. 88.12/64.49 [2019-03-28 12:38:01,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. 88.12/64.49 [2019-03-28 12:38:01,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. 88.12/64.49 [2019-03-28 12:38:01,311 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 88.12/64.49 [2019-03-28 12:38:01,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 0 states and 0 transitions. 88.12/64.49 [2019-03-28 12:38:01,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 88.12/64.49 [2019-03-28 12:38:01,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 88.12/64.49 [2019-03-28 12:38:01,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 88.12/64.49 [2019-03-28 12:38:01,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 88.12/64.49 [2019-03-28 12:38:01,312 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 88.12/64.49 [2019-03-28 12:38:01,312 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 88.12/64.49 [2019-03-28 12:38:01,312 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 88.12/64.49 [2019-03-28 12:38:01,312 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 88.12/64.49 [2019-03-28 12:38:01,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 88.12/64.49 [2019-03-28 12:38:01,313 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 88.12/64.49 [2019-03-28 12:38:01,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 88.12/64.49 [2019-03-28 12:38:01,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:38:01 BasicIcfg 88.12/64.49 [2019-03-28 12:38:01,320 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 88.12/64.49 [2019-03-28 12:38:01,320 INFO L168 Benchmark]: Toolchain (without parser) took 60177.43 ms. Allocated memory was 649.6 MB in the beginning and 991.4 MB in the end (delta: 341.8 MB). Free memory was 559.6 MB in the beginning and 608.8 MB in the end (delta: -49.2 MB). Peak memory consumption was 292.6 MB. Max. memory is 50.3 GB. 88.12/64.49 [2019-03-28 12:38:01,321 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 88.12/64.49 [2019-03-28 12:38:01,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.74 ms. Allocated memory was 649.6 MB in the beginning and 680.5 MB in the end (delta: 30.9 MB). Free memory was 559.6 MB in the beginning and 646.7 MB in the end (delta: -87.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 88.12/64.49 [2019-03-28 12:38:01,322 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.32 ms. Allocated memory is still 680.5 MB. Free memory was 646.7 MB in the beginning and 643.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 88.12/64.49 [2019-03-28 12:38:01,322 INFO L168 Benchmark]: Boogie Preprocessor took 26.62 ms. Allocated memory is still 680.5 MB. Free memory was 643.6 MB in the beginning and 642.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 88.12/64.49 [2019-03-28 12:38:01,323 INFO L168 Benchmark]: RCFGBuilder took 393.82 ms. Allocated memory is still 680.5 MB. Free memory was 642.3 MB in the beginning and 614.7 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 50.3 GB. 88.12/64.49 [2019-03-28 12:38:01,323 INFO L168 Benchmark]: BlockEncodingV2 took 141.99 ms. Allocated memory is still 680.5 MB. Free memory was 614.7 MB in the beginning and 602.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 88.12/64.49 [2019-03-28 12:38:01,323 INFO L168 Benchmark]: TraceAbstraction took 1688.58 ms. Allocated memory is still 680.5 MB. Free memory was 602.5 MB in the beginning and 402.3 MB in the end (delta: 200.2 MB). Peak memory consumption was 200.2 MB. Max. memory is 50.3 GB. 88.12/64.49 [2019-03-28 12:38:01,324 INFO L168 Benchmark]: BuchiAutomizer took 57566.53 ms. Allocated memory was 680.5 MB in the beginning and 991.4 MB in the end (delta: 310.9 MB). Free memory was 402.3 MB in the beginning and 608.8 MB in the end (delta: -206.4 MB). Peak memory consumption was 104.5 MB. Max. memory is 50.3 GB. 88.12/64.49 [2019-03-28 12:38:01,327 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 88.12/64.49 --- Results --- 88.12/64.49 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 88.12/64.49 - StatisticsResult: Initial Icfg 88.12/64.49 57 locations, 61 edges 88.12/64.49 - StatisticsResult: Encoded RCFG 88.12/64.49 49 locations, 89 edges 88.12/64.49 * Results from de.uni_freiburg.informatik.ultimate.core: 88.12/64.49 - StatisticsResult: Toolchain Benchmarks 88.12/64.49 Benchmark results are: 88.12/64.49 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 88.12/64.49 * CACSL2BoogieTranslator took 308.74 ms. Allocated memory was 649.6 MB in the beginning and 680.5 MB in the end (delta: 30.9 MB). Free memory was 559.6 MB in the beginning and 646.7 MB in the end (delta: -87.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 88.12/64.49 * Boogie Procedure Inliner took 45.32 ms. Allocated memory is still 680.5 MB. Free memory was 646.7 MB in the beginning and 643.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 88.12/64.49 * Boogie Preprocessor took 26.62 ms. Allocated memory is still 680.5 MB. Free memory was 643.6 MB in the beginning and 642.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 88.12/64.49 * RCFGBuilder took 393.82 ms. Allocated memory is still 680.5 MB. Free memory was 642.3 MB in the beginning and 614.7 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 50.3 GB. 88.12/64.49 * BlockEncodingV2 took 141.99 ms. Allocated memory is still 680.5 MB. Free memory was 614.7 MB in the beginning and 602.5 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. 88.12/64.49 * TraceAbstraction took 1688.58 ms. Allocated memory is still 680.5 MB. Free memory was 602.5 MB in the beginning and 402.3 MB in the end (delta: 200.2 MB). Peak memory consumption was 200.2 MB. Max. memory is 50.3 GB. 88.12/64.49 * BuchiAutomizer took 57566.53 ms. Allocated memory was 680.5 MB in the beginning and 991.4 MB in the end (delta: 310.9 MB). Free memory was 402.3 MB in the beginning and 608.8 MB in the end (delta: -206.4 MB). Peak memory consumption was 104.5 MB. Max. memory is 50.3 GB. 88.12/64.49 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #length 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #length 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #length 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #length 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #length 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #length 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #length 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #length 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #length 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #length 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #length 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #length 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #memory_int 88.12/64.49 - GenericResult: Unfinished Backtranslation 88.12/64.49 unknown boogie variable #memory_int 88.12/64.49 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 88.12/64.49 - PositiveResult [Line: 14]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 13]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 13]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 13]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 13]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 13]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 20]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 12]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 13]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 12]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 20]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 17]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 11]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 17]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 17]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 10]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 11]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 10]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 17]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 16]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 16]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 16]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 16]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 15]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 15]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 15]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 15]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - PositiveResult [Line: 14]: pointer dereference always succeeds 88.12/64.49 For all program executions holds that pointer dereference always succeeds at this location 88.12/64.49 - AllSpecificationsHoldResult: All specifications hold 88.12/64.49 28 specifications checked. All of them hold 88.12/64.49 - InvariantResult [Line: 12]: Loop Invariant 88.12/64.49 [2019-03-28 12:38:01,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.49 [2019-03-28 12:38:01,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.49 [2019-03-28 12:38:01,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.49 [2019-03-28 12:38:01,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.49 [2019-03-28 12:38:01,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.49 [2019-03-28 12:38:01,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.49 Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] 88.12/64.49 - InvariantResult [Line: 14]: Loop Invariant 88.12/64.49 [2019-03-28 12:38:01,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.49 [2019-03-28 12:38:01,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.49 [2019-03-28 12:38:01,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.49 [2019-03-28 12:38:01,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.49 [2019-03-28 12:38:01,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.49 [2019-03-28 12:38:01,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 88.12/64.49 Derived loop invariant: (((((((4 == unknown-#length-unknown[x_ref] && 0 == c) && unknown-#length-unknown[y_ref] == 4) && x_ref == 0) && \valid[y_ref] == 1) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[c]) && 1 == \valid[c] 88.12/64.49 - StatisticsResult: Ultimate Automizer benchmark data 88.12/64.49 CFG has 1 procedures, 49 locations, 28 error locations. SAFE Result, 1.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 405 SDslu, 6 SDs, 0 SdLazy, 418 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 2 NumberOfFragments, 80 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 88.12/64.49 - StatisticsResult: Constructed decomposition of program 88.12/64.49 Your program was decomposed into 5 terminating modules (3 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 64 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 9 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. 88.12/64.49 - StatisticsResult: Timing statistics 88.12/64.49 BüchiAutomizer plugin needed 57.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.9s. Construction of modules took 1.3s. Büchi inclusion checks took 52.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 93 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 94 SDtfs, 333 SDslu, 309 SDs, 0 SdLazy, 1897 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital446 mio100 ax100 hnf100 lsp98 ukn43 mio100 lsp37 div100 bol100 ite100 ukn100 eq182 hnf88 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 88.12/64.49 - TerminationAnalysisResult: Termination proven 88.12/64.49 Buchi Automizer proved that your program is terminating 88.12/64.49 RESULT: Ultimate proved your program to be correct! 88.12/64.49 !SESSION 2019-03-28 12:36:57.918 ----------------------------------------------- 88.12/64.49 eclipse.buildId=unknown 88.12/64.49 java.version=1.8.0_181 88.12/64.49 java.vendor=Oracle Corporation 88.12/64.49 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 88.12/64.49 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 88.12/64.49 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 88.12/64.49 88.12/64.49 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:38:01.572 88.12/64.49 !MESSAGE The workspace will exit with unsaved changes in this session. 88.12/64.49 Received shutdown request... 88.12/64.49 Ultimate: 88.12/64.49 GTK+ Version Check 88.12/64.49 EOF