173.28/123.37 YES 173.28/123.37 173.28/123.37 Ultimate: Cannot open display: 173.28/123.37 This is Ultimate 0.1.24-8dc7c08-m 173.28/123.37 [2019-03-28 12:44:15,024 INFO L170 SettingsManager]: Resetting all preferences to default values... 173.28/123.37 [2019-03-28 12:44:15,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 173.28/123.37 [2019-03-28 12:44:15,038 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 173.28/123.37 [2019-03-28 12:44:15,039 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 173.28/123.37 [2019-03-28 12:44:15,040 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 173.28/123.37 [2019-03-28 12:44:15,041 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 173.28/123.37 [2019-03-28 12:44:15,042 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 173.28/123.37 [2019-03-28 12:44:15,044 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 173.28/123.37 [2019-03-28 12:44:15,045 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 173.28/123.37 [2019-03-28 12:44:15,045 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 173.28/123.37 [2019-03-28 12:44:15,046 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 173.28/123.37 [2019-03-28 12:44:15,047 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 173.28/123.37 [2019-03-28 12:44:15,047 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 173.28/123.37 [2019-03-28 12:44:15,048 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 173.28/123.37 [2019-03-28 12:44:15,049 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 173.28/123.37 [2019-03-28 12:44:15,050 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 173.28/123.37 [2019-03-28 12:44:15,052 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 173.28/123.37 [2019-03-28 12:44:15,054 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 173.28/123.37 [2019-03-28 12:44:15,055 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 173.28/123.37 [2019-03-28 12:44:15,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 173.28/123.37 [2019-03-28 12:44:15,057 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 173.28/123.37 [2019-03-28 12:44:15,059 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 173.28/123.37 [2019-03-28 12:44:15,059 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 173.28/123.37 [2019-03-28 12:44:15,060 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 173.28/123.37 [2019-03-28 12:44:15,060 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 173.28/123.37 [2019-03-28 12:44:15,061 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 173.28/123.37 [2019-03-28 12:44:15,062 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 173.28/123.37 [2019-03-28 12:44:15,062 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 173.28/123.37 [2019-03-28 12:44:15,063 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 173.28/123.37 [2019-03-28 12:44:15,063 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 173.28/123.37 [2019-03-28 12:44:15,064 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 173.28/123.37 [2019-03-28 12:44:15,065 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 173.28/123.37 [2019-03-28 12:44:15,065 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 173.28/123.37 [2019-03-28 12:44:15,066 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 173.28/123.37 [2019-03-28 12:44:15,066 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 173.28/123.37 [2019-03-28 12:44:15,066 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 173.28/123.37 [2019-03-28 12:44:15,067 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 173.28/123.37 [2019-03-28 12:44:15,068 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 173.28/123.37 [2019-03-28 12:44:15,068 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 173.28/123.37 [2019-03-28 12:44:15,083 INFO L110 SettingsManager]: Loading preferences was successful 173.28/123.37 [2019-03-28 12:44:15,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 173.28/123.37 [2019-03-28 12:44:15,084 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 173.28/123.37 [2019-03-28 12:44:15,084 INFO L133 SettingsManager]: * Rewrite not-equals=true 173.28/123.37 [2019-03-28 12:44:15,084 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 173.28/123.37 [2019-03-28 12:44:15,085 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 173.28/123.37 [2019-03-28 12:44:15,085 INFO L133 SettingsManager]: * Use SBE=true 173.28/123.37 [2019-03-28 12:44:15,085 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 173.28/123.37 [2019-03-28 12:44:15,085 INFO L133 SettingsManager]: * Use old map elimination=false 173.28/123.37 [2019-03-28 12:44:15,085 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 173.28/123.37 [2019-03-28 12:44:15,086 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 173.28/123.37 [2019-03-28 12:44:15,086 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 173.28/123.37 [2019-03-28 12:44:15,086 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 173.28/123.37 [2019-03-28 12:44:15,086 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 173.28/123.37 [2019-03-28 12:44:15,086 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 173.28/123.37 [2019-03-28 12:44:15,087 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 173.28/123.37 [2019-03-28 12:44:15,087 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 173.28/123.37 [2019-03-28 12:44:15,087 INFO L133 SettingsManager]: * Check division by zero=IGNORE 173.28/123.37 [2019-03-28 12:44:15,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 173.28/123.37 [2019-03-28 12:44:15,087 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 173.28/123.37 [2019-03-28 12:44:15,088 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 173.28/123.37 [2019-03-28 12:44:15,088 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 173.28/123.37 [2019-03-28 12:44:15,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 173.28/123.37 [2019-03-28 12:44:15,088 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 173.28/123.37 [2019-03-28 12:44:15,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 173.28/123.37 [2019-03-28 12:44:15,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 173.28/123.37 [2019-03-28 12:44:15,089 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 173.28/123.37 [2019-03-28 12:44:15,089 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 173.28/123.37 [2019-03-28 12:44:15,089 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 173.28/123.37 [2019-03-28 12:44:15,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 173.28/123.37 [2019-03-28 12:44:15,127 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 173.28/123.37 [2019-03-28 12:44:15,131 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 173.28/123.37 [2019-03-28 12:44:15,133 INFO L271 PluginConnector]: Initializing CDTParser... 173.28/123.37 [2019-03-28 12:44:15,133 INFO L276 PluginConnector]: CDTParser initialized 173.28/123.37 [2019-03-28 12:44:15,134 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 173.28/123.37 [2019-03-28 12:44:15,200 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/2771418bae05448ea49f1ccb69d41276/FLAGec9317074 173.28/123.37 [2019-03-28 12:44:15,544 INFO L307 CDTParser]: Found 1 translation units. 173.28/123.37 [2019-03-28 12:44:15,544 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 173.28/123.37 [2019-03-28 12:44:15,545 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 173.28/123.37 [2019-03-28 12:44:15,552 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/2771418bae05448ea49f1ccb69d41276/FLAGec9317074 173.28/123.37 [2019-03-28 12:44:15,945 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/2771418bae05448ea49f1ccb69d41276 173.28/123.37 [2019-03-28 12:44:15,957 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 173.28/123.37 [2019-03-28 12:44:15,958 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 173.28/123.37 [2019-03-28 12:44:15,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 173.28/123.37 [2019-03-28 12:44:15,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 173.28/123.37 [2019-03-28 12:44:15,963 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 173.28/123.37 [2019-03-28 12:44:15,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:15" (1/1) ... 173.28/123.37 [2019-03-28 12:44:15,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c5e187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:15, skipping insertion in model container 173.28/123.37 [2019-03-28 12:44:15,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:44:15" (1/1) ... 173.28/123.37 [2019-03-28 12:44:15,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 173.28/123.37 [2019-03-28 12:44:15,994 INFO L176 MainTranslator]: Built tables and reachable declarations 173.28/123.37 [2019-03-28 12:44:16,162 INFO L206 PostProcessor]: Analyzing one entry point: main 173.28/123.37 [2019-03-28 12:44:16,174 INFO L191 MainTranslator]: Completed pre-run 173.28/123.37 [2019-03-28 12:44:16,262 INFO L206 PostProcessor]: Analyzing one entry point: main 173.28/123.37 [2019-03-28 12:44:16,284 INFO L195 MainTranslator]: Completed translation 173.28/123.37 [2019-03-28 12:44:16,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:16 WrapperNode 173.28/123.37 [2019-03-28 12:44:16,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 173.28/123.37 [2019-03-28 12:44:16,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 173.28/123.37 [2019-03-28 12:44:16,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 173.28/123.37 [2019-03-28 12:44:16,286 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 173.28/123.37 [2019-03-28 12:44:16,295 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:44:16" (1/1) ... 173.28/123.37 [2019-03-28 12:44:16,306 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:44:16" (1/1) ... 173.28/123.37 [2019-03-28 12:44:16,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 173.28/123.37 [2019-03-28 12:44:16,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 173.28/123.37 [2019-03-28 12:44:16,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 173.28/123.37 [2019-03-28 12:44:16,336 INFO L276 PluginConnector]: Boogie Preprocessor initialized 173.28/123.37 [2019-03-28 12:44:16,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:16" (1/1) ... 173.28/123.37 [2019-03-28 12:44:16,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:16" (1/1) ... 173.28/123.37 [2019-03-28 12:44:16,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:16" (1/1) ... 173.28/123.37 [2019-03-28 12:44:16,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:16" (1/1) ... 173.28/123.37 [2019-03-28 12:44:16,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:16" (1/1) ... 173.28/123.37 [2019-03-28 12:44:16,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:16" (1/1) ... 173.28/123.37 [2019-03-28 12:44:16,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:16" (1/1) ... 173.28/123.37 [2019-03-28 12:44:16,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 173.28/123.37 [2019-03-28 12:44:16,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 173.28/123.37 [2019-03-28 12:44:16,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... 173.28/123.37 [2019-03-28 12:44:16,370 INFO L276 PluginConnector]: RCFGBuilder initialized 173.28/123.37 [2019-03-28 12:44:16,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:16" (1/1) ... 173.28/123.37 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 173.28/123.37 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 173.28/123.37 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 173.28/123.37 [2019-03-28 12:44:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 173.28/123.37 [2019-03-28 12:44:16,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 173.28/123.37 [2019-03-28 12:44:16,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 173.28/123.37 [2019-03-28 12:44:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 173.28/123.37 [2019-03-28 12:44:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 173.28/123.37 [2019-03-28 12:44:16,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 173.28/123.37 [2019-03-28 12:44:17,037 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 173.28/123.37 [2019-03-28 12:44:17,038 INFO L286 CfgBuilder]: Removed 12 assue(true) statements. 173.28/123.37 [2019-03-28 12:44:17,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:17 BoogieIcfgContainer 173.28/123.37 [2019-03-28 12:44:17,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 173.28/123.37 [2019-03-28 12:44:17,040 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 173.28/123.37 [2019-03-28 12:44:17,040 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 173.28/123.37 [2019-03-28 12:44:17,043 INFO L276 PluginConnector]: BlockEncodingV2 initialized 173.28/123.37 [2019-03-28 12:44:17,043 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:17" (1/1) ... 173.28/123.37 [2019-03-28 12:44:17,068 INFO L313 BlockEncoder]: Initial Icfg 158 locations, 172 edges 173.28/123.37 [2019-03-28 12:44:17,070 INFO L258 BlockEncoder]: Using Remove infeasible edges 173.28/123.37 [2019-03-28 12:44:17,071 INFO L263 BlockEncoder]: Using Maximize final states 173.28/123.37 [2019-03-28 12:44:17,071 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 173.28/123.37 [2019-03-28 12:44:17,072 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 173.28/123.37 [2019-03-28 12:44:17,073 INFO L296 BlockEncoder]: Using Remove sink states 173.28/123.37 [2019-03-28 12:44:17,074 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 173.28/123.37 [2019-03-28 12:44:17,074 INFO L179 BlockEncoder]: Using Rewrite not-equals 173.28/123.37 [2019-03-28 12:44:17,114 INFO L185 BlockEncoder]: Using Use SBE 173.28/123.37 [2019-03-28 12:44:17,124 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 173.28/123.37 [2019-03-28 12:44:17,211 INFO L200 BlockEncoder]: SBE split 92 edges 173.28/123.37 [2019-03-28 12:44:17,218 INFO L70 emoveInfeasibleEdges]: Removed 4 edges and 0 locations because of local infeasibility 173.28/123.37 [2019-03-28 12:44:17,220 INFO L71 MaximizeFinalStates]: 0 new accepting states 173.28/123.37 [2019-03-28 12:44:17,261 INFO L100 BaseMinimizeStates]: Removed 28 edges and 14 locations by large block encoding 173.28/123.37 [2019-03-28 12:44:17,264 INFO L70 RemoveSinkStates]: Removed 5 edges and 2 locations by removing sink states 173.28/123.37 [2019-03-28 12:44:17,266 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 173.28/123.37 [2019-03-28 12:44:17,267 INFO L71 MaximizeFinalStates]: 0 new accepting states 173.28/123.37 [2019-03-28 12:44:17,272 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 173.28/123.37 [2019-03-28 12:44:17,273 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 173.28/123.37 [2019-03-28 12:44:17,274 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 173.28/123.37 [2019-03-28 12:44:17,274 INFO L71 MaximizeFinalStates]: 0 new accepting states 173.28/123.37 [2019-03-28 12:44:17,275 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 173.28/123.37 [2019-03-28 12:44:17,275 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 173.28/123.37 [2019-03-28 12:44:17,276 INFO L313 BlockEncoder]: Encoded RCFG 140 locations, 331 edges 173.28/123.37 [2019-03-28 12:44:17,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:17 BasicIcfg 173.28/123.37 [2019-03-28 12:44:17,277 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 173.28/123.37 [2019-03-28 12:44:17,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 173.28/123.37 [2019-03-28 12:44:17,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... 173.28/123.37 [2019-03-28 12:44:17,282 INFO L276 PluginConnector]: TraceAbstraction initialized 173.28/123.37 [2019-03-28 12:44:17,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:44:15" (1/4) ... 173.28/123.37 [2019-03-28 12:44:17,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8a23d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:17, skipping insertion in model container 173.28/123.37 [2019-03-28 12:44:17,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:16" (2/4) ... 173.28/123.37 [2019-03-28 12:44:17,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8a23d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:44:17, skipping insertion in model container 173.28/123.37 [2019-03-28 12:44:17,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:17" (3/4) ... 173.28/123.37 [2019-03-28 12:44:17,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8a23d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:17, skipping insertion in model container 173.28/123.37 [2019-03-28 12:44:17,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:17" (4/4) ... 173.28/123.37 [2019-03-28 12:44:17,286 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 173.28/123.37 [2019-03-28 12:44:17,296 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 173.28/123.37 [2019-03-28 12:44:17,305 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 84 error locations. 173.28/123.37 [2019-03-28 12:44:17,322 INFO L257 AbstractCegarLoop]: Starting to check reachability of 84 error locations. 173.28/123.37 [2019-03-28 12:44:17,352 INFO L133 ementStrategyFactory]: Using default assertion order modulation 173.28/123.37 [2019-03-28 12:44:17,353 INFO L382 AbstractCegarLoop]: Interprodecural is true 173.28/123.37 [2019-03-28 12:44:17,353 INFO L383 AbstractCegarLoop]: Hoare is true 173.28/123.37 [2019-03-28 12:44:17,353 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 173.28/123.37 [2019-03-28 12:44:17,353 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 173.28/123.37 [2019-03-28 12:44:17,353 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 173.28/123.37 [2019-03-28 12:44:17,353 INFO L387 AbstractCegarLoop]: Difference is false 173.28/123.37 [2019-03-28 12:44:17,353 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 173.28/123.37 [2019-03-28 12:44:17,354 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 173.28/123.37 [2019-03-28 12:44:17,371 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. 173.28/123.37 [2019-03-28 12:44:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 173.28/123.37 [2019-03-28 12:44:17,378 INFO L394 BasicCegarLoop]: Found error trace 173.28/123.37 [2019-03-28 12:44:17,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 173.28/123.37 [2019-03-28 12:44:17,379 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION]=== 173.28/123.37 [2019-03-28 12:44:17,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.28/123.37 [2019-03-28 12:44:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash 796805, now seen corresponding path program 1 times 173.28/123.37 [2019-03-28 12:44:17,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.28/123.37 [2019-03-28 12:44:17,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.28/123.37 [2019-03-28 12:44:17,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:17,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:17,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.28/123.37 [2019-03-28 12:44:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.28/123.37 [2019-03-28 12:44:17,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.28/123.37 [2019-03-28 12:44:17,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 173.28/123.37 [2019-03-28 12:44:17,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 173.28/123.37 [2019-03-28 12:44:17,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 173.28/123.37 [2019-03-28 12:44:17,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 173.28/123.37 [2019-03-28 12:44:17,613 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. 173.28/123.37 [2019-03-28 12:44:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.28/123.37 [2019-03-28 12:44:18,393 INFO L93 Difference]: Finished difference Result 140 states and 331 transitions. 173.28/123.37 [2019-03-28 12:44:18,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 173.28/123.37 [2019-03-28 12:44:18,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 173.28/123.37 [2019-03-28 12:44:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 173.28/123.37 [2019-03-28 12:44:18,411 INFO L225 Difference]: With dead ends: 140 173.28/123.37 [2019-03-28 12:44:18,411 INFO L226 Difference]: Without dead ends: 134 173.28/123.37 [2019-03-28 12:44:18,415 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 173.28/123.37 [2019-03-28 12:44:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. 173.28/123.37 [2019-03-28 12:44:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. 173.28/123.37 [2019-03-28 12:44:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. 173.28/123.37 [2019-03-28 12:44:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 319 transitions. 173.28/123.37 [2019-03-28 12:44:18,467 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 319 transitions. Word has length 3 173.28/123.37 [2019-03-28 12:44:18,467 INFO L84 Accepts]: Finished accepts. word is rejected. 173.28/123.37 [2019-03-28 12:44:18,468 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 319 transitions. 173.28/123.37 [2019-03-28 12:44:18,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 173.28/123.37 [2019-03-28 12:44:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 319 transitions. 173.28/123.37 [2019-03-28 12:44:18,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 173.28/123.37 [2019-03-28 12:44:18,468 INFO L394 BasicCegarLoop]: Found error trace 173.28/123.37 [2019-03-28 12:44:18,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 173.28/123.37 [2019-03-28 12:44:18,469 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION]=== 173.28/123.37 [2019-03-28 12:44:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.28/123.37 [2019-03-28 12:44:18,470 INFO L82 PathProgramCache]: Analyzing trace with hash 796807, now seen corresponding path program 1 times 173.28/123.37 [2019-03-28 12:44:18,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.28/123.37 [2019-03-28 12:44:18,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.28/123.37 [2019-03-28 12:44:18,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:18,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:18,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.28/123.37 [2019-03-28 12:44:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.28/123.37 [2019-03-28 12:44:18,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.28/123.37 [2019-03-28 12:44:18,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 173.28/123.37 [2019-03-28 12:44:18,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 173.28/123.37 [2019-03-28 12:44:18,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 173.28/123.37 [2019-03-28 12:44:18,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 173.28/123.37 [2019-03-28 12:44:18,503 INFO L87 Difference]: Start difference. First operand 134 states and 319 transitions. Second operand 3 states. 173.28/123.37 [2019-03-28 12:44:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.28/123.37 [2019-03-28 12:44:19,053 INFO L93 Difference]: Finished difference Result 140 states and 319 transitions. 173.28/123.37 [2019-03-28 12:44:19,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 173.28/123.37 [2019-03-28 12:44:19,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 173.28/123.37 [2019-03-28 12:44:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 173.28/123.37 [2019-03-28 12:44:19,056 INFO L225 Difference]: With dead ends: 140 173.28/123.37 [2019-03-28 12:44:19,056 INFO L226 Difference]: Without dead ends: 134 173.28/123.37 [2019-03-28 12:44:19,057 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 173.28/123.37 [2019-03-28 12:44:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. 173.28/123.37 [2019-03-28 12:44:19,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. 173.28/123.37 [2019-03-28 12:44:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. 173.28/123.37 [2019-03-28 12:44:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 313 transitions. 173.28/123.37 [2019-03-28 12:44:19,069 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 313 transitions. Word has length 3 173.28/123.37 [2019-03-28 12:44:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. 173.28/123.37 [2019-03-28 12:44:19,070 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 313 transitions. 173.28/123.37 [2019-03-28 12:44:19,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 173.28/123.37 [2019-03-28 12:44:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 313 transitions. 173.28/123.37 [2019-03-28 12:44:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 173.28/123.37 [2019-03-28 12:44:19,070 INFO L394 BasicCegarLoop]: Found error trace 173.28/123.37 [2019-03-28 12:44:19,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 173.28/123.37 [2019-03-28 12:44:19,071 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION]=== 173.28/123.37 [2019-03-28 12:44:19,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.28/123.37 [2019-03-28 12:44:19,071 INFO L82 PathProgramCache]: Analyzing trace with hash 796808, now seen corresponding path program 1 times 173.28/123.37 [2019-03-28 12:44:19,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.28/123.37 [2019-03-28 12:44:19,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.28/123.37 [2019-03-28 12:44:19,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:19,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:19,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.28/123.37 [2019-03-28 12:44:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.28/123.37 [2019-03-28 12:44:19,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.28/123.37 [2019-03-28 12:44:19,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 173.28/123.37 [2019-03-28 12:44:19,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 173.28/123.37 [2019-03-28 12:44:19,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 173.28/123.37 [2019-03-28 12:44:19,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 173.28/123.37 [2019-03-28 12:44:19,118 INFO L87 Difference]: Start difference. First operand 134 states and 313 transitions. Second operand 3 states. 173.28/123.37 [2019-03-28 12:44:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.28/123.37 [2019-03-28 12:44:19,712 INFO L93 Difference]: Finished difference Result 134 states and 313 transitions. 173.28/123.37 [2019-03-28 12:44:19,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 173.28/123.37 [2019-03-28 12:44:19,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 173.28/123.37 [2019-03-28 12:44:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 173.28/123.37 [2019-03-28 12:44:19,714 INFO L225 Difference]: With dead ends: 134 173.28/123.37 [2019-03-28 12:44:19,714 INFO L226 Difference]: Without dead ends: 128 173.28/123.37 [2019-03-28 12:44:19,715 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 173.28/123.37 [2019-03-28 12:44:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. 173.28/123.37 [2019-03-28 12:44:19,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. 173.28/123.37 [2019-03-28 12:44:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. 173.28/123.37 [2019-03-28 12:44:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 307 transitions. 173.28/123.37 [2019-03-28 12:44:19,724 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 307 transitions. Word has length 3 173.28/123.37 [2019-03-28 12:44:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. 173.28/123.37 [2019-03-28 12:44:19,724 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 307 transitions. 173.28/123.37 [2019-03-28 12:44:19,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 173.28/123.37 [2019-03-28 12:44:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 307 transitions. 173.28/123.37 [2019-03-28 12:44:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 173.28/123.37 [2019-03-28 12:44:19,725 INFO L394 BasicCegarLoop]: Found error trace 173.28/123.37 [2019-03-28 12:44:19,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 173.28/123.37 [2019-03-28 12:44:19,725 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION]=== 173.28/123.37 [2019-03-28 12:44:19,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.28/123.37 [2019-03-28 12:44:19,726 INFO L82 PathProgramCache]: Analyzing trace with hash 24694031, now seen corresponding path program 1 times 173.28/123.37 [2019-03-28 12:44:19,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.28/123.37 [2019-03-28 12:44:19,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.28/123.37 [2019-03-28 12:44:19,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:19,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:19,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.28/123.37 [2019-03-28 12:44:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.28/123.37 [2019-03-28 12:44:19,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.28/123.37 [2019-03-28 12:44:19,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 173.28/123.37 [2019-03-28 12:44:19,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 173.28/123.37 [2019-03-28 12:44:19,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 173.28/123.37 [2019-03-28 12:44:19,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 173.28/123.37 [2019-03-28 12:44:19,771 INFO L87 Difference]: Start difference. First operand 128 states and 307 transitions. Second operand 3 states. 173.28/123.37 [2019-03-28 12:44:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.28/123.37 [2019-03-28 12:44:20,300 INFO L93 Difference]: Finished difference Result 128 states and 307 transitions. 173.28/123.37 [2019-03-28 12:44:20,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 173.28/123.37 [2019-03-28 12:44:20,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 173.28/123.37 [2019-03-28 12:44:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 173.28/123.37 [2019-03-28 12:44:20,302 INFO L225 Difference]: With dead ends: 128 173.28/123.37 [2019-03-28 12:44:20,302 INFO L226 Difference]: Without dead ends: 120 173.28/123.37 [2019-03-28 12:44:20,302 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 173.28/123.37 [2019-03-28 12:44:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. 173.28/123.37 [2019-03-28 12:44:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. 173.28/123.37 [2019-03-28 12:44:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. 173.28/123.37 [2019-03-28 12:44:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 291 transitions. 173.28/123.37 [2019-03-28 12:44:20,310 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 291 transitions. Word has length 4 173.28/123.37 [2019-03-28 12:44:20,311 INFO L84 Accepts]: Finished accepts. word is rejected. 173.28/123.37 [2019-03-28 12:44:20,311 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 291 transitions. 173.28/123.37 [2019-03-28 12:44:20,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 173.28/123.37 [2019-03-28 12:44:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 291 transitions. 173.28/123.37 [2019-03-28 12:44:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 173.28/123.37 [2019-03-28 12:44:20,312 INFO L394 BasicCegarLoop]: Found error trace 173.28/123.37 [2019-03-28 12:44:20,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 173.28/123.37 [2019-03-28 12:44:20,312 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION]=== 173.28/123.37 [2019-03-28 12:44:20,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.28/123.37 [2019-03-28 12:44:20,312 INFO L82 PathProgramCache]: Analyzing trace with hash 24694033, now seen corresponding path program 1 times 173.28/123.37 [2019-03-28 12:44:20,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.28/123.37 [2019-03-28 12:44:20,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.28/123.37 [2019-03-28 12:44:20,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:20,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:20,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.28/123.37 [2019-03-28 12:44:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.28/123.37 [2019-03-28 12:44:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.28/123.37 [2019-03-28 12:44:20,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.28/123.37 [2019-03-28 12:44:20,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 173.39/123.37 [2019-03-28 12:44:20,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 173.39/123.37 [2019-03-28 12:44:20,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 173.39/123.37 [2019-03-28 12:44:20,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 173.39/123.37 [2019-03-28 12:44:20,360 INFO L87 Difference]: Start difference. First operand 120 states and 291 transitions. Second operand 3 states. 173.39/123.37 [2019-03-28 12:44:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.39/123.37 [2019-03-28 12:44:20,892 INFO L93 Difference]: Finished difference Result 120 states and 291 transitions. 173.39/123.37 [2019-03-28 12:44:20,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:20,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 173.39/123.37 [2019-03-28 12:44:20,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 173.39/123.37 [2019-03-28 12:44:20,894 INFO L225 Difference]: With dead ends: 120 173.39/123.37 [2019-03-28 12:44:20,894 INFO L226 Difference]: Without dead ends: 112 173.39/123.37 [2019-03-28 12:44:20,894 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 173.39/123.37 [2019-03-28 12:44:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. 173.39/123.37 [2019-03-28 12:44:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. 173.39/123.37 [2019-03-28 12:44:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. 173.39/123.37 [2019-03-28 12:44:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 275 transitions. 173.39/123.37 [2019-03-28 12:44:20,901 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 275 transitions. Word has length 4 173.39/123.37 [2019-03-28 12:44:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. 173.39/123.37 [2019-03-28 12:44:20,901 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 275 transitions. 173.39/123.37 [2019-03-28 12:44:20,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 275 transitions. 173.39/123.37 [2019-03-28 12:44:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 173.39/123.37 [2019-03-28 12:44:20,902 INFO L394 BasicCegarLoop]: Found error trace 173.39/123.37 [2019-03-28 12:44:20,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:20,902 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION]=== 173.39/123.37 [2019-03-28 12:44:20,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:20,903 INFO L82 PathProgramCache]: Analyzing trace with hash 765507580, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:20,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:20,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:20,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:20,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:20,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.37 [2019-03-28 12:44:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.37 [2019-03-28 12:44:20,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.39/123.37 [2019-03-28 12:44:20,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 173.39/123.37 [2019-03-28 12:44:20,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 173.39/123.37 [2019-03-28 12:44:20,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 173.39/123.37 [2019-03-28 12:44:20,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 173.39/123.37 [2019-03-28 12:44:20,968 INFO L87 Difference]: Start difference. First operand 112 states and 275 transitions. Second operand 3 states. 173.39/123.37 [2019-03-28 12:44:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.39/123.37 [2019-03-28 12:44:21,506 INFO L93 Difference]: Finished difference Result 112 states and 275 transitions. 173.39/123.37 [2019-03-28 12:44:21,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:21,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 173.39/123.37 [2019-03-28 12:44:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 173.39/123.37 [2019-03-28 12:44:21,507 INFO L225 Difference]: With dead ends: 112 173.39/123.37 [2019-03-28 12:44:21,507 INFO L226 Difference]: Without dead ends: 102 173.39/123.37 [2019-03-28 12:44:21,508 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 173.39/123.37 [2019-03-28 12:44:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. 173.39/123.37 [2019-03-28 12:44:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. 173.39/123.37 [2019-03-28 12:44:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. 173.39/123.37 [2019-03-28 12:44:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 255 transitions. 173.39/123.37 [2019-03-28 12:44:21,513 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 255 transitions. Word has length 5 173.39/123.37 [2019-03-28 12:44:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. 173.39/123.37 [2019-03-28 12:44:21,514 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 255 transitions. 173.39/123.37 [2019-03-28 12:44:21,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 255 transitions. 173.39/123.37 [2019-03-28 12:44:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 173.39/123.37 [2019-03-28 12:44:21,514 INFO L394 BasicCegarLoop]: Found error trace 173.39/123.37 [2019-03-28 12:44:21,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:21,515 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION]=== 173.39/123.37 [2019-03-28 12:44:21,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:21,515 INFO L82 PathProgramCache]: Analyzing trace with hash 765507582, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:21,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:21,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:21,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:21,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:21,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.37 [2019-03-28 12:44:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.37 [2019-03-28 12:44:21,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.39/123.37 [2019-03-28 12:44:21,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 173.39/123.37 [2019-03-28 12:44:21,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 173.39/123.37 [2019-03-28 12:44:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 173.39/123.37 [2019-03-28 12:44:21,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 173.39/123.37 [2019-03-28 12:44:21,557 INFO L87 Difference]: Start difference. First operand 102 states and 255 transitions. Second operand 3 states. 173.39/123.37 [2019-03-28 12:44:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.39/123.37 [2019-03-28 12:44:22,032 INFO L93 Difference]: Finished difference Result 102 states and 255 transitions. 173.39/123.37 [2019-03-28 12:44:22,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:22,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 173.39/123.37 [2019-03-28 12:44:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 173.39/123.37 [2019-03-28 12:44:22,034 INFO L225 Difference]: With dead ends: 102 173.39/123.37 [2019-03-28 12:44:22,034 INFO L226 Difference]: Without dead ends: 92 173.39/123.37 [2019-03-28 12:44:22,035 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 173.39/123.37 [2019-03-28 12:44:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. 173.39/123.37 [2019-03-28 12:44:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. 173.39/123.37 [2019-03-28 12:44:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. 173.39/123.37 [2019-03-28 12:44:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 235 transitions. 173.39/123.37 [2019-03-28 12:44:22,039 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 235 transitions. Word has length 5 173.39/123.37 [2019-03-28 12:44:22,039 INFO L84 Accepts]: Finished accepts. word is rejected. 173.39/123.37 [2019-03-28 12:44:22,040 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 235 transitions. 173.39/123.37 [2019-03-28 12:44:22,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 235 transitions. 173.39/123.37 [2019-03-28 12:44:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 173.39/123.37 [2019-03-28 12:44:22,040 INFO L394 BasicCegarLoop]: Found error trace 173.39/123.37 [2019-03-28 12:44:22,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:22,041 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION]=== 173.39/123.37 [2019-03-28 12:44:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:22,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2039078742, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:22,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:22,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:22,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:22,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:22,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.37 [2019-03-28 12:44:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.37 [2019-03-28 12:44:22,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.39/123.37 [2019-03-28 12:44:22,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 173.39/123.37 [2019-03-28 12:44:22,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 173.39/123.37 [2019-03-28 12:44:22,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 173.39/123.37 [2019-03-28 12:44:22,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 173.39/123.37 [2019-03-28 12:44:22,072 INFO L87 Difference]: Start difference. First operand 92 states and 235 transitions. Second operand 3 states. 173.39/123.37 [2019-03-28 12:44:22,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.39/123.37 [2019-03-28 12:44:22,495 INFO L93 Difference]: Finished difference Result 92 states and 235 transitions. 173.39/123.37 [2019-03-28 12:44:22,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:22,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 173.39/123.37 [2019-03-28 12:44:22,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 173.39/123.37 [2019-03-28 12:44:22,496 INFO L225 Difference]: With dead ends: 92 173.39/123.37 [2019-03-28 12:44:22,497 INFO L226 Difference]: Without dead ends: 86 173.39/123.37 [2019-03-28 12:44:22,497 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 173.39/123.37 [2019-03-28 12:44:22,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. 173.39/123.37 [2019-03-28 12:44:22,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. 173.39/123.37 [2019-03-28 12:44:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. 173.39/123.37 [2019-03-28 12:44:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 223 transitions. 173.39/123.37 [2019-03-28 12:44:22,501 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 223 transitions. Word has length 6 173.39/123.37 [2019-03-28 12:44:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. 173.39/123.37 [2019-03-28 12:44:22,501 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 223 transitions. 173.39/123.37 [2019-03-28 12:44:22,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 223 transitions. 173.39/123.37 [2019-03-28 12:44:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 173.39/123.37 [2019-03-28 12:44:22,502 INFO L394 BasicCegarLoop]: Found error trace 173.39/123.37 [2019-03-28 12:44:22,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:22,503 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION]=== 173.39/123.37 [2019-03-28 12:44:22,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:22,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2039078740, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:22,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:22,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:22,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:22,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:22,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.37 [2019-03-28 12:44:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.37 [2019-03-28 12:44:22,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.39/123.37 [2019-03-28 12:44:22,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 173.39/123.37 [2019-03-28 12:44:22,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 173.39/123.37 [2019-03-28 12:44:22,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 173.39/123.37 [2019-03-28 12:44:22,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 173.39/123.37 [2019-03-28 12:44:22,543 INFO L87 Difference]: Start difference. First operand 86 states and 223 transitions. Second operand 3 states. 173.39/123.37 [2019-03-28 12:44:22,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.39/123.37 [2019-03-28 12:44:22,960 INFO L93 Difference]: Finished difference Result 86 states and 223 transitions. 173.39/123.37 [2019-03-28 12:44:22,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:22,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 173.39/123.37 [2019-03-28 12:44:22,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 173.39/123.37 [2019-03-28 12:44:22,962 INFO L225 Difference]: With dead ends: 86 173.39/123.37 [2019-03-28 12:44:22,962 INFO L226 Difference]: Without dead ends: 80 173.39/123.37 [2019-03-28 12:44:22,962 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 173.39/123.37 [2019-03-28 12:44:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. 173.39/123.37 [2019-03-28 12:44:22,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. 173.39/123.37 [2019-03-28 12:44:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. 173.39/123.37 [2019-03-28 12:44:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 211 transitions. 173.39/123.37 [2019-03-28 12:44:22,966 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 211 transitions. Word has length 6 173.39/123.37 [2019-03-28 12:44:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. 173.39/123.37 [2019-03-28 12:44:22,966 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 211 transitions. 173.39/123.37 [2019-03-28 12:44:22,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 211 transitions. 173.39/123.37 [2019-03-28 12:44:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 173.39/123.37 [2019-03-28 12:44:22,967 INFO L394 BasicCegarLoop]: Found error trace 173.39/123.37 [2019-03-28 12:44:22,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:22,967 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION]=== 173.39/123.37 [2019-03-28 12:44:22,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:22,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1213062127, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:22,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:22,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:22,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:22,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:22,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.37 [2019-03-28 12:44:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.37 [2019-03-28 12:44:23,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.39/123.37 [2019-03-28 12:44:23,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 173.39/123.37 [2019-03-28 12:44:23,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 173.39/123.37 [2019-03-28 12:44:23,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 173.39/123.37 [2019-03-28 12:44:23,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 173.39/123.37 [2019-03-28 12:44:23,002 INFO L87 Difference]: Start difference. First operand 80 states and 211 transitions. Second operand 3 states. 173.39/123.37 [2019-03-28 12:44:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.39/123.37 [2019-03-28 12:44:23,413 INFO L93 Difference]: Finished difference Result 80 states and 211 transitions. 173.39/123.37 [2019-03-28 12:44:23,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:23,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 173.39/123.37 [2019-03-28 12:44:23,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 173.39/123.37 [2019-03-28 12:44:23,415 INFO L225 Difference]: With dead ends: 80 173.39/123.37 [2019-03-28 12:44:23,415 INFO L226 Difference]: Without dead ends: 68 173.39/123.37 [2019-03-28 12:44:23,415 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 173.39/123.37 [2019-03-28 12:44:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. 173.39/123.37 [2019-03-28 12:44:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. 173.39/123.37 [2019-03-28 12:44:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. 173.39/123.37 [2019-03-28 12:44:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 187 transitions. 173.39/123.37 [2019-03-28 12:44:23,419 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 187 transitions. Word has length 7 173.39/123.37 [2019-03-28 12:44:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. 173.39/123.37 [2019-03-28 12:44:23,419 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 187 transitions. 173.39/123.37 [2019-03-28 12:44:23,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 187 transitions. 173.39/123.37 [2019-03-28 12:44:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 173.39/123.37 [2019-03-28 12:44:23,420 INFO L394 BasicCegarLoop]: Found error trace 173.39/123.37 [2019-03-28 12:44:23,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:23,420 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION]=== 173.39/123.37 [2019-03-28 12:44:23,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1213062129, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:23,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:23,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:23,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:23,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.37 [2019-03-28 12:44:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.37 [2019-03-28 12:44:23,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.39/123.37 [2019-03-28 12:44:23,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 173.39/123.37 [2019-03-28 12:44:23,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 173.39/123.37 [2019-03-28 12:44:23,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 173.39/123.37 [2019-03-28 12:44:23,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 173.39/123.37 [2019-03-28 12:44:23,453 INFO L87 Difference]: Start difference. First operand 68 states and 187 transitions. Second operand 3 states. 173.39/123.37 [2019-03-28 12:44:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.39/123.37 [2019-03-28 12:44:23,833 INFO L93 Difference]: Finished difference Result 80 states and 187 transitions. 173.39/123.37 [2019-03-28 12:44:23,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:23,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 173.39/123.37 [2019-03-28 12:44:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 173.39/123.37 [2019-03-28 12:44:23,834 INFO L225 Difference]: With dead ends: 80 173.39/123.37 [2019-03-28 12:44:23,834 INFO L226 Difference]: Without dead ends: 68 173.39/123.37 [2019-03-28 12:44:23,835 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 173.39/123.37 [2019-03-28 12:44:23,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. 173.39/123.37 [2019-03-28 12:44:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. 173.39/123.37 [2019-03-28 12:44:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. 173.39/123.37 [2019-03-28 12:44:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 175 transitions. 173.39/123.37 [2019-03-28 12:44:23,838 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 175 transitions. Word has length 7 173.39/123.37 [2019-03-28 12:44:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. 173.39/123.37 [2019-03-28 12:44:23,838 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 175 transitions. 173.39/123.37 [2019-03-28 12:44:23,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 175 transitions. 173.39/123.37 [2019-03-28 12:44:23,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 173.39/123.37 [2019-03-28 12:44:23,839 INFO L394 BasicCegarLoop]: Found error trace 173.39/123.37 [2019-03-28 12:44:23,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:23,839 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION]=== 173.39/123.37 [2019-03-28 12:44:23,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:23,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1213062130, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:23,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:23,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:23,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:23,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:23,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.37 [2019-03-28 12:44:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.37 [2019-03-28 12:44:23,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.39/123.37 [2019-03-28 12:44:23,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 173.39/123.37 [2019-03-28 12:44:23,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 173.39/123.37 [2019-03-28 12:44:23,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 173.39/123.37 [2019-03-28 12:44:23,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 173.39/123.37 [2019-03-28 12:44:23,874 INFO L87 Difference]: Start difference. First operand 68 states and 175 transitions. Second operand 3 states. 173.39/123.37 [2019-03-28 12:44:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.39/123.37 [2019-03-28 12:44:24,316 INFO L93 Difference]: Finished difference Result 68 states and 175 transitions. 173.39/123.37 [2019-03-28 12:44:24,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:24,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 173.39/123.37 [2019-03-28 12:44:24,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 173.39/123.37 [2019-03-28 12:44:24,316 INFO L225 Difference]: With dead ends: 68 173.39/123.37 [2019-03-28 12:44:24,317 INFO L226 Difference]: Without dead ends: 0 173.39/123.37 [2019-03-28 12:44:24,317 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 173.39/123.37 [2019-03-28 12:44:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 173.39/123.37 [2019-03-28 12:44:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 173.39/123.37 [2019-03-28 12:44:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 173.39/123.37 [2019-03-28 12:44:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 173.39/123.37 [2019-03-28 12:44:24,318 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 173.39/123.37 [2019-03-28 12:44:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. 173.39/123.37 [2019-03-28 12:44:24,318 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 173.39/123.37 [2019-03-28 12:44:24,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 173.39/123.37 [2019-03-28 12:44:24,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 173.39/123.37 [2019-03-28 12:44:24,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 173.39/123.37 [2019-03-28 12:44:24,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr40REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr44REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,330 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,330 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 27 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr56REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,331 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr60REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,331 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,331 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,331 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr48REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr52REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr73REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,332 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,332 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,332 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,332 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr77REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,332 INFO L448 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,332 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,332 INFO L448 ceAbstractionStarter]: For program point L28-3(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,332 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr65REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,332 INFO L448 ceAbstractionStarter]: For program point L28-4(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,333 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,333 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr69REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,333 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,333 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,333 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,333 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,333 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,333 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr81REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,334 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,334 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,334 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr39REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,334 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,334 INFO L448 ceAbstractionStarter]: For program point L29-2(line 29) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,334 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr43REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,334 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,334 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,335 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 21 23) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,335 INFO L448 ceAbstractionStarter]: For program point L21-3(lines 20 23) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,335 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,335 INFO L448 ceAbstractionStarter]: For program point L21-4(line 21) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,335 INFO L448 ceAbstractionStarter]: For program point L21-5(lines 21 23) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,335 INFO L448 ceAbstractionStarter]: For program point L21-7(lines 20 23) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,335 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr55REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,335 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,335 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,336 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr59REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,336 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 42) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,336 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr47REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,336 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr51REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,336 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,336 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr72REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,336 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,336 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,337 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,337 INFO L448 ceAbstractionStarter]: For program point L30-3(line 30) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,337 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr76REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,337 INFO L448 ceAbstractionStarter]: For program point L30-4(line 30) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,337 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr64REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,337 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,337 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,337 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,337 INFO L448 ceAbstractionStarter]: For program point L22-3(line 22) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr68REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,338 INFO L448 ceAbstractionStarter]: For program point L22-4(line 22) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,338 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,338 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr80REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,339 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr42REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,339 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr46REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,339 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,339 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr38REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,339 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr58REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,339 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,339 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,339 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr62REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,340 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr50REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,340 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr54REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,340 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,340 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,340 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,340 INFO L448 ceAbstractionStarter]: For program point L32-2(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,340 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr71REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,340 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,340 INFO L448 ceAbstractionStarter]: For program point L32-4(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,341 INFO L448 ceAbstractionStarter]: For program point L32-5(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,341 INFO L448 ceAbstractionStarter]: For program point L32-6(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,341 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr75REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,341 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,341 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr63REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,341 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,341 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr67REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,341 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,341 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,342 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,342 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr79REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,342 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,342 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr83REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,342 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr41REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,342 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr45REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,342 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,342 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,342 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,343 INFO L448 ceAbstractionStarter]: For program point L25-2(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,343 INFO L448 ceAbstractionStarter]: For program point L25-3(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,343 INFO L448 ceAbstractionStarter]: For program point L25-5(lines 25 34) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,343 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,343 INFO L448 ceAbstractionStarter]: For program point L25-8(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,343 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr57REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,343 INFO L448 ceAbstractionStarter]: For program point L25-9(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,343 INFO L448 ceAbstractionStarter]: For program point L25-10(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,343 INFO L448 ceAbstractionStarter]: For program point L25-11(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,344 INFO L448 ceAbstractionStarter]: For program point L25-13(lines 25 34) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr61REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr49REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr53REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr74REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,344 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr78REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,345 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 33) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr66REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,345 INFO L448 ceAbstractionStarter]: For program point L26-2(lines 5 35) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,345 INFO L448 ceAbstractionStarter]: For program point L26-3(lines 26 33) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,345 INFO L448 ceAbstractionStarter]: For program point L26-5(lines 5 35) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr70REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,345 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,346 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,346 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,346 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr82REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,346 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. 173.39/123.37 [2019-03-28 12:44:24,346 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 173.39/123.37 [2019-03-28 12:44:24,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:24 BasicIcfg 173.39/123.37 [2019-03-28 12:44:24,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 173.39/123.37 [2019-03-28 12:44:24,351 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 173.39/123.37 [2019-03-28 12:44:24,351 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 173.39/123.37 [2019-03-28 12:44:24,354 INFO L276 PluginConnector]: BuchiAutomizer initialized 173.39/123.37 [2019-03-28 12:44:24,355 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 173.39/123.37 [2019-03-28 12:44:24,355 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:44:15" (1/5) ... 173.39/123.37 [2019-03-28 12:44:24,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72cc4f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:24, skipping insertion in model container 173.39/123.37 [2019-03-28 12:44:24,356 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 173.39/123.37 [2019-03-28 12:44:24,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:44:16" (2/5) ... 173.39/123.37 [2019-03-28 12:44:24,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72cc4f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:44:24, skipping insertion in model container 173.39/123.37 [2019-03-28 12:44:24,356 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 173.39/123.37 [2019-03-28 12:44:24,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:44:17" (3/5) ... 173.39/123.37 [2019-03-28 12:44:24,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72cc4f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:24, skipping insertion in model container 173.39/123.37 [2019-03-28 12:44:24,357 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 173.39/123.37 [2019-03-28 12:44:24,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:44:17" (4/5) ... 173.39/123.37 [2019-03-28 12:44:24,357 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72cc4f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:44:24, skipping insertion in model container 173.39/123.37 [2019-03-28 12:44:24,357 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 173.39/123.37 [2019-03-28 12:44:24,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:44:24" (5/5) ... 173.39/123.37 [2019-03-28 12:44:24,359 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 173.39/123.37 [2019-03-28 12:44:24,380 INFO L133 ementStrategyFactory]: Using default assertion order modulation 173.39/123.37 [2019-03-28 12:44:24,380 INFO L374 BuchiCegarLoop]: Interprodecural is true 173.39/123.37 [2019-03-28 12:44:24,381 INFO L375 BuchiCegarLoop]: Hoare is true 173.39/123.37 [2019-03-28 12:44:24,381 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 173.39/123.37 [2019-03-28 12:44:24,381 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 173.39/123.37 [2019-03-28 12:44:24,381 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 173.39/123.37 [2019-03-28 12:44:24,381 INFO L379 BuchiCegarLoop]: Difference is false 173.39/123.37 [2019-03-28 12:44:24,381 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 173.39/123.37 [2019-03-28 12:44:24,381 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 173.39/123.37 [2019-03-28 12:44:24,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. 173.39/123.37 [2019-03-28 12:44:24,396 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 42 173.39/123.37 [2019-03-28 12:44:24,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 173.39/123.37 [2019-03-28 12:44:24,397 INFO L119 BuchiIsEmpty]: Starting construction of run 173.39/123.37 [2019-03-28 12:44:24,402 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:24,402 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:24,402 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 173.39/123.37 [2019-03-28 12:44:24,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. 173.39/123.37 [2019-03-28 12:44:24,406 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 42 173.39/123.37 [2019-03-28 12:44:24,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 173.39/123.37 [2019-03-28 12:44:24,407 INFO L119 BuchiIsEmpty]: Starting construction of run 173.39/123.37 [2019-03-28 12:44:24,407 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:24,407 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:24,413 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRYtrue [781] ULTIMATE.startENTRY-->L38: Formula: (and (= |v_#NULL.offset_2| 0) (= |v_#valid_123| (store |v_#valid_124| 0 0)) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_124|} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, #valid=|v_#valid_123|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet19, #NULL.base] 111#L38true [511] L38-->L11: Formula: (let ((.cse1 (store |v_#valid_8| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1))) (and (= v_ULTIMATE.start_f_~z~0.base_1 |v_ULTIMATE.start_f_#t~malloc4.base_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~d_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~d_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~k~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc4.base_1|)) (= (select .cse1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc3.base_1|) 0) (= |v_ULTIMATE.start_f_#in~d_1| 1) (> |v_ULTIMATE.start_main_#t~nondet19_3| 0) (< |v_ULTIMATE.start_f_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc4.base_1|) (= v_ULTIMATE.start_f_~x~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= v_ULTIMATE.start_f_~y~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~k~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~d_1 |v_ULTIMATE.start_f_#in~d_1|) (= v_ULTIMATE.start_f_~y~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~x~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4) |v_ULTIMATE.start_f_#t~malloc4.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc4.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~z~0.offset_1 |v_ULTIMATE.start_f_#t~malloc4.offset_1|) (= (select .cse3 |v_ULTIMATE.start_f_#t~malloc2.base_1|) 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_f_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (> |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (> 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_3|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_1, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_#in~d=|v_ULTIMATE.start_f_#in~d_1|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_1, ULTIMATE.start_f_#t~malloc4.offset=|v_ULTIMATE.start_f_#t~malloc4.offset_1|, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_1, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_1, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_1, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_1, ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_1|, ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_1|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_1, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_1|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_1|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_1|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_f_#t~malloc4.base=|v_ULTIMATE.start_f_#t~malloc4.base_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_1, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_1, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_2|, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_f_~x~0.base, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_#in~d, ULTIMATE.start_f_~z~0.offset, ULTIMATE.start_f_#t~malloc4.offset, ULTIMATE.start_f_~d, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_~z~0.base, ULTIMATE.start_f_~d_ref~0.base, ULTIMATE.start_f_~k~0.offset, ULTIMATE.start_f_#t~nondet15, ULTIMATE.start_f_#t~nondet12, ULTIMATE.start_f_~x~0.offset, ULTIMATE.start_f_#t~mem16, ULTIMATE.start_f_#t~mem17, ULTIMATE.start_f_#t~mem18, ULTIMATE.start_f_#t~short11, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc4.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_~y~0.offset, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~k~0.base, ULTIMATE.start_f_~y~0.base, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base, ULTIMATE.start_f_~d_ref~0.offset] 101#L11true [358] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~d_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~d_ref~0.base_3) v_ULTIMATE.start_f_~d_ref~0.offset_3 v_ULTIMATE.start_f_~d_3))) (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_f_~d_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_f_~d_ref~0.base_3))) InVars {#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_3, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_3, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_3} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_3, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_3, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 98#L11-1true [351] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~x~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_f_~x~0.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_f_~x~0.base_3) 1) (<= 0 v_ULTIMATE.start_f_~x~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_f_~x~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~x~0.base_3) v_ULTIMATE.start_f_~x~0.offset_3 1)) |v_#memory_int_3|)) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_3, #length=|v_#length_9|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_3, #length=|v_#length_9|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 43#L12true [276] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~y~0.offset_3) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~y~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~y~0.base_3) v_ULTIMATE.start_f_~y~0.offset_3 1))) (<= (+ v_ULTIMATE.start_f_~y~0.offset_3 4) (select |v_#length_11| v_ULTIMATE.start_f_~y~0.base_3)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_f_~y~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_3, #length=|v_#length_11|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_3, #valid=|v_#valid_13|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_3, #length=|v_#length_11|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_3, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#memory_int] 139#L13true [401] L13-->L14: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_f_~k~0.base_3)) (<= 0 v_ULTIMATE.start_f_~k~0.offset_3) (<= (+ v_ULTIMATE.start_f_~k~0.offset_3 4) (select |v_#length_13| v_ULTIMATE.start_f_~k~0.base_3)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~k~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~k~0.base_3) v_ULTIMATE.start_f_~k~0.offset_3 1)))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_3, #length=|v_#length_13|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_3, #valid=|v_#valid_15|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_3, #length=|v_#length_13|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_3, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#memory_int] 85#L14true [334] L14-->L15: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| v_ULTIMATE.start_f_~z~0.base_3 (store (select |v_#memory_int_10| v_ULTIMATE.start_f_~z~0.base_3) v_ULTIMATE.start_f_~z~0.offset_3 1))) (<= 0 v_ULTIMATE.start_f_~z~0.offset_3) (= 1 (select |v_#valid_17| v_ULTIMATE.start_f_~z~0.base_3)) (<= (+ v_ULTIMATE.start_f_~z~0.offset_3 4) (select |v_#length_15| v_ULTIMATE.start_f_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_15|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_3, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_3, #valid=|v_#valid_17|} OutVars{#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_3, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_3, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#memory_int] 18#L15true [795] L15-->L21-3: Formula: (and (<= 0 v_ULTIMATE.start_f_~k~0.offset_17) (<= (select (select |v_#memory_int_83| v_ULTIMATE.start_f_~k~0.base_23) v_ULTIMATE.start_f_~k~0.offset_17) 1073741823) (= (select |v_#valid_139| v_ULTIMATE.start_f_~k~0.base_23) 1) (<= (+ v_ULTIMATE.start_f_~k~0.offset_17 4) (select |v_#length_107| v_ULTIMATE.start_f_~k~0.base_23))) InVars {#valid=|v_#valid_139|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_23, #memory_int=|v_#memory_int_83|, #length=|v_#length_107|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_17} OutVars{ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_13|, #valid=|v_#valid_139|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_23, #memory_int=|v_#memory_int_83|, #length=|v_#length_107|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 129#L21-3true 173.39/123.37 [2019-03-28 12:44:24,414 INFO L796 eck$LassoCheckResult]: Loop: 129#L21-3true [389] L21-3-->L21: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_f_~z~0.base_6) v_ULTIMATE.start_f_~z~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_5) (= 1 (select |v_#valid_27| v_ULTIMATE.start_f_~z~0.base_6)) (<= (+ v_ULTIMATE.start_f_~z~0.offset_5 4) (select |v_#length_19| v_ULTIMATE.start_f_~z~0.base_6))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_6, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_5, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 13#L21true [249] L21-->L21-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_f_~k~0.base_9)) (<= (+ v_ULTIMATE.start_f_~k~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_f_~k~0.base_9)) (<= 0 v_ULTIMATE.start_f_~k~0.offset_7) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~k~0.base_9) v_ULTIMATE.start_f_~k~0.offset_7))) InVars {ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_9, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_7, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_29|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_9, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 133#L21-1true [397] L21-1-->L22: Formula: (< |v_ULTIMATE.start_f_#t~mem6_6| |v_ULTIMATE.start_f_#t~mem7_6|) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_6|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_5|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7] 102#L22true [361] L22-->L22-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~z~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_f_~z~0.base_9)) (= (select |v_#valid_31| v_ULTIMATE.start_f_~z~0.base_9) 1) (<= 0 v_ULTIMATE.start_f_~z~0.offset_7) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_f_~z~0.base_9) v_ULTIMATE.start_f_~z~0.offset_7))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_9, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_7, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_7, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 99#L22-1true [783] L22-1-->L21-3: Formula: (and (<= 0 v_ULTIMATE.start_f_~z~0.offset_29) (= (select |v_#valid_125| v_ULTIMATE.start_f_~z~0.base_41) 1) (= (store |v_#memory_int_64| v_ULTIMATE.start_f_~z~0.base_41 (store (select |v_#memory_int_64| v_ULTIMATE.start_f_~z~0.base_41) v_ULTIMATE.start_f_~z~0.offset_29 (* 2 |v_ULTIMATE.start_f_#t~mem8_10|))) |v_#memory_int_63|) (<= (+ v_ULTIMATE.start_f_~z~0.offset_29 4) (select |v_#length_97| v_ULTIMATE.start_f_~z~0.base_41))) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_10|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_29, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_64|, #length=|v_#length_97|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_41} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_9|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_29, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_63|, #length=|v_#length_97|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_41} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8, #memory_int] 129#L21-3true 173.39/123.37 [2019-03-28 12:44:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:24,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1937291882, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:24,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:24,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:24,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:24,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:24,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.37 [2019-03-28 12:44:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.37 [2019-03-28 12:44:24,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash 395690270, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:24,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:24,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:24,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:24,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:24,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.37 [2019-03-28 12:44:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.37 [2019-03-28 12:44:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:24,492 INFO L82 PathProgramCache]: Analyzing trace with hash 68399273, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:24,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:24,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:24,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:24,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:24,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.37 [2019-03-28 12:44:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.37 [2019-03-28 12:44:24,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.39/123.37 [2019-03-28 12:44:24,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 173.39/123.37 [2019-03-28 12:44:24,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 173.39/123.37 [2019-03-28 12:44:24,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 173.39/123.37 [2019-03-28 12:44:24,633 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 7 states. 173.39/123.37 [2019-03-28 12:44:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.39/123.37 [2019-03-28 12:44:25,784 INFO L93 Difference]: Finished difference Result 186 states and 409 transitions. 173.39/123.37 [2019-03-28 12:44:25,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 173.39/123.37 [2019-03-28 12:44:25,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 409 transitions. 173.39/123.37 [2019-03-28 12:44:25,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 173.39/123.37 [2019-03-28 12:44:25,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 78 states and 193 transitions. 173.39/123.37 [2019-03-28 12:44:25,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 173.39/123.37 [2019-03-28 12:44:25,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 173.39/123.37 [2019-03-28 12:44:25,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 193 transitions. 173.39/123.37 [2019-03-28 12:44:25,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 173.39/123.37 [2019-03-28 12:44:25,797 INFO L706 BuchiCegarLoop]: Abstraction has 78 states and 193 transitions. 173.39/123.37 [2019-03-28 12:44:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 193 transitions. 173.39/123.37 [2019-03-28 12:44:25,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 52. 173.39/123.37 [2019-03-28 12:44:25,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. 173.39/123.37 [2019-03-28 12:44:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 157 transitions. 173.39/123.37 [2019-03-28 12:44:25,801 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 157 transitions. 173.39/123.37 [2019-03-28 12:44:25,801 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 157 transitions. 173.39/123.37 [2019-03-28 12:44:25,801 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 173.39/123.37 [2019-03-28 12:44:25,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 157 transitions. 173.39/123.37 [2019-03-28 12:44:25,803 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 173.39/123.37 [2019-03-28 12:44:25,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 173.39/123.37 [2019-03-28 12:44:25,803 INFO L119 BuchiIsEmpty]: Starting construction of run 173.39/123.37 [2019-03-28 12:44:25,804 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:25,804 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:25,805 INFO L794 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY [781] ULTIMATE.startENTRY-->L38: Formula: (and (= |v_#NULL.offset_2| 0) (= |v_#valid_123| (store |v_#valid_124| 0 0)) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_124|} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, #valid=|v_#valid_123|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet19, #NULL.base] 377#L38 [511] L38-->L11: Formula: (let ((.cse1 (store |v_#valid_8| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1))) (and (= v_ULTIMATE.start_f_~z~0.base_1 |v_ULTIMATE.start_f_#t~malloc4.base_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~d_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~d_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~k~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc4.base_1|)) (= (select .cse1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc3.base_1|) 0) (= |v_ULTIMATE.start_f_#in~d_1| 1) (> |v_ULTIMATE.start_main_#t~nondet19_3| 0) (< |v_ULTIMATE.start_f_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc4.base_1|) (= v_ULTIMATE.start_f_~x~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= v_ULTIMATE.start_f_~y~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~k~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~d_1 |v_ULTIMATE.start_f_#in~d_1|) (= v_ULTIMATE.start_f_~y~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~x~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4) |v_ULTIMATE.start_f_#t~malloc4.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc4.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~z~0.offset_1 |v_ULTIMATE.start_f_#t~malloc4.offset_1|) (= (select .cse3 |v_ULTIMATE.start_f_#t~malloc2.base_1|) 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_f_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (> |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (> 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_3|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_1, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_#in~d=|v_ULTIMATE.start_f_#in~d_1|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_1, ULTIMATE.start_f_#t~malloc4.offset=|v_ULTIMATE.start_f_#t~malloc4.offset_1|, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_1, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_1, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_1, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_1, ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_1|, ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_1|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_1, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_1|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_1|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_1|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_f_#t~malloc4.base=|v_ULTIMATE.start_f_#t~malloc4.base_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_1, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_1, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_2|, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_f_~x~0.base, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_#in~d, ULTIMATE.start_f_~z~0.offset, ULTIMATE.start_f_#t~malloc4.offset, ULTIMATE.start_f_~d, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_~z~0.base, ULTIMATE.start_f_~d_ref~0.base, ULTIMATE.start_f_~k~0.offset, ULTIMATE.start_f_#t~nondet15, ULTIMATE.start_f_#t~nondet12, ULTIMATE.start_f_~x~0.offset, ULTIMATE.start_f_#t~mem16, ULTIMATE.start_f_#t~mem17, ULTIMATE.start_f_#t~mem18, ULTIMATE.start_f_#t~short11, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc4.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_~y~0.offset, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~k~0.base, ULTIMATE.start_f_~y~0.base, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base, ULTIMATE.start_f_~d_ref~0.offset] 378#L11 [358] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~d_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~d_ref~0.base_3) v_ULTIMATE.start_f_~d_ref~0.offset_3 v_ULTIMATE.start_f_~d_3))) (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_f_~d_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_f_~d_ref~0.base_3))) InVars {#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_3, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_3, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_3} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_3, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_3, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 373#L11-1 [351] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~x~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_f_~x~0.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_f_~x~0.base_3) 1) (<= 0 v_ULTIMATE.start_f_~x~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_f_~x~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~x~0.base_3) v_ULTIMATE.start_f_~x~0.offset_3 1)) |v_#memory_int_3|)) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_3, #length=|v_#length_9|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_3, #length=|v_#length_9|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 374#L12 [276] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~y~0.offset_3) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~y~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~y~0.base_3) v_ULTIMATE.start_f_~y~0.offset_3 1))) (<= (+ v_ULTIMATE.start_f_~y~0.offset_3 4) (select |v_#length_11| v_ULTIMATE.start_f_~y~0.base_3)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_f_~y~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_3, #length=|v_#length_11|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_3, #valid=|v_#valid_13|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_3, #length=|v_#length_11|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_3, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#memory_int] 386#L13 [401] L13-->L14: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_f_~k~0.base_3)) (<= 0 v_ULTIMATE.start_f_~k~0.offset_3) (<= (+ v_ULTIMATE.start_f_~k~0.offset_3 4) (select |v_#length_13| v_ULTIMATE.start_f_~k~0.base_3)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~k~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~k~0.base_3) v_ULTIMATE.start_f_~k~0.offset_3 1)))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_3, #length=|v_#length_13|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_3, #valid=|v_#valid_15|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_3, #length=|v_#length_13|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_3, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#memory_int] 363#L14 [334] L14-->L15: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| v_ULTIMATE.start_f_~z~0.base_3 (store (select |v_#memory_int_10| v_ULTIMATE.start_f_~z~0.base_3) v_ULTIMATE.start_f_~z~0.offset_3 1))) (<= 0 v_ULTIMATE.start_f_~z~0.offset_3) (= 1 (select |v_#valid_17| v_ULTIMATE.start_f_~z~0.base_3)) (<= (+ v_ULTIMATE.start_f_~z~0.offset_3 4) (select |v_#length_15| v_ULTIMATE.start_f_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_15|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_3, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_3, #valid=|v_#valid_17|} OutVars{#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_3, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_3, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#memory_int] 364#L15 [795] L15-->L21-3: Formula: (and (<= 0 v_ULTIMATE.start_f_~k~0.offset_17) (<= (select (select |v_#memory_int_83| v_ULTIMATE.start_f_~k~0.base_23) v_ULTIMATE.start_f_~k~0.offset_17) 1073741823) (= (select |v_#valid_139| v_ULTIMATE.start_f_~k~0.base_23) 1) (<= (+ v_ULTIMATE.start_f_~k~0.offset_17 4) (select |v_#length_107| v_ULTIMATE.start_f_~k~0.base_23))) InVars {#valid=|v_#valid_139|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_23, #memory_int=|v_#memory_int_83|, #length=|v_#length_107|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_17} OutVars{ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_13|, #valid=|v_#valid_139|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_23, #memory_int=|v_#memory_int_83|, #length=|v_#length_107|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 366#L21-3 [389] L21-3-->L21: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_f_~z~0.base_6) v_ULTIMATE.start_f_~z~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_5) (= 1 (select |v_#valid_27| v_ULTIMATE.start_f_~z~0.base_6)) (<= (+ v_ULTIMATE.start_f_~z~0.offset_5 4) (select |v_#length_19| v_ULTIMATE.start_f_~z~0.base_6))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_6, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_5, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 354#L21 [249] L21-->L21-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_f_~k~0.base_9)) (<= (+ v_ULTIMATE.start_f_~k~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_f_~k~0.base_9)) (<= 0 v_ULTIMATE.start_f_~k~0.offset_7) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~k~0.base_9) v_ULTIMATE.start_f_~k~0.offset_7))) InVars {ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_9, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_7, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_29|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_9, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 355#L21-1 [450] L21-1-->L26-2: Formula: (>= |v_ULTIMATE.start_f_#t~mem6_4| |v_ULTIMATE.start_f_#t~mem7_4|) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_4|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7] 372#L26-2 173.39/123.37 [2019-03-28 12:44:25,805 INFO L796 eck$LassoCheckResult]: Loop: 372#L26-2 [267] L26-2-->L25: Formula: (and (= (select |v_#valid_35| v_ULTIMATE.start_f_~x~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~x~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_f_~x~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_f_~x~0.base_6) v_ULTIMATE.start_f_~x~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_5)) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, #length=|v_#length_27|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_2|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 365#L25 [673] L25-->L25-1: Formula: (and (>= 0 |v_ULTIMATE.start_f_#t~mem9_3|) (not |v_ULTIMATE.start_f_#t~short11_2|)) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_2|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 362#L25-1 [332] L25-1-->L25-5: Formula: (not |v_ULTIMATE.start_f_#t~short11_5|) InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_5|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_5|} AuxVars[] AssignedVars[] 358#L25-5 [298] L25-5-->L26: Formula: |v_ULTIMATE.start_f_#t~short11_9| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_9|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_5|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_5|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_8|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~short11] 369#L26 [259] L26-->L32: Formula: (= |v_ULTIMATE.start_f_#t~nondet12_5| 0) InVars {ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_5|} OutVars{ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~nondet12] 356#L32 [252] L32-->L32-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~y~0.offset_9 4) (select |v_#length_43| v_ULTIMATE.start_f_~y~0.base_12)) (= 1 (select |v_#valid_51| v_ULTIMATE.start_f_~y~0.base_12)) (<= 0 v_ULTIMATE.start_f_~y~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem17_2| (select (select |v_#memory_int_28| v_ULTIMATE.start_f_~y~0.base_12) v_ULTIMATE.start_f_~y~0.offset_9))) InVars {#memory_int=|v_#memory_int_28|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_12, #length=|v_#length_43|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_9, #valid=|v_#valid_51|} OutVars{ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_9, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_2|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_12, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem17] 352#L32-1 [246] L32-1-->L32-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_7 4) (select |v_#length_45| v_ULTIMATE.start_f_~d_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_7) (= 1 (select |v_#valid_53| v_ULTIMATE.start_f_~d_ref~0.base_9)) (= |v_ULTIMATE.start_f_#t~mem18_2| (select (select |v_#memory_int_29| v_ULTIMATE.start_f_~d_ref~0.base_9) v_ULTIMATE.start_f_~d_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_29|, #length=|v_#length_45|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_9, #valid=|v_#valid_53|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_7} OutVars{#valid=|v_#valid_53|, #memory_int=|v_#memory_int_29|, #length=|v_#length_45|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_2|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_9, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem18] 353#L32-2 [787] L32-2-->L26-2: Formula: (and (= (store |v_#memory_int_68| v_ULTIMATE.start_f_~y~0.base_35 (store (select |v_#memory_int_68| v_ULTIMATE.start_f_~y~0.base_35) v_ULTIMATE.start_f_~y~0.offset_25 (+ |v_ULTIMATE.start_f_#t~mem17_10| (* (- 1) |v_ULTIMATE.start_f_#t~mem18_10|)))) |v_#memory_int_67|) (<= 0 v_ULTIMATE.start_f_~y~0.offset_25) (<= (+ v_ULTIMATE.start_f_~y~0.offset_25 4) (select |v_#length_99| v_ULTIMATE.start_f_~y~0.base_35)) (= 1 (select |v_#valid_131| v_ULTIMATE.start_f_~y~0.base_35))) InVars {ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_25, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_68|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_10|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_35, #length=|v_#length_99|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_10|} OutVars{ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_25, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_67|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_9|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_35, #length=|v_#length_99|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_9|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_f_#t~mem17, ULTIMATE.start_f_#t~mem18] 372#L26-2 173.39/123.37 [2019-03-28 12:44:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:25,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1908448984, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:25,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:25,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:25,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:25,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:25,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.37 [2019-03-28 12:44:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.37 [2019-03-28 12:44:25,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:25,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1154079435, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:25,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:25,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:25,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:25,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:25,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.37 [2019-03-28 12:44:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.37 [2019-03-28 12:44:25,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 173.39/123.37 [2019-03-28 12:44:25,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 173.39/123.37 [2019-03-28 12:44:25,866 INFO L811 eck$LassoCheckResult]: loop already infeasible 173.39/123.37 [2019-03-28 12:44:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 173.39/123.37 [2019-03-28 12:44:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 173.39/123.37 [2019-03-28 12:44:25,867 INFO L87 Difference]: Start difference. First operand 52 states and 157 transitions. cyclomatic complexity: 107 Second operand 3 states. 173.39/123.37 [2019-03-28 12:44:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.39/123.37 [2019-03-28 12:44:26,272 INFO L93 Difference]: Finished difference Result 56 states and 159 transitions. 173.39/123.37 [2019-03-28 12:44:26,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 173.39/123.37 [2019-03-28 12:44:26,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 159 transitions. 173.39/123.37 [2019-03-28 12:44:26,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 173.39/123.37 [2019-03-28 12:44:26,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 52 states and 151 transitions. 173.39/123.37 [2019-03-28 12:44:26,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 173.39/123.37 [2019-03-28 12:44:26,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 173.39/123.37 [2019-03-28 12:44:26,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 151 transitions. 173.39/123.37 [2019-03-28 12:44:26,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 173.39/123.37 [2019-03-28 12:44:26,276 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 151 transitions. 173.39/123.37 [2019-03-28 12:44:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 151 transitions. 173.39/123.37 [2019-03-28 12:44:26,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. 173.39/123.37 [2019-03-28 12:44:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. 173.39/123.37 [2019-03-28 12:44:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 151 transitions. 173.39/123.37 [2019-03-28 12:44:26,278 INFO L729 BuchiCegarLoop]: Abstraction has 52 states and 151 transitions. 173.39/123.37 [2019-03-28 12:44:26,279 INFO L609 BuchiCegarLoop]: Abstraction has 52 states and 151 transitions. 173.39/123.37 [2019-03-28 12:44:26,279 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 173.39/123.37 [2019-03-28 12:44:26,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 151 transitions. 173.39/123.37 [2019-03-28 12:44:26,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 173.39/123.37 [2019-03-28 12:44:26,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 173.39/123.37 [2019-03-28 12:44:26,280 INFO L119 BuchiIsEmpty]: Starting construction of run 173.39/123.37 [2019-03-28 12:44:26,280 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:26,281 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.37 [2019-03-28 12:44:26,281 INFO L794 eck$LassoCheckResult]: Stem: 490#ULTIMATE.startENTRY [781] ULTIMATE.startENTRY-->L38: Formula: (and (= |v_#NULL.offset_2| 0) (= |v_#valid_123| (store |v_#valid_124| 0 0)) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_124|} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, #valid=|v_#valid_123|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet19, #NULL.base] 491#L38 [511] L38-->L11: Formula: (let ((.cse1 (store |v_#valid_8| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1))) (and (= v_ULTIMATE.start_f_~z~0.base_1 |v_ULTIMATE.start_f_#t~malloc4.base_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~d_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~d_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~k~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc4.base_1|)) (= (select .cse1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc3.base_1|) 0) (= |v_ULTIMATE.start_f_#in~d_1| 1) (> |v_ULTIMATE.start_main_#t~nondet19_3| 0) (< |v_ULTIMATE.start_f_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc4.base_1|) (= v_ULTIMATE.start_f_~x~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= v_ULTIMATE.start_f_~y~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~k~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~d_1 |v_ULTIMATE.start_f_#in~d_1|) (= v_ULTIMATE.start_f_~y~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~x~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4) |v_ULTIMATE.start_f_#t~malloc4.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc4.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~z~0.offset_1 |v_ULTIMATE.start_f_#t~malloc4.offset_1|) (= (select .cse3 |v_ULTIMATE.start_f_#t~malloc2.base_1|) 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_f_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (> |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (> 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_3|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_1, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_#in~d=|v_ULTIMATE.start_f_#in~d_1|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_1, ULTIMATE.start_f_#t~malloc4.offset=|v_ULTIMATE.start_f_#t~malloc4.offset_1|, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_1, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_1, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_1, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_1, ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_1|, ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_1|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_1, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_1|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_1|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_1|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_f_#t~malloc4.base=|v_ULTIMATE.start_f_#t~malloc4.base_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_1, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_1, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_2|, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_f_~x~0.base, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_#in~d, ULTIMATE.start_f_~z~0.offset, ULTIMATE.start_f_#t~malloc4.offset, ULTIMATE.start_f_~d, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_~z~0.base, ULTIMATE.start_f_~d_ref~0.base, ULTIMATE.start_f_~k~0.offset, ULTIMATE.start_f_#t~nondet15, ULTIMATE.start_f_#t~nondet12, ULTIMATE.start_f_~x~0.offset, ULTIMATE.start_f_#t~mem16, ULTIMATE.start_f_#t~mem17, ULTIMATE.start_f_#t~mem18, ULTIMATE.start_f_#t~short11, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc4.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_~y~0.offset, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~k~0.base, ULTIMATE.start_f_~y~0.base, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base, ULTIMATE.start_f_~d_ref~0.offset] 492#L11 [358] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~d_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~d_ref~0.base_3) v_ULTIMATE.start_f_~d_ref~0.offset_3 v_ULTIMATE.start_f_~d_3))) (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_f_~d_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_f_~d_ref~0.base_3))) InVars {#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_3, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_3, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_3} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_3, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_3, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 487#L11-1 [351] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~x~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_f_~x~0.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_f_~x~0.base_3) 1) (<= 0 v_ULTIMATE.start_f_~x~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_f_~x~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~x~0.base_3) v_ULTIMATE.start_f_~x~0.offset_3 1)) |v_#memory_int_3|)) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_3, #length=|v_#length_9|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_3, #length=|v_#length_9|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 488#L12 [276] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~y~0.offset_3) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~y~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~y~0.base_3) v_ULTIMATE.start_f_~y~0.offset_3 1))) (<= (+ v_ULTIMATE.start_f_~y~0.offset_3 4) (select |v_#length_11| v_ULTIMATE.start_f_~y~0.base_3)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_f_~y~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_3, #length=|v_#length_11|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_3, #valid=|v_#valid_13|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_3, #length=|v_#length_11|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_3, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#memory_int] 500#L13 [401] L13-->L14: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_f_~k~0.base_3)) (<= 0 v_ULTIMATE.start_f_~k~0.offset_3) (<= (+ v_ULTIMATE.start_f_~k~0.offset_3 4) (select |v_#length_13| v_ULTIMATE.start_f_~k~0.base_3)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~k~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~k~0.base_3) v_ULTIMATE.start_f_~k~0.offset_3 1)))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_3, #length=|v_#length_13|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_3, #valid=|v_#valid_15|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_3, #length=|v_#length_13|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_3, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#memory_int] 477#L14 [334] L14-->L15: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| v_ULTIMATE.start_f_~z~0.base_3 (store (select |v_#memory_int_10| v_ULTIMATE.start_f_~z~0.base_3) v_ULTIMATE.start_f_~z~0.offset_3 1))) (<= 0 v_ULTIMATE.start_f_~z~0.offset_3) (= 1 (select |v_#valid_17| v_ULTIMATE.start_f_~z~0.base_3)) (<= (+ v_ULTIMATE.start_f_~z~0.offset_3 4) (select |v_#length_15| v_ULTIMATE.start_f_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_15|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_3, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_3, #valid=|v_#valid_17|} OutVars{#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_3, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_3, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#memory_int] 478#L15 [795] L15-->L21-3: Formula: (and (<= 0 v_ULTIMATE.start_f_~k~0.offset_17) (<= (select (select |v_#memory_int_83| v_ULTIMATE.start_f_~k~0.base_23) v_ULTIMATE.start_f_~k~0.offset_17) 1073741823) (= (select |v_#valid_139| v_ULTIMATE.start_f_~k~0.base_23) 1) (<= (+ v_ULTIMATE.start_f_~k~0.offset_17 4) (select |v_#length_107| v_ULTIMATE.start_f_~k~0.base_23))) InVars {#valid=|v_#valid_139|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_23, #memory_int=|v_#memory_int_83|, #length=|v_#length_107|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_17} OutVars{ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_13|, #valid=|v_#valid_139|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_23, #memory_int=|v_#memory_int_83|, #length=|v_#length_107|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 480#L21-3 [389] L21-3-->L21: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_f_~z~0.base_6) v_ULTIMATE.start_f_~z~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_5) (= 1 (select |v_#valid_27| v_ULTIMATE.start_f_~z~0.base_6)) (<= (+ v_ULTIMATE.start_f_~z~0.offset_5 4) (select |v_#length_19| v_ULTIMATE.start_f_~z~0.base_6))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_6, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_5, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 468#L21 [249] L21-->L21-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_f_~k~0.base_9)) (<= (+ v_ULTIMATE.start_f_~k~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_f_~k~0.base_9)) (<= 0 v_ULTIMATE.start_f_~k~0.offset_7) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~k~0.base_9) v_ULTIMATE.start_f_~k~0.offset_7))) InVars {ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_9, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_7, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_29|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_9, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 469#L21-1 [450] L21-1-->L26-2: Formula: (>= |v_ULTIMATE.start_f_#t~mem6_4| |v_ULTIMATE.start_f_#t~mem7_4|) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_4|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7] 486#L26-2 173.39/123.37 [2019-03-28 12:44:26,282 INFO L796 eck$LassoCheckResult]: Loop: 486#L26-2 [267] L26-2-->L25: Formula: (and (= (select |v_#valid_35| v_ULTIMATE.start_f_~x~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~x~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_f_~x~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_f_~x~0.base_6) v_ULTIMATE.start_f_~x~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_5)) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, #length=|v_#length_27|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_2|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 479#L25 [674] L25-->L25-1: Formula: (and |v_ULTIMATE.start_f_#t~short11_2| (< 0 |v_ULTIMATE.start_f_#t~mem9_3|)) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_2|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 476#L25-1 [331] L25-1-->L25-2: Formula: |v_ULTIMATE.start_f_#t~short11_3| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_3|} AuxVars[] AssignedVars[] 473#L25-2 [325] L25-2-->L25-3: Formula: (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_f_~y~0.base_6) v_ULTIMATE.start_f_~y~0.offset_5) |v_ULTIMATE.start_f_#t~mem10_2|) (<= 0 v_ULTIMATE.start_f_~y~0.offset_5) (= 1 (select |v_#valid_37| v_ULTIMATE.start_f_~y~0.base_6)) (<= (+ v_ULTIMATE.start_f_~y~0.offset_5 4) (select |v_#length_29| v_ULTIMATE.start_f_~y~0.base_6))) InVars {#memory_int=|v_#memory_int_18|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_6, #length=|v_#length_29|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_5, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_2|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_6, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10] 471#L25-3 [702] L25-3-->L25-5: Formula: (and (< 0 |v_ULTIMATE.start_f_#t~mem10_3|) |v_ULTIMATE.start_f_#t~short11_4|) InVars {ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_4|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 472#L25-5 [298] L25-5-->L26: Formula: |v_ULTIMATE.start_f_#t~short11_9| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_9|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_5|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_5|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_8|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~short11] 481#L26 [259] L26-->L32: Formula: (= |v_ULTIMATE.start_f_#t~nondet12_5| 0) InVars {ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_5|} OutVars{ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~nondet12] 470#L32 [252] L32-->L32-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~y~0.offset_9 4) (select |v_#length_43| v_ULTIMATE.start_f_~y~0.base_12)) (= 1 (select |v_#valid_51| v_ULTIMATE.start_f_~y~0.base_12)) (<= 0 v_ULTIMATE.start_f_~y~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem17_2| (select (select |v_#memory_int_28| v_ULTIMATE.start_f_~y~0.base_12) v_ULTIMATE.start_f_~y~0.offset_9))) InVars {#memory_int=|v_#memory_int_28|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_12, #length=|v_#length_43|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_9, #valid=|v_#valid_51|} OutVars{ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_9, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_2|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_12, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem17] 466#L32-1 [246] L32-1-->L32-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_7 4) (select |v_#length_45| v_ULTIMATE.start_f_~d_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_7) (= 1 (select |v_#valid_53| v_ULTIMATE.start_f_~d_ref~0.base_9)) (= |v_ULTIMATE.start_f_#t~mem18_2| (select (select |v_#memory_int_29| v_ULTIMATE.start_f_~d_ref~0.base_9) v_ULTIMATE.start_f_~d_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_29|, #length=|v_#length_45|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_9, #valid=|v_#valid_53|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_7} OutVars{#valid=|v_#valid_53|, #memory_int=|v_#memory_int_29|, #length=|v_#length_45|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_2|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_9, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem18] 467#L32-2 [787] L32-2-->L26-2: Formula: (and (= (store |v_#memory_int_68| v_ULTIMATE.start_f_~y~0.base_35 (store (select |v_#memory_int_68| v_ULTIMATE.start_f_~y~0.base_35) v_ULTIMATE.start_f_~y~0.offset_25 (+ |v_ULTIMATE.start_f_#t~mem17_10| (* (- 1) |v_ULTIMATE.start_f_#t~mem18_10|)))) |v_#memory_int_67|) (<= 0 v_ULTIMATE.start_f_~y~0.offset_25) (<= (+ v_ULTIMATE.start_f_~y~0.offset_25 4) (select |v_#length_99| v_ULTIMATE.start_f_~y~0.base_35)) (= 1 (select |v_#valid_131| v_ULTIMATE.start_f_~y~0.base_35))) InVars {ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_25, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_68|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_10|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_35, #length=|v_#length_99|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_10|} OutVars{ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_25, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_67|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_9|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_35, #length=|v_#length_99|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_9|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_f_#t~mem17, ULTIMATE.start_f_#t~mem18] 486#L26-2 173.39/123.37 [2019-03-28 12:44:26,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:26,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1908448984, now seen corresponding path program 2 times 173.39/123.37 [2019-03-28 12:44:26,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:26,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:26,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:26,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:26,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.37 [2019-03-28 12:44:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.37 [2019-03-28 12:44:26,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:26,317 INFO L82 PathProgramCache]: Analyzing trace with hash -253551692, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:26,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:26,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:26,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:26,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:26,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.37 [2019-03-28 12:44:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.37 [2019-03-28 12:44:26,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.37 [2019-03-28 12:44:26,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1695046091, now seen corresponding path program 1 times 173.39/123.37 [2019-03-28 12:44:26,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.37 [2019-03-28 12:44:26,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.37 [2019-03-28 12:44:26,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:26,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:26,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.37 [2019-03-28 12:44:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.37 [2019-03-28 12:44:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.37 [2019-03-28 12:44:27,689 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 156 DAG size of output: 131 173.39/123.37 [2019-03-28 12:44:28,242 WARN L188 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 111 173.39/123.37 [2019-03-28 12:44:28,257 INFO L216 LassoAnalysis]: Preferences: 173.39/123.37 [2019-03-28 12:44:28,258 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 173.39/123.37 [2019-03-28 12:44:28,258 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 173.39/123.37 [2019-03-28 12:44:28,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 173.39/123.37 [2019-03-28 12:44:28,258 INFO L127 ssoRankerPreferences]: Use exernal solver: false 173.39/123.37 [2019-03-28 12:44:28,258 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 173.39/123.37 [2019-03-28 12:44:28,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 173.39/123.37 [2019-03-28 12:44:28,259 INFO L130 ssoRankerPreferences]: Path of dumped script: 173.39/123.37 [2019-03-28 12:44:28,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 173.39/123.37 [2019-03-28 12:44:28,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 173.39/123.37 [2019-03-28 12:44:28,259 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 173.39/123.37 [2019-03-28 12:44:28,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:28,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.37 [2019-03-28 12:44:29,094 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 173.39/123.37 [2019-03-28 12:44:29,267 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 173.39/123.37 [2019-03-28 12:44:29,456 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 173.39/123.37 [2019-03-28 12:44:29,836 INFO L300 LassoAnalysis]: Preprocessing complete. 173.39/123.37 [2019-03-28 12:44:29,841 INFO L497 LassoAnalysis]: Using template 'affine'. 173.39/123.37 [2019-03-28 12:44:29,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.37 [2019-03-28 12:44:29,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.37 [2019-03-28 12:44:29,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.37 [2019-03-28 12:44:29,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.37 [2019-03-28 12:44:29,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.37 [2019-03-28 12:44:29,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.37 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.37 Number of strict supporting invariants: 0 173.39/123.37 Number of non-strict supporting invariants: 1 173.39/123.37 Consider only non-deceasing supporting invariants: true 173.39/123.37 Simplify termination arguments: true 173.39/123.37 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.37 [2019-03-28 12:44:29,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.37 [2019-03-28 12:44:29,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.37 [2019-03-28 12:44:29,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.37 [2019-03-28 12:44:29,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:44:29,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:44:29,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:44:29,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:44:29,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:44:29,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:44:29,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:44:29,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:44:29,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:44:29,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:44:29,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:44:29,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:44:29,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:44:29,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:44:29,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:44:29,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:44:29,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:44:29,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:44:29,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:44:29,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:44:29,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:44:29,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:44:29,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:44:29,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:44:29,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:44:29,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:44:29,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:44:29,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:44:29,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:44:29,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:44:29,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:44:29,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:44:29,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:44:29,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:44:29,952 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:44:29,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:44:29,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:44:29,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:44:29,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:44:29,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:44:29,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:44:29,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:44:29,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:44:29,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:44:29,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:44:29,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:44:29,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:44:29,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:44:29,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:44:29,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:44:29,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:44:29,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:44:29,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:44:29,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:44:29,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:44:29,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:44:29,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:44:29,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:44:29,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:44:29,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:44:29,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:44:29,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:44:29,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:44:29,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:44:29,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:44:29,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:44:29,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:44:29,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:44:29,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:44:29,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:44:29,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:44:29,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:44:29,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:44:30,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:44:30,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:44:30,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:44:30,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:44:30,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:44:30,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:44:30,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:44:30,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:44:30,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:44:30,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:44:30,017 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 173.39/123.38 [2019-03-28 12:44:30,030 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. 173.39/123.38 [2019-03-28 12:44:30,031 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. 173.39/123.38 [2019-03-28 12:44:30,033 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 173.39/123.38 [2019-03-28 12:44:30,035 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 173.39/123.38 [2019-03-28 12:44:30,035 INFO L518 LassoAnalysis]: Proved termination. 173.39/123.38 [2019-03-28 12:44:30,036 INFO L520 LassoAnalysis]: Termination argument consisting of: 173.39/123.38 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1 173.39/123.38 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_1 - 1 >= 0] 173.39/123.38 [2019-03-28 12:44:30,312 INFO L297 tatePredicateManager]: 57 out of 59 supporting invariants were superfluous and have been removed 173.39/123.38 [2019-03-28 12:44:30,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 173.39/123.38 [2019-03-28 12:44:30,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.38 [2019-03-28 12:44:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.38 [2019-03-28 12:44:30,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 30 conjunts are in the unsatisfiable core 173.39/123.38 [2019-03-28 12:44:30,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... 173.39/123.38 [2019-03-28 12:44:30,413 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:44:30,420 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:44:30,424 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:44:30,459 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:44:30,459 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 173.39/123.38 [2019-03-28 12:44:30,460 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:44:30,496 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:44:30,497 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:44:30,497 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:44 173.39/123.38 [2019-03-28 12:44:30,560 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 173.39/123.38 [2019-03-28 12:44:30,560 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:44:30,588 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:44:30,589 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:44:30,589 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 173.39/123.38 [2019-03-28 12:44:30,643 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:44:30,645 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 173.39/123.38 [2019-03-28 12:44:30,646 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:44:30,681 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:44:30,682 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:44:30,682 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:55 173.39/123.38 [2019-03-28 12:44:30,766 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:44:30,768 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:44:30,770 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 173.39/123.38 [2019-03-28 12:44:30,771 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:44:30,810 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:44:30,811 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:44:30,811 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:66, output treesize:62 173.39/123.38 [2019-03-28 12:44:30,889 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:44:30,891 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:44:30,892 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:44:30,893 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 173.39/123.38 [2019-03-28 12:44:30,894 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:44:30,937 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:44:30,938 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:44:30,939 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:69 173.39/123.38 [2019-03-28 12:44:31,022 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:44:31,023 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:44:31,025 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:44:31,026 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:44:31,027 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 173.39/123.38 [2019-03-28 12:44:31,028 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:44:31,064 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:44:31,066 INFO L427 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:44:31,066 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:80, output treesize:76 173.39/123.38 [2019-03-28 12:44:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.38 [2019-03-28 12:44:31,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjunts are in the unsatisfiable core 173.39/123.38 [2019-03-28 12:44:31,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... 173.39/123.38 [2019-03-28 12:44:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.38 [2019-03-28 12:44:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:44:31,815 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 173.39/123.38 [2019-03-28 12:44:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:44:31,823 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 173.39/123.38 [2019-03-28 12:44:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:44:31,834 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 173.39/123.38 [2019-03-28 12:44:31,834 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 173.39/123.38 [2019-03-28 12:44:31,838 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.18 stem predicates 7 loop predicates 173.39/123.38 [2019-03-28 12:44:31,839 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 52 states and 151 transitions. cyclomatic complexity: 101 Second operand 13 states. 173.39/123.38 [2019-03-28 12:45:22,246 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 52 states and 151 transitions. cyclomatic complexity: 101. Second operand 13 states. Result 4567 states and 5232 transitions. Complement of second has 1411 states. 173.39/123.38 [2019-03-28 12:45:22,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 184 states 171 stem states 12 non-accepting loop states 1 accepting loop states 173.39/123.38 [2019-03-28 12:45:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 173.39/123.38 [2019-03-28 12:45:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 3760 transitions. 173.39/123.38 [2019-03-28 12:45:22,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 3760 transitions. Stem has 11 letters. Loop has 10 letters. 173.39/123.38 [2019-03-28 12:45:22,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. 173.39/123.38 [2019-03-28 12:45:22,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 3760 transitions. Stem has 21 letters. Loop has 10 letters. 173.39/123.38 [2019-03-28 12:45:22,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. 173.39/123.38 [2019-03-28 12:45:22,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 184 states and 3760 transitions. Stem has 11 letters. Loop has 20 letters. 173.39/123.38 [2019-03-28 12:45:22,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. 173.39/123.38 [2019-03-28 12:45:22,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4567 states and 5232 transitions. 173.39/123.38 [2019-03-28 12:45:22,379 INFO L131 ngComponentsAnalysis]: Automaton has 93 accepting balls. 1314 173.39/123.38 [2019-03-28 12:45:22,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4567 states to 3651 states and 4124 transitions. 173.39/123.38 [2019-03-28 12:45:22,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2979 173.39/123.38 [2019-03-28 12:45:22,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3043 173.39/123.38 [2019-03-28 12:45:22,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3651 states and 4124 transitions. 173.39/123.38 [2019-03-28 12:45:22,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 173.39/123.38 [2019-03-28 12:45:22,408 INFO L706 BuchiCegarLoop]: Abstraction has 3651 states and 4124 transitions. 173.39/123.38 [2019-03-28 12:45:22,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states and 4124 transitions. 173.39/123.38 [2019-03-28 12:45:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 69. 173.39/123.38 [2019-03-28 12:45:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. 173.39/123.38 [2019-03-28 12:45:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 171 transitions. 173.39/123.38 [2019-03-28 12:45:22,429 INFO L729 BuchiCegarLoop]: Abstraction has 69 states and 171 transitions. 173.39/123.38 [2019-03-28 12:45:22,429 INFO L609 BuchiCegarLoop]: Abstraction has 69 states and 171 transitions. 173.39/123.38 [2019-03-28 12:45:22,429 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 173.39/123.38 [2019-03-28 12:45:22,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 171 transitions. 173.39/123.38 [2019-03-28 12:45:22,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 173.39/123.38 [2019-03-28 12:45:22,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 173.39/123.38 [2019-03-28 12:45:22,430 INFO L119 BuchiIsEmpty]: Starting construction of run 173.39/123.38 [2019-03-28 12:45:22,431 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.38 [2019-03-28 12:45:22,431 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.38 [2019-03-28 12:45:22,432 INFO L794 eck$LassoCheckResult]: Stem: 7236#ULTIMATE.startENTRY [781] ULTIMATE.startENTRY-->L38: Formula: (and (= |v_#NULL.offset_2| 0) (= |v_#valid_123| (store |v_#valid_124| 0 0)) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_124|} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, #valid=|v_#valid_123|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet19, #NULL.base] 7237#L38 [575] L38-->L11-2: Formula: (let ((.cse3 (store |v_#valid_68| |v_ULTIMATE.start_f_#t~malloc0.base_7| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_f_#t~malloc1.base_7| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_f_#t~malloc2.base_7| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_f_#t~malloc3.base_7| 1))) (and (> |v_ULTIMATE.start_f_#t~malloc3.base_7| 0) (= |v_ULTIMATE.start_f_#in~d_2| 2) (= v_ULTIMATE.start_f_~x~0.base_15 |v_ULTIMATE.start_f_#t~malloc1.base_7|) (= 0 (select |v_#valid_68| |v_ULTIMATE.start_f_#t~malloc0.base_7|)) (> |v_ULTIMATE.start_f_#t~malloc0.base_7| 0) (= |v_ULTIMATE.start_main_#t~nondet19_5| 0) (< |v_ULTIMATE.start_f_#t~malloc0.base_7| |v_#StackHeapBarrier_2|) (= v_ULTIMATE.start_f_~k~0.offset_9 |v_ULTIMATE.start_f_#t~malloc3.offset_7|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc3.base_7|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_7|) (= v_ULTIMATE.start_f_~d_ref~0.base_12 |v_ULTIMATE.start_f_#t~malloc0.base_7|) (= v_ULTIMATE.start_f_~d_ref~0.offset_9 |v_ULTIMATE.start_f_#t~malloc0.offset_7|) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_7|) (= v_ULTIMATE.start_f_~z~0.offset_15 |v_ULTIMATE.start_f_#t~malloc4.offset_7|) (= (select .cse1 |v_ULTIMATE.start_f_#t~malloc2.base_7|) 0) (< 0 |v_ULTIMATE.start_f_#t~malloc4.base_7|) (= v_ULTIMATE.start_f_~y~0.base_18 |v_ULTIMATE.start_f_#t~malloc2.base_7|) (< |v_ULTIMATE.start_f_#t~malloc1.base_7| |v_#StackHeapBarrier_2|) (= |v_#length_49| (store (store (store (store (store |v_#length_54| |v_ULTIMATE.start_f_#t~malloc0.base_7| 4) |v_ULTIMATE.start_f_#t~malloc1.base_7| 4) |v_ULTIMATE.start_f_#t~malloc2.base_7| 4) |v_ULTIMATE.start_f_#t~malloc3.base_7| 4) |v_ULTIMATE.start_f_#t~malloc4.base_7| 4)) (= (store .cse2 |v_ULTIMATE.start_f_#t~malloc4.base_7| 1) |v_#valid_63|) (= v_ULTIMATE.start_f_~x~0.offset_11 |v_ULTIMATE.start_f_#t~malloc1.offset_7|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_7|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc4.base_7|) 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_7| |v_#StackHeapBarrier_2|) (< |v_ULTIMATE.start_f_#t~malloc3.base_7| |v_#StackHeapBarrier_2|) (< |v_ULTIMATE.start_f_#t~malloc4.base_7| |v_#StackHeapBarrier_2|) (= 0 |v_ULTIMATE.start_f_#t~malloc4.offset_7|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_7| 0) (= v_ULTIMATE.start_f_~k~0.base_12 |v_ULTIMATE.start_f_#t~malloc3.base_7|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_7| 0) (= (select .cse3 |v_ULTIMATE.start_f_#t~malloc1.base_7|) 0) (= v_ULTIMATE.start_f_~d_4 |v_ULTIMATE.start_f_#in~d_2|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_7| 0) (= v_ULTIMATE.start_f_~z~0.base_21 |v_ULTIMATE.start_f_#t~malloc4.base_7|) (= v_ULTIMATE.start_f_~y~0.offset_13 |v_ULTIMATE.start_f_#t~malloc2.offset_7|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_54|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_5|, #valid=|v_#valid_68|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_15, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_7|, ULTIMATE.start_f_#in~d=|v_ULTIMATE.start_f_#in~d_2|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_15, ULTIMATE.start_f_#t~malloc4.offset=|v_ULTIMATE.start_f_#t~malloc4.offset_7|, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_4, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_7|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_7|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_7|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_7|, #length=|v_#length_49|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_21, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_12, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_9, ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_4|, ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_6|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_11, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_5|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_5|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_5|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_10|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_5|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_5|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_7|, ULTIMATE.start_f_#t~malloc4.base=|v_ULTIMATE.start_f_#t~malloc4.base_7|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_7|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_7|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_6|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_13, #valid=|v_#valid_63|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_7|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_12, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_18, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_4|, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_7|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_7|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_~x~0.base, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_#in~d, ULTIMATE.start_f_~z~0.offset, ULTIMATE.start_f_#t~malloc4.offset, ULTIMATE.start_f_~d, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_~z~0.base, ULTIMATE.start_f_~d_ref~0.base, ULTIMATE.start_f_~k~0.offset, ULTIMATE.start_f_#t~nondet15, ULTIMATE.start_f_#t~nondet12, ULTIMATE.start_f_~x~0.offset, ULTIMATE.start_f_#t~mem16, ULTIMATE.start_f_#t~mem17, ULTIMATE.start_f_#t~mem18, ULTIMATE.start_f_#t~short11, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc4.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_~y~0.offset, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~k~0.base, ULTIMATE.start_f_~y~0.base, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base, ULTIMATE.start_f_~d_ref~0.offset] 7202#L11-2 [320] L11-2-->L11-3: Formula: (and (= 1 (select |v_#valid_69| v_ULTIMATE.start_f_~d_ref~0.base_14)) (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_11 4) (select |v_#length_55| v_ULTIMATE.start_f_~d_ref~0.base_14)) (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_11) (= (store |v_#memory_int_33| v_ULTIMATE.start_f_~d_ref~0.base_14 (store (select |v_#memory_int_33| v_ULTIMATE.start_f_~d_ref~0.base_14) v_ULTIMATE.start_f_~d_ref~0.offset_11 v_ULTIMATE.start_f_~d_6)) |v_#memory_int_32|)) InVars {#valid=|v_#valid_69|, #memory_int=|v_#memory_int_33|, #length=|v_#length_55|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_14, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_6, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_11} OutVars{#valid=|v_#valid_69|, #memory_int=|v_#memory_int_32|, #length=|v_#length_55|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_14, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_6, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int] 7200#L11-3 [314] L11-3-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~x~0.offset_13 4) (select |v_#length_57| v_ULTIMATE.start_f_~x~0.base_17)) (= (store |v_#memory_int_35| v_ULTIMATE.start_f_~x~0.base_17 (store (select |v_#memory_int_35| v_ULTIMATE.start_f_~x~0.base_17) v_ULTIMATE.start_f_~x~0.offset_13 1)) |v_#memory_int_34|) (<= 0 v_ULTIMATE.start_f_~x~0.offset_13) (= (select |v_#valid_71| v_ULTIMATE.start_f_~x~0.base_17) 1)) InVars {#memory_int=|v_#memory_int_35|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_17, #length=|v_#length_57|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_13, #valid=|v_#valid_71|} OutVars{#memory_int=|v_#memory_int_34|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_17, #length=|v_#length_57|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_13, #valid=|v_#valid_71|} AuxVars[] AssignedVars[#memory_int] 7201#L12-1 [273] L12-1-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~y~0.offset_15 4) (select |v_#length_59| v_ULTIMATE.start_f_~y~0.base_20)) (<= 0 v_ULTIMATE.start_f_~y~0.offset_15) (= (select |v_#valid_73| v_ULTIMATE.start_f_~y~0.base_20) 1) (= |v_#memory_int_36| (store |v_#memory_int_37| v_ULTIMATE.start_f_~y~0.base_20 (store (select |v_#memory_int_37| v_ULTIMATE.start_f_~y~0.base_20) v_ULTIMATE.start_f_~y~0.offset_15 1)))) InVars {#memory_int=|v_#memory_int_37|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_20, #length=|v_#length_59|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_15, #valid=|v_#valid_73|} OutVars{#memory_int=|v_#memory_int_36|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_20, #length=|v_#length_59|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_15, #valid=|v_#valid_73|} AuxVars[] AssignedVars[#memory_int] 7247#L13-1 [398] L13-1-->L14-1: Formula: (and (= (select |v_#valid_75| v_ULTIMATE.start_f_~k~0.base_14) 1) (<= 0 v_ULTIMATE.start_f_~k~0.offset_11) (<= (+ v_ULTIMATE.start_f_~k~0.offset_11 4) (select |v_#length_61| v_ULTIMATE.start_f_~k~0.base_14)) (= |v_#memory_int_38| (store |v_#memory_int_39| v_ULTIMATE.start_f_~k~0.base_14 (store (select |v_#memory_int_39| v_ULTIMATE.start_f_~k~0.base_14) v_ULTIMATE.start_f_~k~0.offset_11 1)))) InVars {#memory_int=|v_#memory_int_39|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_14, #length=|v_#length_61|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_11, #valid=|v_#valid_75|} OutVars{#memory_int=|v_#memory_int_38|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_14, #length=|v_#length_61|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_11, #valid=|v_#valid_75|} AuxVars[] AssignedVars[#memory_int] 7217#L14-1 [328] L14-1-->L15-1: Formula: (and (= |v_#memory_int_40| (store |v_#memory_int_41| v_ULTIMATE.start_f_~z~0.base_23 (store (select |v_#memory_int_41| v_ULTIMATE.start_f_~z~0.base_23) v_ULTIMATE.start_f_~z~0.offset_17 1))) (<= (+ v_ULTIMATE.start_f_~z~0.offset_17 4) (select |v_#length_63| v_ULTIMATE.start_f_~z~0.base_23)) (= (select |v_#valid_77| v_ULTIMATE.start_f_~z~0.base_23) 1) (<= 0 v_ULTIMATE.start_f_~z~0.offset_17)) InVars {#memory_int=|v_#memory_int_41|, #length=|v_#length_63|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_23, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_17, #valid=|v_#valid_77|} OutVars{#memory_int=|v_#memory_int_40|, #length=|v_#length_63|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_23, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_17, #valid=|v_#valid_77|} AuxVars[] AssignedVars[#memory_int] 7218#L15-1 [796] L15-1-->L21-7: Formula: (and (<= 0 v_ULTIMATE.start_f_~k~0.offset_18) (= (select |v_#valid_140| v_ULTIMATE.start_f_~k~0.base_24) 1) (<= (select (select |v_#memory_int_84| v_ULTIMATE.start_f_~k~0.base_24) v_ULTIMATE.start_f_~k~0.offset_18) 1073741823) (<= (+ v_ULTIMATE.start_f_~k~0.offset_18 4) (select |v_#length_108| v_ULTIMATE.start_f_~k~0.base_24))) InVars {#valid=|v_#valid_140|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_24, #memory_int=|v_#memory_int_84|, #length=|v_#length_108|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_18} OutVars{ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_15|, #valid=|v_#valid_140|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_24, #memory_int=|v_#memory_int_84|, #length=|v_#length_108|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_18} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 7244#L21-7 [405] L21-7-->L21-4: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_8| (select (select |v_#memory_int_43| v_ULTIMATE.start_f_~z~0.base_26) v_ULTIMATE.start_f_~z~0.offset_19)) (= 1 (select |v_#valid_87| v_ULTIMATE.start_f_~z~0.base_26)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_19) (<= (+ v_ULTIMATE.start_f_~z~0.offset_19 4) (select |v_#length_67| v_ULTIMATE.start_f_~z~0.base_26))) InVars {#memory_int=|v_#memory_int_43|, #length=|v_#length_67|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_26, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_19, #valid=|v_#valid_87|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_8|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_19, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_43|, #length=|v_#length_67|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 7256#L21-4 [382] L21-4-->L21-5: Formula: (and (<= 0 v_ULTIMATE.start_f_~k~0.offset_15) (= 1 (select |v_#valid_89| v_ULTIMATE.start_f_~k~0.base_20)) (<= (+ v_ULTIMATE.start_f_~k~0.offset_15 4) (select |v_#length_69| v_ULTIMATE.start_f_~k~0.base_20)) (= |v_ULTIMATE.start_f_#t~mem7_8| (select (select |v_#memory_int_44| v_ULTIMATE.start_f_~k~0.base_20) v_ULTIMATE.start_f_~k~0.offset_15))) InVars {ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_20, #memory_int=|v_#memory_int_44|, #length=|v_#length_69|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_15, #valid=|v_#valid_89|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_8|, #valid=|v_#valid_89|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_20, #memory_int=|v_#memory_int_44|, #length=|v_#length_69|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_15} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 7252#L21-5 [452] L21-5-->L26-5: Formula: (>= |v_ULTIMATE.start_f_#t~mem6_10| |v_ULTIMATE.start_f_#t~mem7_10|) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_10|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_10|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_9|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_9|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7] 7230#L26-5 173.39/123.38 [2019-03-28 12:45:22,432 INFO L796 eck$LassoCheckResult]: Loop: 7230#L26-5 [261] L26-5-->L25-8: Formula: (and (<= (+ v_ULTIMATE.start_f_~x~0.offset_15 4) (select |v_#length_75| v_ULTIMATE.start_f_~x~0.base_20)) (= 1 (select |v_#valid_95| v_ULTIMATE.start_f_~x~0.base_20)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_15) (= |v_ULTIMATE.start_f_#t~mem9_7| (select (select |v_#memory_int_48| v_ULTIMATE.start_f_~x~0.base_20) v_ULTIMATE.start_f_~x~0.offset_15))) InVars {#memory_int=|v_#memory_int_48|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_20, #length=|v_#length_75|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_15, #valid=|v_#valid_95|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_20, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_7|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_15, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_48|, #length=|v_#length_75|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 7235#L25-8 [675] L25-8-->L25-9: Formula: (and |v_ULTIMATE.start_f_#t~short11_11| (< 0 |v_ULTIMATE.start_f_#t~mem9_8|)) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_8|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_11|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_8|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 7253#L25-9 [285] L25-9-->L25-10: Formula: |v_ULTIMATE.start_f_#t~short11_12| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_12|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_12|} AuxVars[] AssignedVars[] 7249#L25-10 [279] L25-10-->L25-11: Formula: (and (= (select |v_#valid_97| v_ULTIMATE.start_f_~y~0.base_23) 1) (<= (+ v_ULTIMATE.start_f_~y~0.offset_17 4) (select |v_#length_77| v_ULTIMATE.start_f_~y~0.base_23)) (<= 0 v_ULTIMATE.start_f_~y~0.offset_17) (= |v_ULTIMATE.start_f_#t~mem10_7| (select (select |v_#memory_int_49| v_ULTIMATE.start_f_~y~0.base_23) v_ULTIMATE.start_f_~y~0.offset_17))) InVars {#memory_int=|v_#memory_int_49|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_23, #length=|v_#length_77|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_17, #valid=|v_#valid_97|} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_7|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_17, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_49|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_23, #length=|v_#length_77|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10] 7250#L25-11 [705] L25-11-->L25-13: Formula: (and (< 0 |v_ULTIMATE.start_f_#t~mem10_8|) |v_ULTIMATE.start_f_#t~short11_13|) InVars {ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_8|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_13|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_8|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 7257#L25-13 [301] L25-13-->L26-3: Formula: |v_ULTIMATE.start_f_#t~short11_18| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_18|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_10|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_10|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_17|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~short11] 7239#L26-3 [265] L26-3-->L32-4: Formula: (= |v_ULTIMATE.start_f_#t~nondet12_10| 0) InVars {ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_10|} OutVars{ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_9|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~nondet12] 7241#L32-4 [385] L32-4-->L32-5: Formula: (and (= |v_ULTIMATE.start_f_#t~mem17_6| (select (select |v_#memory_int_59| v_ULTIMATE.start_f_~y~0.base_29) v_ULTIMATE.start_f_~y~0.offset_21)) (= 1 (select |v_#valid_111| v_ULTIMATE.start_f_~y~0.base_29)) (<= 0 v_ULTIMATE.start_f_~y~0.offset_21) (<= (+ v_ULTIMATE.start_f_~y~0.offset_21 4) (select |v_#length_91| v_ULTIMATE.start_f_~y~0.base_29))) InVars {#memory_int=|v_#memory_int_59|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_29, #length=|v_#length_91|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_21, #valid=|v_#valid_111|} OutVars{ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_21, #valid=|v_#valid_111|, #memory_int=|v_#memory_int_59|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_6|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_29, #length=|v_#length_91|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem17] 7254#L32-5 [379] L32-5-->L32-6: Formula: (and (= |v_ULTIMATE.start_f_#t~mem18_6| (select (select |v_#memory_int_60| v_ULTIMATE.start_f_~d_ref~0.base_20) v_ULTIMATE.start_f_~d_ref~0.offset_15)) (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_15 4) (select |v_#length_93| v_ULTIMATE.start_f_~d_ref~0.base_20)) (= (select |v_#valid_113| v_ULTIMATE.start_f_~d_ref~0.base_20) 1) (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_15)) InVars {#memory_int=|v_#memory_int_60|, #length=|v_#length_93|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_20, #valid=|v_#valid_113|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_15} OutVars{#valid=|v_#valid_113|, #memory_int=|v_#memory_int_60|, #length=|v_#length_93|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_6|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_20, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_15} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem18] 7251#L32-6 [789] L32-6-->L26-5: Formula: (and (= |v_#memory_int_71| (store |v_#memory_int_72| v_ULTIMATE.start_f_~y~0.base_36 (store (select |v_#memory_int_72| v_ULTIMATE.start_f_~y~0.base_36) v_ULTIMATE.start_f_~y~0.offset_26 (+ (* (- 1) |v_ULTIMATE.start_f_#t~mem18_12|) |v_ULTIMATE.start_f_#t~mem17_12|)))) (<= 0 v_ULTIMATE.start_f_~y~0.offset_26) (<= (+ v_ULTIMATE.start_f_~y~0.offset_26 4) (select |v_#length_101| v_ULTIMATE.start_f_~y~0.base_36)) (= 1 (select |v_#valid_133| v_ULTIMATE.start_f_~y~0.base_36))) InVars {ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_26, #valid=|v_#valid_133|, #memory_int=|v_#memory_int_72|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_12|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_36, #length=|v_#length_101|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_12|} OutVars{ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_26, #valid=|v_#valid_133|, #memory_int=|v_#memory_int_71|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_11|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_36, #length=|v_#length_101|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_f_#t~mem17, ULTIMATE.start_f_#t~mem18] 7230#L26-5 173.39/123.38 [2019-03-28 12:45:22,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.38 [2019-03-28 12:45:22,433 INFO L82 PathProgramCache]: Analyzing trace with hash -633083875, now seen corresponding path program 1 times 173.39/123.38 [2019-03-28 12:45:22,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.38 [2019-03-28 12:45:22,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.38 [2019-03-28 12:45:22,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:22,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:22,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:45:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:45:22,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.38 [2019-03-28 12:45:22,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1528316873, now seen corresponding path program 1 times 173.39/123.38 [2019-03-28 12:45:22,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.38 [2019-03-28 12:45:22,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.38 [2019-03-28 12:45:22,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:22,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:22,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:45:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:45:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.38 [2019-03-28 12:45:22,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1382887763, now seen corresponding path program 1 times 173.39/123.38 [2019-03-28 12:45:22,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.38 [2019-03-28 12:45:22,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.38 [2019-03-28 12:45:22,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:22,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:22,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:45:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:45:23,815 WARN L188 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 157 DAG size of output: 136 173.39/123.38 [2019-03-28 12:45:24,520 WARN L188 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 116 173.39/123.38 [2019-03-28 12:45:24,524 INFO L216 LassoAnalysis]: Preferences: 173.39/123.38 [2019-03-28 12:45:24,524 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 173.39/123.38 [2019-03-28 12:45:24,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 173.39/123.38 [2019-03-28 12:45:24,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 173.39/123.38 [2019-03-28 12:45:24,524 INFO L127 ssoRankerPreferences]: Use exernal solver: false 173.39/123.38 [2019-03-28 12:45:24,525 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 173.39/123.38 [2019-03-28 12:45:24,525 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 173.39/123.38 [2019-03-28 12:45:24,525 INFO L130 ssoRankerPreferences]: Path of dumped script: 173.39/123.38 [2019-03-28 12:45:24,525 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 173.39/123.38 [2019-03-28 12:45:24,525 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 173.39/123.38 [2019-03-28 12:45:24,525 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 173.39/123.38 [2019-03-28 12:45:24,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:24,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:25,429 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 173.39/123.38 [2019-03-28 12:45:25,579 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 173.39/123.38 [2019-03-28 12:45:25,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:25,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:25,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:25,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:25,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:25,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:25,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 173.39/123.38 [2019-03-28 12:45:26,129 INFO L300 LassoAnalysis]: Preprocessing complete. 173.39/123.38 [2019-03-28 12:45:26,129 INFO L497 LassoAnalysis]: Using template 'affine'. 173.39/123.38 [2019-03-28 12:45:26,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.38 [2019-03-28 12:45:26,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.38 [2019-03-28 12:45:26,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.38 [2019-03-28 12:45:26,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.38 [2019-03-28 12:45:26,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.38 [2019-03-28 12:45:26,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.38 [2019-03-28 12:45:26,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.38 [2019-03-28 12:45:26,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.38 [2019-03-28 12:45:26,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.38 [2019-03-28 12:45:26,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.38 [2019-03-28 12:45:26,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.38 [2019-03-28 12:45:26,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 173.39/123.38 [2019-03-28 12:45:26,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 173.39/123.38 [2019-03-28 12:45:26,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 173.39/123.38 Termination analysis: LINEAR_WITH_GUESSES 173.39/123.38 Number of strict supporting invariants: 0 173.39/123.38 Number of non-strict supporting invariants: 1 173.39/123.38 Consider only non-deceasing supporting invariants: true 173.39/123.38 Simplify termination arguments: true 173.39/123.38 Simplify supporting invariants: trueOverapproximate stem: false 173.39/123.38 [2019-03-28 12:45:26,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. 173.39/123.38 [2019-03-28 12:45:26,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 173.39/123.38 [2019-03-28 12:45:26,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 173.39/123.38 [2019-03-28 12:45:26,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 173.39/123.38 [2019-03-28 12:45:26,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 173.39/123.38 [2019-03-28 12:45:26,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 173.39/123.38 [2019-03-28 12:45:26,237 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 173.39/123.38 [2019-03-28 12:45:26,242 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 173.39/123.38 [2019-03-28 12:45:26,242 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. 173.39/123.38 [2019-03-28 12:45:26,243 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 173.39/123.38 [2019-03-28 12:45:26,244 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. 173.39/123.38 [2019-03-28 12:45:26,244 INFO L518 LassoAnalysis]: Proved termination. 173.39/123.38 [2019-03-28 12:45:26,244 INFO L520 LassoAnalysis]: Termination argument consisting of: 173.39/123.38 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2 173.39/123.38 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_2 - 2 >= 0] 173.39/123.38 [2019-03-28 12:45:26,500 INFO L297 tatePredicateManager]: 57 out of 59 supporting invariants were superfluous and have been removed 173.39/123.38 [2019-03-28 12:45:26,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 173.39/123.38 [2019-03-28 12:45:26,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.38 [2019-03-28 12:45:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.38 [2019-03-28 12:45:26,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 27 conjunts are in the unsatisfiable core 173.39/123.38 [2019-03-28 12:45:26,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... 173.39/123.38 [2019-03-28 12:45:26,580 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:26,580 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 101 173.39/123.38 [2019-03-28 12:45:26,581 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:26,600 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:26,601 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:26,601 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:45 173.39/123.38 [2019-03-28 12:45:26,636 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 173.39/123.38 [2019-03-28 12:45:26,636 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:26,658 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:26,659 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:26,659 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:49 173.39/123.38 [2019-03-28 12:45:26,694 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 173.39/123.38 [2019-03-28 12:45:26,695 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:26,715 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:26,716 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:26,716 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:56 173.39/123.38 [2019-03-28 12:45:26,754 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 173.39/123.38 [2019-03-28 12:45:26,754 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:26,777 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:26,778 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:26,778 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:63 173.39/123.38 [2019-03-28 12:45:26,823 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 173.39/123.38 [2019-03-28 12:45:26,824 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:26,849 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:26,850 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:26,850 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:74, output treesize:70 173.39/123.38 [2019-03-28 12:45:26,901 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 173.39/123.38 [2019-03-28 12:45:26,902 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:26,930 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:26,932 INFO L427 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:26,932 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:81, output treesize:77 173.39/123.38 [2019-03-28 12:45:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.38 [2019-03-28 12:45:27,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjunts are in the unsatisfiable core 173.39/123.38 [2019-03-28 12:45:27,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... 173.39/123.38 [2019-03-28 12:45:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.38 [2019-03-28 12:45:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:45:27,637 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 173.39/123.38 [2019-03-28 12:45:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:45:27,649 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 173.39/123.38 [2019-03-28 12:45:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:45:27,661 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 173.39/123.38 [2019-03-28 12:45:27,661 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization 173.39/123.38 [2019-03-28 12:45:27,661 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.17 stem predicates 7 loop predicates 173.39/123.38 [2019-03-28 12:45:27,661 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 69 states and 171 transitions. cyclomatic complexity: 105 Second operand 13 states. 173.39/123.38 [2019-03-28 12:45:29,902 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 173.39/123.38 [2019-03-28 12:45:36,678 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 69 states and 171 transitions. cyclomatic complexity: 105. Second operand 13 states. Result 159 states and 272 transitions. Complement of second has 54 states. 173.39/123.38 [2019-03-28 12:45:36,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 29 states 16 stem states 12 non-accepting loop states 1 accepting loop states 173.39/123.38 [2019-03-28 12:45:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 173.39/123.38 [2019-03-28 12:45:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 247 transitions. 173.39/123.38 [2019-03-28 12:45:36,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 247 transitions. Stem has 11 letters. Loop has 10 letters. 173.39/123.38 [2019-03-28 12:45:36,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. 173.39/123.38 [2019-03-28 12:45:36,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 247 transitions. Stem has 21 letters. Loop has 10 letters. 173.39/123.38 [2019-03-28 12:45:36,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. 173.39/123.38 [2019-03-28 12:45:36,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 247 transitions. Stem has 11 letters. Loop has 20 letters. 173.39/123.38 [2019-03-28 12:45:36,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. 173.39/123.38 [2019-03-28 12:45:36,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 272 transitions. 173.39/123.38 [2019-03-28 12:45:36,714 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 173.39/123.38 [2019-03-28 12:45:36,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 130 states and 237 transitions. 173.39/123.38 [2019-03-28 12:45:36,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 173.39/123.38 [2019-03-28 12:45:36,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 173.39/123.38 [2019-03-28 12:45:36,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 237 transitions. 173.39/123.38 [2019-03-28 12:45:36,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 173.39/123.38 [2019-03-28 12:45:36,716 INFO L706 BuchiCegarLoop]: Abstraction has 130 states and 237 transitions. 173.39/123.38 [2019-03-28 12:45:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 237 transitions. 173.39/123.38 [2019-03-28 12:45:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 86. 173.39/123.38 [2019-03-28 12:45:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. 173.39/123.38 [2019-03-28 12:45:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 191 transitions. 173.39/123.38 [2019-03-28 12:45:36,719 INFO L729 BuchiCegarLoop]: Abstraction has 86 states and 191 transitions. 173.39/123.38 [2019-03-28 12:45:36,719 INFO L609 BuchiCegarLoop]: Abstraction has 86 states and 191 transitions. 173.39/123.38 [2019-03-28 12:45:36,719 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 173.39/123.38 [2019-03-28 12:45:36,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 191 transitions. 173.39/123.38 [2019-03-28 12:45:36,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 173.39/123.38 [2019-03-28 12:45:36,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 173.39/123.38 [2019-03-28 12:45:36,720 INFO L119 BuchiIsEmpty]: Starting construction of run 173.39/123.38 [2019-03-28 12:45:36,721 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.38 [2019-03-28 12:45:36,721 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.38 [2019-03-28 12:45:36,722 INFO L794 eck$LassoCheckResult]: Stem: 7917#ULTIMATE.startENTRY [781] ULTIMATE.startENTRY-->L38: Formula: (and (= |v_#NULL.offset_2| 0) (= |v_#valid_123| (store |v_#valid_124| 0 0)) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_124|} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, #valid=|v_#valid_123|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet19, #NULL.base] 7918#L38 [511] L38-->L11: Formula: (let ((.cse1 (store |v_#valid_8| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1))) (and (= v_ULTIMATE.start_f_~z~0.base_1 |v_ULTIMATE.start_f_#t~malloc4.base_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~d_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~d_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~k~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc4.base_1|)) (= (select .cse1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc3.base_1|) 0) (= |v_ULTIMATE.start_f_#in~d_1| 1) (> |v_ULTIMATE.start_main_#t~nondet19_3| 0) (< |v_ULTIMATE.start_f_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc4.base_1|) (= v_ULTIMATE.start_f_~x~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= v_ULTIMATE.start_f_~y~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~k~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~d_1 |v_ULTIMATE.start_f_#in~d_1|) (= v_ULTIMATE.start_f_~y~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~x~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4) |v_ULTIMATE.start_f_#t~malloc4.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc4.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~z~0.offset_1 |v_ULTIMATE.start_f_#t~malloc4.offset_1|) (= (select .cse3 |v_ULTIMATE.start_f_#t~malloc2.base_1|) 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_f_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (> |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (> 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_3|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_1, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_#in~d=|v_ULTIMATE.start_f_#in~d_1|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_1, ULTIMATE.start_f_#t~malloc4.offset=|v_ULTIMATE.start_f_#t~malloc4.offset_1|, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_1, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_1, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_1, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_1, ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_1|, ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_1|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_1, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_1|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_1|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_1|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_f_#t~malloc4.base=|v_ULTIMATE.start_f_#t~malloc4.base_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_1, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_1, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_2|, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_f_~x~0.base, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_#in~d, ULTIMATE.start_f_~z~0.offset, ULTIMATE.start_f_#t~malloc4.offset, ULTIMATE.start_f_~d, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_~z~0.base, ULTIMATE.start_f_~d_ref~0.base, ULTIMATE.start_f_~k~0.offset, ULTIMATE.start_f_#t~nondet15, ULTIMATE.start_f_#t~nondet12, ULTIMATE.start_f_~x~0.offset, ULTIMATE.start_f_#t~mem16, ULTIMATE.start_f_#t~mem17, ULTIMATE.start_f_#t~mem18, ULTIMATE.start_f_#t~short11, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc4.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_~y~0.offset, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~k~0.base, ULTIMATE.start_f_~y~0.base, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base, ULTIMATE.start_f_~d_ref~0.offset] 7919#L11 [358] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~d_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~d_ref~0.base_3) v_ULTIMATE.start_f_~d_ref~0.offset_3 v_ULTIMATE.start_f_~d_3))) (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_f_~d_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_f_~d_ref~0.base_3))) InVars {#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_3, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_3, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_3} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_3, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_3, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 7911#L11-1 [351] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~x~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_f_~x~0.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_f_~x~0.base_3) 1) (<= 0 v_ULTIMATE.start_f_~x~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_f_~x~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~x~0.base_3) v_ULTIMATE.start_f_~x~0.offset_3 1)) |v_#memory_int_3|)) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_3, #length=|v_#length_9|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_3, #length=|v_#length_9|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 7912#L12 [276] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~y~0.offset_3) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~y~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~y~0.base_3) v_ULTIMATE.start_f_~y~0.offset_3 1))) (<= (+ v_ULTIMATE.start_f_~y~0.offset_3 4) (select |v_#length_11| v_ULTIMATE.start_f_~y~0.base_3)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_f_~y~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_3, #length=|v_#length_11|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_3, #valid=|v_#valid_13|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_3, #length=|v_#length_11|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_3, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#memory_int] 7930#L13 [401] L13-->L14: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_f_~k~0.base_3)) (<= 0 v_ULTIMATE.start_f_~k~0.offset_3) (<= (+ v_ULTIMATE.start_f_~k~0.offset_3 4) (select |v_#length_13| v_ULTIMATE.start_f_~k~0.base_3)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~k~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~k~0.base_3) v_ULTIMATE.start_f_~k~0.offset_3 1)))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_3, #length=|v_#length_13|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_3, #valid=|v_#valid_15|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_3, #length=|v_#length_13|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_3, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#memory_int] 7899#L14 [334] L14-->L15: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| v_ULTIMATE.start_f_~z~0.base_3 (store (select |v_#memory_int_10| v_ULTIMATE.start_f_~z~0.base_3) v_ULTIMATE.start_f_~z~0.offset_3 1))) (<= 0 v_ULTIMATE.start_f_~z~0.offset_3) (= 1 (select |v_#valid_17| v_ULTIMATE.start_f_~z~0.base_3)) (<= (+ v_ULTIMATE.start_f_~z~0.offset_3 4) (select |v_#length_15| v_ULTIMATE.start_f_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_15|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_3, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_3, #valid=|v_#valid_17|} OutVars{#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_3, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_3, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#memory_int] 7900#L15 [795] L15-->L21-3: Formula: (and (<= 0 v_ULTIMATE.start_f_~k~0.offset_17) (<= (select (select |v_#memory_int_83| v_ULTIMATE.start_f_~k~0.base_23) v_ULTIMATE.start_f_~k~0.offset_17) 1073741823) (= (select |v_#valid_139| v_ULTIMATE.start_f_~k~0.base_23) 1) (<= (+ v_ULTIMATE.start_f_~k~0.offset_17 4) (select |v_#length_107| v_ULTIMATE.start_f_~k~0.base_23))) InVars {#valid=|v_#valid_139|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_23, #memory_int=|v_#memory_int_83|, #length=|v_#length_107|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_17} OutVars{ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_13|, #valid=|v_#valid_139|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_23, #memory_int=|v_#memory_int_83|, #length=|v_#length_107|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 7903#L21-3 [389] L21-3-->L21: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_f_~z~0.base_6) v_ULTIMATE.start_f_~z~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_5) (= 1 (select |v_#valid_27| v_ULTIMATE.start_f_~z~0.base_6)) (<= (+ v_ULTIMATE.start_f_~z~0.offset_5 4) (select |v_#length_19| v_ULTIMATE.start_f_~z~0.base_6))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_6, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_5, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 7885#L21 [249] L21-->L21-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_f_~k~0.base_9)) (<= (+ v_ULTIMATE.start_f_~k~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_f_~k~0.base_9)) (<= 0 v_ULTIMATE.start_f_~k~0.offset_7) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~k~0.base_9) v_ULTIMATE.start_f_~k~0.offset_7))) InVars {ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_9, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_7, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_29|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_9, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 7886#L21-1 [450] L21-1-->L26-2: Formula: (>= |v_ULTIMATE.start_f_#t~mem6_4| |v_ULTIMATE.start_f_#t~mem7_4|) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_4|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7] 7924#L26-2 [267] L26-2-->L25: Formula: (and (= (select |v_#valid_35| v_ULTIMATE.start_f_~x~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~x~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_f_~x~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_f_~x~0.base_6) v_ULTIMATE.start_f_~x~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_5)) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, #length=|v_#length_27|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_2|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 7901#L25 [674] L25-->L25-1: Formula: (and |v_ULTIMATE.start_f_#t~short11_2| (< 0 |v_ULTIMATE.start_f_#t~mem9_3|)) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_2|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 7897#L25-1 [331] L25-1-->L25-2: Formula: |v_ULTIMATE.start_f_#t~short11_3| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_3|} AuxVars[] AssignedVars[] 7893#L25-2 [325] L25-2-->L25-3: Formula: (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_f_~y~0.base_6) v_ULTIMATE.start_f_~y~0.offset_5) |v_ULTIMATE.start_f_#t~mem10_2|) (<= 0 v_ULTIMATE.start_f_~y~0.offset_5) (= 1 (select |v_#valid_37| v_ULTIMATE.start_f_~y~0.base_6)) (<= (+ v_ULTIMATE.start_f_~y~0.offset_5 4) (select |v_#length_29| v_ULTIMATE.start_f_~y~0.base_6))) InVars {#memory_int=|v_#memory_int_18|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_6, #length=|v_#length_29|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_5, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_2|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_6, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10] 7889#L25-3 [702] L25-3-->L25-5: Formula: (and (< 0 |v_ULTIMATE.start_f_#t~mem10_3|) |v_ULTIMATE.start_f_#t~short11_4|) InVars {ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_4|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 7890#L25-5 [298] L25-5-->L26: Formula: |v_ULTIMATE.start_f_#t~short11_9| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_9|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_5|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_5|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_8|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~short11] 7904#L26 [703] L26-->L27: Formula: (< |v_ULTIMATE.start_f_#t~nondet12_3| 0) InVars {ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_3|} OutVars{ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_2|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~nondet12] 7905#L27 173.39/123.38 [2019-03-28 12:45:36,722 INFO L796 eck$LassoCheckResult]: Loop: 7905#L27 [368] L27-->L28: Formula: (and (= |v_ULTIMATE.start_f_#t~mem13_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_f_~x~0.base_9) v_ULTIMATE.start_f_~x~0.offset_7)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_f_~x~0.base_9)) (<= (+ v_ULTIMATE.start_f_~x~0.offset_7 4) (select |v_#length_31| v_ULTIMATE.start_f_~x~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_7)) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_9, #length=|v_#length_31|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_7, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_9, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_7, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_2|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem13] 7928#L28 [293] L28-->L28-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_f_~d_ref~0.base_6)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_f_~d_ref~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem14_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_f_~d_ref~0.base_6) v_ULTIMATE.start_f_~d_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_6, #valid=|v_#valid_41|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_5} OutVars{#valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_6, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_2|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem14] 7942#L28-1 [788] L28-1-->L29: Formula: (and (<= (+ v_ULTIMATE.start_f_~x~0.offset_21 4) (select |v_#length_100| v_ULTIMATE.start_f_~x~0.base_29)) (= (store |v_#memory_int_70| v_ULTIMATE.start_f_~x~0.base_29 (store (select |v_#memory_int_70| v_ULTIMATE.start_f_~x~0.base_29) v_ULTIMATE.start_f_~x~0.offset_21 (+ (* (- 1) |v_ULTIMATE.start_f_#t~mem14_10|) |v_ULTIMATE.start_f_#t~mem13_10|))) |v_#memory_int_69|) (<= 0 v_ULTIMATE.start_f_~x~0.offset_21) (= (select |v_#valid_132| v_ULTIMATE.start_f_~x~0.base_29) 1)) InVars {ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_29, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_21, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_70|, #length=|v_#length_100|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_10|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_10|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_29, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_21, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_69|, #length=|v_#length_100|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_9|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_9|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14] 7876#L29 [791] L29-->L30: Formula: (and (= 1 (select |v_#valid_135| v_ULTIMATE.start_f_~y~0.base_37)) (= (store |v_#memory_int_76| v_ULTIMATE.start_f_~y~0.base_37 (store (select |v_#memory_int_76| v_ULTIMATE.start_f_~y~0.base_37) v_ULTIMATE.start_f_~y~0.offset_27 |v_ULTIMATE.start_f_#t~nondet15_8|)) |v_#memory_int_75|) (<= 0 v_ULTIMATE.start_f_~y~0.offset_27) (<= (+ v_ULTIMATE.start_f_~y~0.offset_27 4) (select |v_#length_103| v_ULTIMATE.start_f_~y~0.base_37))) InVars {ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_8|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_27, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_76|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_37, #length=|v_#length_103|} OutVars{ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_7|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_27, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_75|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_37, #length=|v_#length_103|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~nondet15, #memory_int] 7877#L30 [348] L30-->L30-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~z~0.offset_11 4) (select |v_#length_39| v_ULTIMATE.start_f_~z~0.base_15)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_f_~z~0.base_15)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_11) (= |v_ULTIMATE.start_f_#t~mem16_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_f_~z~0.base_15) v_ULTIMATE.start_f_~z~0.offset_11))) InVars {#memory_int=|v_#memory_int_25|, #length=|v_#length_39|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_15, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_11, #valid=|v_#valid_47|} OutVars{ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_11, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_2|, #length=|v_#length_39|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem16] 7909#L30-1 [793] L30-1-->L26-2: Formula: (and (= |v_#memory_int_79| (store |v_#memory_int_80| v_ULTIMATE.start_f_~z~0.base_43 (store (select |v_#memory_int_80| v_ULTIMATE.start_f_~z~0.base_43) v_ULTIMATE.start_f_~z~0.offset_31 (+ |v_ULTIMATE.start_f_#t~mem16_10| (- 1))))) (= 1 (select |v_#valid_137| v_ULTIMATE.start_f_~z~0.base_43)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_31) (<= (+ v_ULTIMATE.start_f_~z~0.offset_31 4) (select |v_#length_105| v_ULTIMATE.start_f_~z~0.base_43))) InVars {ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_31, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_10|, #length=|v_#length_105|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_43} OutVars{ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_31, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_9|, #length=|v_#length_105|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_43} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_f_#t~mem16] 7910#L26-2 [267] L26-2-->L25: Formula: (and (= (select |v_#valid_35| v_ULTIMATE.start_f_~x~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~x~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_f_~x~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_f_~x~0.base_6) v_ULTIMATE.start_f_~x~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_5)) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, #length=|v_#length_27|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_2|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 7959#L25 [674] L25-->L25-1: Formula: (and |v_ULTIMATE.start_f_#t~short11_2| (< 0 |v_ULTIMATE.start_f_#t~mem9_3|)) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_2|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 7952#L25-1 [331] L25-1-->L25-2: Formula: |v_ULTIMATE.start_f_#t~short11_3| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_3|} AuxVars[] AssignedVars[] 7951#L25-2 [325] L25-2-->L25-3: Formula: (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_f_~y~0.base_6) v_ULTIMATE.start_f_~y~0.offset_5) |v_ULTIMATE.start_f_#t~mem10_2|) (<= 0 v_ULTIMATE.start_f_~y~0.offset_5) (= 1 (select |v_#valid_37| v_ULTIMATE.start_f_~y~0.base_6)) (<= (+ v_ULTIMATE.start_f_~y~0.offset_5 4) (select |v_#length_29| v_ULTIMATE.start_f_~y~0.base_6))) InVars {#memory_int=|v_#memory_int_18|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_6, #length=|v_#length_29|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_5, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_2|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_6, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10] 7950#L25-3 [702] L25-3-->L25-5: Formula: (and (< 0 |v_ULTIMATE.start_f_#t~mem10_3|) |v_ULTIMATE.start_f_#t~short11_4|) InVars {ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_4|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 7949#L25-5 [298] L25-5-->L26: Formula: |v_ULTIMATE.start_f_#t~short11_9| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_9|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_5|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_5|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_8|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~short11] 7948#L26 [704] L26-->L27: Formula: (> |v_ULTIMATE.start_f_#t~nondet12_3| 0) InVars {ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_3|} OutVars{ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_2|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~nondet12] 7905#L27 173.39/123.38 [2019-03-28 12:45:36,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.38 [2019-03-28 12:45:36,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1929916426, now seen corresponding path program 1 times 173.39/123.38 [2019-03-28 12:45:36,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.38 [2019-03-28 12:45:36,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.38 [2019-03-28 12:45:36,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:36,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:36,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:45:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:45:36,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.38 [2019-03-28 12:45:36,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1106264147, now seen corresponding path program 1 times 173.39/123.38 [2019-03-28 12:45:36,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.38 [2019-03-28 12:45:36,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.38 [2019-03-28 12:45:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:36,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:45:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:45:36,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.38 [2019-03-28 12:45:36,766 INFO L82 PathProgramCache]: Analyzing trace with hash -22960572, now seen corresponding path program 1 times 173.39/123.38 [2019-03-28 12:45:36,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.38 [2019-03-28 12:45:36,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.38 [2019-03-28 12:45:36,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:36,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:36,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.38 [2019-03-28 12:45:37,358 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 173.39/123.38 [2019-03-28 12:45:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.38 [2019-03-28 12:45:37,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 173.39/123.38 [2019-03-28 12:45:37,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 173.39/123.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 173.39/123.38 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 173.39/123.38 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 173.39/123.38 [2019-03-28 12:45:37,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:45:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.38 [2019-03-28 12:45:37,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 35 conjunts are in the unsatisfiable core 173.39/123.38 [2019-03-28 12:45:37,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... 173.39/123.38 [2019-03-28 12:45:37,859 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:37,863 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:37,866 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:37,887 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:37,888 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 173.39/123.38 [2019-03-28 12:45:37,889 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:37,914 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:37,914 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:37,914 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:43 173.39/123.38 [2019-03-28 12:45:37,966 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 173.39/123.38 [2019-03-28 12:45:37,966 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:37,991 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:37,992 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:37,992 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 173.39/123.38 [2019-03-28 12:45:38,047 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,048 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 173.39/123.38 [2019-03-28 12:45:38,048 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,073 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:38,074 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,074 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 173.39/123.38 [2019-03-28 12:45:38,133 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,134 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,135 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 173.39/123.38 [2019-03-28 12:45:38,135 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,163 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:38,164 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,164 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 173.39/123.38 [2019-03-28 12:45:38,235 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,236 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,237 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,239 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 173.39/123.38 [2019-03-28 12:45:38,239 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,272 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:38,273 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,273 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:68 173.39/123.38 [2019-03-28 12:45:38,345 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,346 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,347 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,348 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,350 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 173.39/123.38 [2019-03-28 12:45:38,351 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,385 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:38,386 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,386 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:79, output treesize:75 173.39/123.38 [2019-03-28 12:45:38,649 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,650 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,652 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,653 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,655 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 173.39/123.38 [2019-03-28 12:45:38,655 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,705 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:38,707 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,707 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:104, output treesize:81 173.39/123.38 [2019-03-28 12:45:38,799 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,801 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,802 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,803 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,805 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 173.39/123.38 [2019-03-28 12:45:38,806 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,843 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:38,844 INFO L427 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,845 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:92, output treesize:59 173.39/123.38 [2019-03-28 12:45:38,918 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,919 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,920 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:38,922 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 173.39/123.38 [2019-03-28 12:45:38,922 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,950 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:38,952 INFO L427 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:38,952 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:72, output treesize:41 173.39/123.38 [2019-03-28 12:45:39,023 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:39,025 INFO L189 IndexEqualityManager]: detected not equals via solver 173.39/123.38 [2019-03-28 12:45:39,026 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 173.39/123.38 [2019-03-28 12:45:39,026 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:39,036 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:45:39,037 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:45:39,037 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:48, output treesize:3 173.39/123.38 [2019-03-28 12:45:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.38 [2019-03-28 12:45:39,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 173.39/123.38 [2019-03-28 12:45:39,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 173.39/123.38 [2019-03-28 12:45:39,196 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 173.39/123.38 [2019-03-28 12:45:39,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. 173.39/123.38 [2019-03-28 12:45:39,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 173.39/123.38 [2019-03-28 12:45:39,264 INFO L87 Difference]: Start difference. First operand 86 states and 191 transitions. cyclomatic complexity: 109 Second operand 25 states. 173.39/123.38 [2019-03-28 12:45:42,429 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 173.39/123.38 [2019-03-28 12:45:42,654 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 173.39/123.38 [2019-03-28 12:45:42,821 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 40 173.39/123.38 [2019-03-28 12:45:43,218 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 173.39/123.38 [2019-03-28 12:45:43,665 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 173.39/123.38 [2019-03-28 12:45:43,962 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 173.39/123.38 [2019-03-28 12:45:44,180 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 173.39/123.38 [2019-03-28 12:45:45,140 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 173.39/123.38 [2019-03-28 12:45:45,375 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 173.39/123.38 [2019-03-28 12:45:45,746 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 173.39/123.38 [2019-03-28 12:45:45,994 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 173.39/123.38 [2019-03-28 12:45:46,328 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 173.39/123.38 [2019-03-28 12:45:46,558 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 173.39/123.38 [2019-03-28 12:45:47,024 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 173.39/123.38 [2019-03-28 12:45:47,552 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 173.39/123.38 [2019-03-28 12:45:47,957 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 173.39/123.38 [2019-03-28 12:45:48,207 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 173.39/123.38 [2019-03-28 12:45:48,555 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 42 173.39/123.38 [2019-03-28 12:45:48,753 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 173.39/123.38 [2019-03-28 12:45:48,930 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 38 173.39/123.38 [2019-03-28 12:46:00,480 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 40 173.39/123.38 [2019-03-28 12:46:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.39/123.38 [2019-03-28 12:46:00,532 INFO L93 Difference]: Finished difference Result 237 states and 349 transitions. 173.39/123.38 [2019-03-28 12:46:00,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 173.39/123.38 [2019-03-28 12:46:00,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 237 states and 349 transitions. 173.39/123.38 [2019-03-28 12:46:00,565 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 48 173.39/123.38 [2019-03-28 12:46:00,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 237 states to 152 states and 258 transitions. 173.39/123.38 [2019-03-28 12:46:00,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 173.39/123.38 [2019-03-28 12:46:00,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 173.39/123.38 [2019-03-28 12:46:00,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 258 transitions. 173.39/123.38 [2019-03-28 12:46:00,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 173.39/123.38 [2019-03-28 12:46:00,567 INFO L706 BuchiCegarLoop]: Abstraction has 152 states and 258 transitions. 173.39/123.38 [2019-03-28 12:46:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 258 transitions. 173.39/123.38 [2019-03-28 12:46:00,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 96. 173.39/123.38 [2019-03-28 12:46:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. 173.39/123.38 [2019-03-28 12:46:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 198 transitions. 173.39/123.38 [2019-03-28 12:46:00,570 INFO L729 BuchiCegarLoop]: Abstraction has 96 states and 198 transitions. 173.39/123.38 [2019-03-28 12:46:00,570 INFO L609 BuchiCegarLoop]: Abstraction has 96 states and 198 transitions. 173.39/123.38 [2019-03-28 12:46:00,571 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 173.39/123.38 [2019-03-28 12:46:00,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 198 transitions. 173.39/123.38 [2019-03-28 12:46:00,571 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 173.39/123.38 [2019-03-28 12:46:00,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 173.39/123.38 [2019-03-28 12:46:00,572 INFO L119 BuchiIsEmpty]: Starting construction of run 173.39/123.38 [2019-03-28 12:46:00,572 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.38 [2019-03-28 12:46:00,572 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.38 [2019-03-28 12:46:00,573 INFO L794 eck$LassoCheckResult]: Stem: 8432#ULTIMATE.startENTRY [781] ULTIMATE.startENTRY-->L38: Formula: (and (= |v_#NULL.offset_2| 0) (= |v_#valid_123| (store |v_#valid_124| 0 0)) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_124|} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, #valid=|v_#valid_123|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet19, #NULL.base] 8433#L38 [575] L38-->L11-2: Formula: (let ((.cse3 (store |v_#valid_68| |v_ULTIMATE.start_f_#t~malloc0.base_7| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_f_#t~malloc1.base_7| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_f_#t~malloc2.base_7| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_f_#t~malloc3.base_7| 1))) (and (> |v_ULTIMATE.start_f_#t~malloc3.base_7| 0) (= |v_ULTIMATE.start_f_#in~d_2| 2) (= v_ULTIMATE.start_f_~x~0.base_15 |v_ULTIMATE.start_f_#t~malloc1.base_7|) (= 0 (select |v_#valid_68| |v_ULTIMATE.start_f_#t~malloc0.base_7|)) (> |v_ULTIMATE.start_f_#t~malloc0.base_7| 0) (= |v_ULTIMATE.start_main_#t~nondet19_5| 0) (< |v_ULTIMATE.start_f_#t~malloc0.base_7| |v_#StackHeapBarrier_2|) (= v_ULTIMATE.start_f_~k~0.offset_9 |v_ULTIMATE.start_f_#t~malloc3.offset_7|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc3.base_7|)) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_7|) (= v_ULTIMATE.start_f_~d_ref~0.base_12 |v_ULTIMATE.start_f_#t~malloc0.base_7|) (= v_ULTIMATE.start_f_~d_ref~0.offset_9 |v_ULTIMATE.start_f_#t~malloc0.offset_7|) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_7|) (= v_ULTIMATE.start_f_~z~0.offset_15 |v_ULTIMATE.start_f_#t~malloc4.offset_7|) (= (select .cse1 |v_ULTIMATE.start_f_#t~malloc2.base_7|) 0) (< 0 |v_ULTIMATE.start_f_#t~malloc4.base_7|) (= v_ULTIMATE.start_f_~y~0.base_18 |v_ULTIMATE.start_f_#t~malloc2.base_7|) (< |v_ULTIMATE.start_f_#t~malloc1.base_7| |v_#StackHeapBarrier_2|) (= |v_#length_49| (store (store (store (store (store |v_#length_54| |v_ULTIMATE.start_f_#t~malloc0.base_7| 4) |v_ULTIMATE.start_f_#t~malloc1.base_7| 4) |v_ULTIMATE.start_f_#t~malloc2.base_7| 4) |v_ULTIMATE.start_f_#t~malloc3.base_7| 4) |v_ULTIMATE.start_f_#t~malloc4.base_7| 4)) (= (store .cse2 |v_ULTIMATE.start_f_#t~malloc4.base_7| 1) |v_#valid_63|) (= v_ULTIMATE.start_f_~x~0.offset_11 |v_ULTIMATE.start_f_#t~malloc1.offset_7|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_7|) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc4.base_7|) 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_7| |v_#StackHeapBarrier_2|) (< |v_ULTIMATE.start_f_#t~malloc3.base_7| |v_#StackHeapBarrier_2|) (< |v_ULTIMATE.start_f_#t~malloc4.base_7| |v_#StackHeapBarrier_2|) (= 0 |v_ULTIMATE.start_f_#t~malloc4.offset_7|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_7| 0) (= v_ULTIMATE.start_f_~k~0.base_12 |v_ULTIMATE.start_f_#t~malloc3.base_7|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_7| 0) (= (select .cse3 |v_ULTIMATE.start_f_#t~malloc1.base_7|) 0) (= v_ULTIMATE.start_f_~d_4 |v_ULTIMATE.start_f_#in~d_2|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_7| 0) (= v_ULTIMATE.start_f_~z~0.base_21 |v_ULTIMATE.start_f_#t~malloc4.base_7|) (= v_ULTIMATE.start_f_~y~0.offset_13 |v_ULTIMATE.start_f_#t~malloc2.offset_7|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_54|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_5|, #valid=|v_#valid_68|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_15, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_7|, ULTIMATE.start_f_#in~d=|v_ULTIMATE.start_f_#in~d_2|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_15, ULTIMATE.start_f_#t~malloc4.offset=|v_ULTIMATE.start_f_#t~malloc4.offset_7|, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_4, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_7|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_7|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_5|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_6|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_7|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_7|, #length=|v_#length_49|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_21, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_12, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_9, ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_4|, ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_6|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_11, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_5|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_5|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_5|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_10|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_5|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_5|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_7|, ULTIMATE.start_f_#t~malloc4.base=|v_ULTIMATE.start_f_#t~malloc4.base_7|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_7|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_7|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_6|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_13, #valid=|v_#valid_63|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_7|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_12, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_18, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_4|, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_7|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_7|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_f_~x~0.base, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_#in~d, ULTIMATE.start_f_~z~0.offset, ULTIMATE.start_f_#t~malloc4.offset, ULTIMATE.start_f_~d, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_~z~0.base, ULTIMATE.start_f_~d_ref~0.base, ULTIMATE.start_f_~k~0.offset, ULTIMATE.start_f_#t~nondet15, ULTIMATE.start_f_#t~nondet12, ULTIMATE.start_f_~x~0.offset, ULTIMATE.start_f_#t~mem16, ULTIMATE.start_f_#t~mem17, ULTIMATE.start_f_#t~mem18, ULTIMATE.start_f_#t~short11, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc4.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_~y~0.offset, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~k~0.base, ULTIMATE.start_f_~y~0.base, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base, ULTIMATE.start_f_~d_ref~0.offset] 8395#L11-2 [320] L11-2-->L11-3: Formula: (and (= 1 (select |v_#valid_69| v_ULTIMATE.start_f_~d_ref~0.base_14)) (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_11 4) (select |v_#length_55| v_ULTIMATE.start_f_~d_ref~0.base_14)) (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_11) (= (store |v_#memory_int_33| v_ULTIMATE.start_f_~d_ref~0.base_14 (store (select |v_#memory_int_33| v_ULTIMATE.start_f_~d_ref~0.base_14) v_ULTIMATE.start_f_~d_ref~0.offset_11 v_ULTIMATE.start_f_~d_6)) |v_#memory_int_32|)) InVars {#valid=|v_#valid_69|, #memory_int=|v_#memory_int_33|, #length=|v_#length_55|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_14, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_6, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_11} OutVars{#valid=|v_#valid_69|, #memory_int=|v_#memory_int_32|, #length=|v_#length_55|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_14, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_6, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int] 8393#L11-3 [314] L11-3-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~x~0.offset_13 4) (select |v_#length_57| v_ULTIMATE.start_f_~x~0.base_17)) (= (store |v_#memory_int_35| v_ULTIMATE.start_f_~x~0.base_17 (store (select |v_#memory_int_35| v_ULTIMATE.start_f_~x~0.base_17) v_ULTIMATE.start_f_~x~0.offset_13 1)) |v_#memory_int_34|) (<= 0 v_ULTIMATE.start_f_~x~0.offset_13) (= (select |v_#valid_71| v_ULTIMATE.start_f_~x~0.base_17) 1)) InVars {#memory_int=|v_#memory_int_35|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_17, #length=|v_#length_57|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_13, #valid=|v_#valid_71|} OutVars{#memory_int=|v_#memory_int_34|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_17, #length=|v_#length_57|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_13, #valid=|v_#valid_71|} AuxVars[] AssignedVars[#memory_int] 8394#L12-1 [273] L12-1-->L13-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~y~0.offset_15 4) (select |v_#length_59| v_ULTIMATE.start_f_~y~0.base_20)) (<= 0 v_ULTIMATE.start_f_~y~0.offset_15) (= (select |v_#valid_73| v_ULTIMATE.start_f_~y~0.base_20) 1) (= |v_#memory_int_36| (store |v_#memory_int_37| v_ULTIMATE.start_f_~y~0.base_20 (store (select |v_#memory_int_37| v_ULTIMATE.start_f_~y~0.base_20) v_ULTIMATE.start_f_~y~0.offset_15 1)))) InVars {#memory_int=|v_#memory_int_37|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_20, #length=|v_#length_59|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_15, #valid=|v_#valid_73|} OutVars{#memory_int=|v_#memory_int_36|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_20, #length=|v_#length_59|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_15, #valid=|v_#valid_73|} AuxVars[] AssignedVars[#memory_int] 8445#L13-1 [398] L13-1-->L14-1: Formula: (and (= (select |v_#valid_75| v_ULTIMATE.start_f_~k~0.base_14) 1) (<= 0 v_ULTIMATE.start_f_~k~0.offset_11) (<= (+ v_ULTIMATE.start_f_~k~0.offset_11 4) (select |v_#length_61| v_ULTIMATE.start_f_~k~0.base_14)) (= |v_#memory_int_38| (store |v_#memory_int_39| v_ULTIMATE.start_f_~k~0.base_14 (store (select |v_#memory_int_39| v_ULTIMATE.start_f_~k~0.base_14) v_ULTIMATE.start_f_~k~0.offset_11 1)))) InVars {#memory_int=|v_#memory_int_39|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_14, #length=|v_#length_61|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_11, #valid=|v_#valid_75|} OutVars{#memory_int=|v_#memory_int_38|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_14, #length=|v_#length_61|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_11, #valid=|v_#valid_75|} AuxVars[] AssignedVars[#memory_int] 8410#L14-1 [328] L14-1-->L15-1: Formula: (and (= |v_#memory_int_40| (store |v_#memory_int_41| v_ULTIMATE.start_f_~z~0.base_23 (store (select |v_#memory_int_41| v_ULTIMATE.start_f_~z~0.base_23) v_ULTIMATE.start_f_~z~0.offset_17 1))) (<= (+ v_ULTIMATE.start_f_~z~0.offset_17 4) (select |v_#length_63| v_ULTIMATE.start_f_~z~0.base_23)) (= (select |v_#valid_77| v_ULTIMATE.start_f_~z~0.base_23) 1) (<= 0 v_ULTIMATE.start_f_~z~0.offset_17)) InVars {#memory_int=|v_#memory_int_41|, #length=|v_#length_63|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_23, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_17, #valid=|v_#valid_77|} OutVars{#memory_int=|v_#memory_int_40|, #length=|v_#length_63|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_23, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_17, #valid=|v_#valid_77|} AuxVars[] AssignedVars[#memory_int] 8411#L15-1 [796] L15-1-->L21-7: Formula: (and (<= 0 v_ULTIMATE.start_f_~k~0.offset_18) (= (select |v_#valid_140| v_ULTIMATE.start_f_~k~0.base_24) 1) (<= (select (select |v_#memory_int_84| v_ULTIMATE.start_f_~k~0.base_24) v_ULTIMATE.start_f_~k~0.offset_18) 1073741823) (<= (+ v_ULTIMATE.start_f_~k~0.offset_18 4) (select |v_#length_108| v_ULTIMATE.start_f_~k~0.base_24))) InVars {#valid=|v_#valid_140|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_24, #memory_int=|v_#memory_int_84|, #length=|v_#length_108|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_18} OutVars{ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_15|, #valid=|v_#valid_140|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_24, #memory_int=|v_#memory_int_84|, #length=|v_#length_108|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_18} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 8441#L21-7 [405] L21-7-->L21-4: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_8| (select (select |v_#memory_int_43| v_ULTIMATE.start_f_~z~0.base_26) v_ULTIMATE.start_f_~z~0.offset_19)) (= 1 (select |v_#valid_87| v_ULTIMATE.start_f_~z~0.base_26)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_19) (<= (+ v_ULTIMATE.start_f_~z~0.offset_19 4) (select |v_#length_67| v_ULTIMATE.start_f_~z~0.base_26))) InVars {#memory_int=|v_#memory_int_43|, #length=|v_#length_67|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_26, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_19, #valid=|v_#valid_87|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_8|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_19, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_43|, #length=|v_#length_67|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 8459#L21-4 [382] L21-4-->L21-5: Formula: (and (<= 0 v_ULTIMATE.start_f_~k~0.offset_15) (= 1 (select |v_#valid_89| v_ULTIMATE.start_f_~k~0.base_20)) (<= (+ v_ULTIMATE.start_f_~k~0.offset_15 4) (select |v_#length_69| v_ULTIMATE.start_f_~k~0.base_20)) (= |v_ULTIMATE.start_f_#t~mem7_8| (select (select |v_#memory_int_44| v_ULTIMATE.start_f_~k~0.base_20) v_ULTIMATE.start_f_~k~0.offset_15))) InVars {ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_20, #memory_int=|v_#memory_int_44|, #length=|v_#length_69|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_15, #valid=|v_#valid_89|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_8|, #valid=|v_#valid_89|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_20, #memory_int=|v_#memory_int_44|, #length=|v_#length_69|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_15} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 8460#L21-5 [452] L21-5-->L26-5: Formula: (>= |v_ULTIMATE.start_f_#t~mem6_10| |v_ULTIMATE.start_f_#t~mem7_10|) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_10|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_10|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_9|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_9|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7] 8477#L26-5 [261] L26-5-->L25-8: Formula: (and (<= (+ v_ULTIMATE.start_f_~x~0.offset_15 4) (select |v_#length_75| v_ULTIMATE.start_f_~x~0.base_20)) (= 1 (select |v_#valid_95| v_ULTIMATE.start_f_~x~0.base_20)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_15) (= |v_ULTIMATE.start_f_#t~mem9_7| (select (select |v_#memory_int_48| v_ULTIMATE.start_f_~x~0.base_20) v_ULTIMATE.start_f_~x~0.offset_15))) InVars {#memory_int=|v_#memory_int_48|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_20, #length=|v_#length_75|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_15, #valid=|v_#valid_95|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_20, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_7|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_15, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_48|, #length=|v_#length_75|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 8431#L25-8 [675] L25-8-->L25-9: Formula: (and |v_ULTIMATE.start_f_#t~short11_11| (< 0 |v_ULTIMATE.start_f_#t~mem9_8|)) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_8|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_11|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_8|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 8453#L25-9 [285] L25-9-->L25-10: Formula: |v_ULTIMATE.start_f_#t~short11_12| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_12|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_12|} AuxVars[] AssignedVars[] 8447#L25-10 [279] L25-10-->L25-11: Formula: (and (= (select |v_#valid_97| v_ULTIMATE.start_f_~y~0.base_23) 1) (<= (+ v_ULTIMATE.start_f_~y~0.offset_17 4) (select |v_#length_77| v_ULTIMATE.start_f_~y~0.base_23)) (<= 0 v_ULTIMATE.start_f_~y~0.offset_17) (= |v_ULTIMATE.start_f_#t~mem10_7| (select (select |v_#memory_int_49| v_ULTIMATE.start_f_~y~0.base_23) v_ULTIMATE.start_f_~y~0.offset_17))) InVars {#memory_int=|v_#memory_int_49|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_23, #length=|v_#length_77|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_17, #valid=|v_#valid_97|} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_7|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_17, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_49|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_23, #length=|v_#length_77|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10] 8448#L25-11 [705] L25-11-->L25-13: Formula: (and (< 0 |v_ULTIMATE.start_f_#t~mem10_8|) |v_ULTIMATE.start_f_#t~short11_13|) InVars {ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_8|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_13|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_8|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 8462#L25-13 [301] L25-13-->L26-3: Formula: |v_ULTIMATE.start_f_#t~short11_18| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_18|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_10|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_10|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_17|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~short11] 8435#L26-3 [708] L26-3-->L27-1: Formula: (< |v_ULTIMATE.start_f_#t~nondet12_8| 0) InVars {ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_8|} OutVars{ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_7|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~nondet12] 8436#L27-1 173.39/123.38 [2019-03-28 12:46:00,574 INFO L796 eck$LassoCheckResult]: Loop: 8436#L27-1 [365] L27-1-->L28-3: Formula: (and (<= (+ v_ULTIMATE.start_f_~x~0.offset_17 4) (select |v_#length_79| v_ULTIMATE.start_f_~x~0.base_23)) (= |v_ULTIMATE.start_f_#t~mem13_6| (select (select |v_#memory_int_50| v_ULTIMATE.start_f_~x~0.base_23) v_ULTIMATE.start_f_~x~0.offset_17)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_17) (= 1 (select |v_#valid_99| v_ULTIMATE.start_f_~x~0.base_23))) InVars {#memory_int=|v_#memory_int_50|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_23, #length=|v_#length_79|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_17, #valid=|v_#valid_99|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_23, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_17, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_50|, #length=|v_#length_79|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_6|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem13] 8442#L28-3 [307] L28-3-->L28-4: Formula: (and (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_13) (= |v_ULTIMATE.start_f_#t~mem14_6| (select (select |v_#memory_int_51| v_ULTIMATE.start_f_~d_ref~0.base_17) v_ULTIMATE.start_f_~d_ref~0.offset_13)) (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_13 4) (select |v_#length_81| v_ULTIMATE.start_f_~d_ref~0.base_17)) (= 1 (select |v_#valid_101| v_ULTIMATE.start_f_~d_ref~0.base_17))) InVars {#memory_int=|v_#memory_int_51|, #length=|v_#length_81|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_17, #valid=|v_#valid_101|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_13} OutVars{#valid=|v_#valid_101|, #memory_int=|v_#memory_int_51|, #length=|v_#length_81|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_17, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_6|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem14] 8464#L28-4 [790] L28-4-->L29-2: Formula: (and (= (select |v_#valid_134| v_ULTIMATE.start_f_~x~0.base_30) 1) (= (store |v_#memory_int_74| v_ULTIMATE.start_f_~x~0.base_30 (store (select |v_#memory_int_74| v_ULTIMATE.start_f_~x~0.base_30) v_ULTIMATE.start_f_~x~0.offset_22 (+ (* (- 1) |v_ULTIMATE.start_f_#t~mem14_12|) |v_ULTIMATE.start_f_#t~mem13_12|))) |v_#memory_int_73|) (<= (+ v_ULTIMATE.start_f_~x~0.offset_22 4) (select |v_#length_102| v_ULTIMATE.start_f_~x~0.base_30)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_22)) InVars {ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_30, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_22, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_74|, #length=|v_#length_102|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_12|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_12|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_30, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_22, #valid=|v_#valid_134|, #memory_int=|v_#memory_int_73|, #length=|v_#length_102|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_11|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14] 8389#L29-2 [792] L29-2-->L30-3: Formula: (and (= (store |v_#memory_int_78| v_ULTIMATE.start_f_~y~0.base_38 (store (select |v_#memory_int_78| v_ULTIMATE.start_f_~y~0.base_38) v_ULTIMATE.start_f_~y~0.offset_28 |v_ULTIMATE.start_f_#t~nondet15_10|)) |v_#memory_int_77|) (= 1 (select |v_#valid_136| v_ULTIMATE.start_f_~y~0.base_38)) (<= (+ v_ULTIMATE.start_f_~y~0.offset_28 4) (select |v_#length_104| v_ULTIMATE.start_f_~y~0.base_38)) (<= 0 v_ULTIMATE.start_f_~y~0.offset_28)) InVars {ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_10|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_28, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_38, #length=|v_#length_104|} OutVars{ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_9|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_28, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_77|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_38, #length=|v_#length_104|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~nondet15, #memory_int] 8390#L30-3 [341] L30-3-->L30-4: Formula: (and (<= (+ v_ULTIMATE.start_f_~z~0.offset_25 4) (select |v_#length_87| v_ULTIMATE.start_f_~z~0.base_35)) (= (select |v_#valid_107| v_ULTIMATE.start_f_~z~0.base_35) 1) (<= 0 v_ULTIMATE.start_f_~z~0.offset_25) (= |v_ULTIMATE.start_f_#t~mem16_6| (select (select |v_#memory_int_56| v_ULTIMATE.start_f_~z~0.base_35) v_ULTIMATE.start_f_~z~0.offset_25))) InVars {#memory_int=|v_#memory_int_56|, #length=|v_#length_87|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_35, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_25, #valid=|v_#valid_107|} OutVars{ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_25, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_56|, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_6|, #length=|v_#length_87|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_35} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem16] 8422#L30-4 [794] L30-4-->L26-5: Formula: (and (<= 0 v_ULTIMATE.start_f_~z~0.offset_32) (= (store |v_#memory_int_82| v_ULTIMATE.start_f_~z~0.base_44 (store (select |v_#memory_int_82| v_ULTIMATE.start_f_~z~0.base_44) v_ULTIMATE.start_f_~z~0.offset_32 (+ |v_ULTIMATE.start_f_#t~mem16_12| (- 1)))) |v_#memory_int_81|) (= (select |v_#valid_138| v_ULTIMATE.start_f_~z~0.base_44) 1) (<= (+ v_ULTIMATE.start_f_~z~0.offset_32 4) (select |v_#length_106| v_ULTIMATE.start_f_~z~0.base_44))) InVars {ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_32, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_82|, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_12|, #length=|v_#length_106|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_44} OutVars{ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_32, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_11|, #length=|v_#length_106|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_44} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_f_#t~mem16] 8423#L26-5 [261] L26-5-->L25-8: Formula: (and (<= (+ v_ULTIMATE.start_f_~x~0.offset_15 4) (select |v_#length_75| v_ULTIMATE.start_f_~x~0.base_20)) (= 1 (select |v_#valid_95| v_ULTIMATE.start_f_~x~0.base_20)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_15) (= |v_ULTIMATE.start_f_#t~mem9_7| (select (select |v_#memory_int_48| v_ULTIMATE.start_f_~x~0.base_20) v_ULTIMATE.start_f_~x~0.offset_15))) InVars {#memory_int=|v_#memory_int_48|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_20, #length=|v_#length_75|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_15, #valid=|v_#valid_95|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_20, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_7|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_15, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_48|, #length=|v_#length_75|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 8476#L25-8 [675] L25-8-->L25-9: Formula: (and |v_ULTIMATE.start_f_#t~short11_11| (< 0 |v_ULTIMATE.start_f_#t~mem9_8|)) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_8|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_11|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_8|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 8475#L25-9 [285] L25-9-->L25-10: Formula: |v_ULTIMATE.start_f_#t~short11_12| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_12|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_12|} AuxVars[] AssignedVars[] 8474#L25-10 [279] L25-10-->L25-11: Formula: (and (= (select |v_#valid_97| v_ULTIMATE.start_f_~y~0.base_23) 1) (<= (+ v_ULTIMATE.start_f_~y~0.offset_17 4) (select |v_#length_77| v_ULTIMATE.start_f_~y~0.base_23)) (<= 0 v_ULTIMATE.start_f_~y~0.offset_17) (= |v_ULTIMATE.start_f_#t~mem10_7| (select (select |v_#memory_int_49| v_ULTIMATE.start_f_~y~0.base_23) v_ULTIMATE.start_f_~y~0.offset_17))) InVars {#memory_int=|v_#memory_int_49|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_23, #length=|v_#length_77|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_17, #valid=|v_#valid_97|} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_7|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_17, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_49|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_23, #length=|v_#length_77|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10] 8473#L25-11 [705] L25-11-->L25-13: Formula: (and (< 0 |v_ULTIMATE.start_f_#t~mem10_8|) |v_ULTIMATE.start_f_#t~short11_13|) InVars {ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_8|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_13|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_8|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 8472#L25-13 [301] L25-13-->L26-3: Formula: |v_ULTIMATE.start_f_#t~short11_18| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_18|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_10|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_10|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_17|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~short11] 8471#L26-3 [707] L26-3-->L27-1: Formula: (> |v_ULTIMATE.start_f_#t~nondet12_8| 0) InVars {ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_8|} OutVars{ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_7|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~nondet12] 8436#L27-1 173.39/123.38 [2019-03-28 12:46:00,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.38 [2019-03-28 12:46:00,574 INFO L82 PathProgramCache]: Analyzing trace with hash -128696925, now seen corresponding path program 1 times 173.39/123.38 [2019-03-28 12:46:00,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.38 [2019-03-28 12:46:00,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.38 [2019-03-28 12:46:00,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:00,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:00,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:46:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:46:00,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.38 [2019-03-28 12:46:00,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1744498607, now seen corresponding path program 1 times 173.39/123.38 [2019-03-28 12:46:00,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.38 [2019-03-28 12:46:00,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.38 [2019-03-28 12:46:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:00,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:46:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:46:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.38 [2019-03-28 12:46:00,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1886025233, now seen corresponding path program 1 times 173.39/123.38 [2019-03-28 12:46:00,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.38 [2019-03-28 12:46:00,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.38 [2019-03-28 12:46:00,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:00,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:00,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.38 [2019-03-28 12:46:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.38 [2019-03-28 12:46:01,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 173.39/123.38 [2019-03-28 12:46:01,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 173.39/123.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 173.39/123.38 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 173.39/123.38 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 173.39/123.38 [2019-03-28 12:46:01,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.38 [2019-03-28 12:46:01,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 32 conjunts are in the unsatisfiable core 173.39/123.38 [2019-03-28 12:46:01,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... 173.39/123.38 [2019-03-28 12:46:01,713 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:01,713 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 101 173.39/123.38 [2019-03-28 12:46:01,714 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:01,730 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:01,731 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:01,731 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:44 173.39/123.38 [2019-03-28 12:46:01,775 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 173.39/123.38 [2019-03-28 12:46:01,775 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:01,794 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:01,794 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:01,795 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 173.39/123.38 [2019-03-28 12:46:01,840 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 173.39/123.38 [2019-03-28 12:46:01,840 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:01,860 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:01,861 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:01,861 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 173.39/123.38 [2019-03-28 12:46:01,912 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 173.39/123.38 [2019-03-28 12:46:01,912 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:01,936 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:01,937 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:01,937 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:62 173.39/123.38 [2019-03-28 12:46:01,995 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 173.39/123.38 [2019-03-28 12:46:01,995 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:02,021 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:02,022 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:02,022 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:69 173.39/123.38 [2019-03-28 12:46:02,086 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 173.39/123.38 [2019-03-28 12:46:02,087 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:02,114 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:02,115 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:02,115 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 173.39/123.38 [2019-03-28 12:46:02,340 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 173.39/123.38 [2019-03-28 12:46:02,341 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:02,386 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:02,387 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:02,388 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:105, output treesize:82 173.39/123.38 [2019-03-28 12:46:02,464 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 173.39/123.38 [2019-03-28 12:46:02,464 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:02,493 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:02,494 INFO L427 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:02,495 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:93, output treesize:59 173.39/123.38 [2019-03-28 12:46:02,562 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 173.39/123.38 [2019-03-28 12:46:02,563 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:02,586 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:02,587 INFO L427 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:02,588 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:72, output treesize:40 173.39/123.38 [2019-03-28 12:46:02,653 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 173.39/123.38 [2019-03-28 12:46:02,654 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:02,660 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:02,660 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:02,660 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:47, output treesize:5 173.39/123.38 [2019-03-28 12:46:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.38 [2019-03-28 12:46:02,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 173.39/123.38 [2019-03-28 12:46:02,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 173.39/123.38 [2019-03-28 12:46:02,844 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 83 173.39/123.38 [2019-03-28 12:46:02,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. 173.39/123.38 [2019-03-28 12:46:02,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 173.39/123.38 [2019-03-28 12:46:02,919 INFO L87 Difference]: Start difference. First operand 96 states and 198 transitions. cyclomatic complexity: 106 Second operand 28 states. 173.39/123.38 [2019-03-28 12:46:06,599 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 173.39/123.38 [2019-03-28 12:46:06,782 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 173.39/123.38 [2019-03-28 12:46:07,089 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 58 173.39/123.38 [2019-03-28 12:46:07,406 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 173.39/123.38 [2019-03-28 12:46:07,637 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 65 173.39/123.38 [2019-03-28 12:46:07,829 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 173.39/123.38 [2019-03-28 12:46:08,112 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 173.39/123.38 [2019-03-28 12:46:08,429 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 173.39/123.38 [2019-03-28 12:46:08,762 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 173.39/123.38 [2019-03-28 12:46:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.39/123.38 [2019-03-28 12:46:09,076 INFO L93 Difference]: Finished difference Result 111 states and 210 transitions. 173.39/123.38 [2019-03-28 12:46:09,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 173.39/123.38 [2019-03-28 12:46:09,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 210 transitions. 173.39/123.38 [2019-03-28 12:46:09,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 173.39/123.38 [2019-03-28 12:46:09,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 44 states and 109 transitions. 173.39/123.38 [2019-03-28 12:46:09,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 173.39/123.38 [2019-03-28 12:46:09,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 173.39/123.38 [2019-03-28 12:46:09,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 109 transitions. 173.39/123.38 [2019-03-28 12:46:09,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 173.39/123.38 [2019-03-28 12:46:09,110 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 109 transitions. 173.39/123.38 [2019-03-28 12:46:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 109 transitions. 173.39/123.38 [2019-03-28 12:46:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. 173.39/123.38 [2019-03-28 12:46:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 173.39/123.38 [2019-03-28 12:46:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 109 transitions. 173.39/123.38 [2019-03-28 12:46:09,112 INFO L729 BuchiCegarLoop]: Abstraction has 44 states and 109 transitions. 173.39/123.38 [2019-03-28 12:46:09,112 INFO L609 BuchiCegarLoop]: Abstraction has 44 states and 109 transitions. 173.39/123.38 [2019-03-28 12:46:09,112 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 173.39/123.38 [2019-03-28 12:46:09,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 109 transitions. 173.39/123.38 [2019-03-28 12:46:09,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 173.39/123.38 [2019-03-28 12:46:09,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 173.39/123.38 [2019-03-28 12:46:09,113 INFO L119 BuchiIsEmpty]: Starting construction of run 173.39/123.38 [2019-03-28 12:46:09,114 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.38 [2019-03-28 12:46:09,114 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 173.39/123.38 [2019-03-28 12:46:09,115 INFO L794 eck$LassoCheckResult]: Stem: 8792#ULTIMATE.startENTRY [781] ULTIMATE.startENTRY-->L38: Formula: (and (= |v_#NULL.offset_2| 0) (= |v_#valid_123| (store |v_#valid_124| 0 0)) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_124|} OutVars{ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, #valid=|v_#valid_123|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet19, #NULL.base] 8757#L38 [510] L38-->L11: Formula: (let ((.cse1 (store |v_#valid_8| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1))) (and (= v_ULTIMATE.start_f_~z~0.base_1 |v_ULTIMATE.start_f_#t~malloc4.base_1|) (= |v_ULTIMATE.start_f_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_f_~d_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~d_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_f_~k~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc4.base_1|)) (= (select .cse1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) 0) (< |v_ULTIMATE.start_f_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= (select .cse2 |v_ULTIMATE.start_f_#t~malloc3.base_1|) 0) (= |v_ULTIMATE.start_f_#in~d_1| 1) (< |v_ULTIMATE.start_f_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~x~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= v_ULTIMATE.start_f_~y~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (= v_ULTIMATE.start_f_~k~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~d_1 |v_ULTIMATE.start_f_#in~d_1|) (= v_ULTIMATE.start_f_~y~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~x~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= |v_#length_1| (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4) |v_ULTIMATE.start_f_#t~malloc4.base_1| 4)) (< |v_ULTIMATE.start_f_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc4.offset_1|) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< |v_ULTIMATE.start_main_#t~nondet19_3| 0) (< |v_ULTIMATE.start_f_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_f_~z~0.offset_1 |v_ULTIMATE.start_f_#t~malloc4.offset_1|) (= (select .cse3 |v_ULTIMATE.start_f_#t~malloc2.base_1|) 0) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_f_#t~malloc4.base_1| 1)) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_f_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc4.base_1|) (> 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_3|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_1, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_#in~d=|v_ULTIMATE.start_f_#in~d_1|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_1, ULTIMATE.start_f_#t~malloc4.offset=|v_ULTIMATE.start_f_#t~malloc4.offset_1|, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_1, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_1, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_1, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_1, ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_1|, ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_1|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_1, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_1|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_1|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_1|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_f_#t~malloc4.base=|v_ULTIMATE.start_f_#t~malloc4.base_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_1, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_1, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_2|, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_f_~x~0.base, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_#in~d, ULTIMATE.start_f_~z~0.offset, ULTIMATE.start_f_#t~malloc4.offset, ULTIMATE.start_f_~d, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_~z~0.base, ULTIMATE.start_f_~d_ref~0.base, ULTIMATE.start_f_~k~0.offset, ULTIMATE.start_f_#t~nondet15, ULTIMATE.start_f_#t~nondet12, ULTIMATE.start_f_~x~0.offset, ULTIMATE.start_f_#t~mem16, ULTIMATE.start_f_#t~mem17, ULTIMATE.start_f_#t~mem18, ULTIMATE.start_f_#t~short11, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc4.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_~y~0.offset, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~k~0.base, ULTIMATE.start_f_~y~0.base, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base, ULTIMATE.start_f_~d_ref~0.offset] 8758#L11 [358] L11-->L11-1: Formula: (and (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~d_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~d_ref~0.base_3) v_ULTIMATE.start_f_~d_ref~0.offset_3 v_ULTIMATE.start_f_~d_3))) (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_f_~d_ref~0.base_3)) (= 1 (select |v_#valid_9| v_ULTIMATE.start_f_~d_ref~0.base_3))) InVars {#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_3, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_3, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_3} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_3, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_3, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 8791#L11-1 [351] L11-1-->L12: Formula: (and (<= (+ v_ULTIMATE.start_f_~x~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_f_~x~0.base_3)) (= (select |v_#valid_11| v_ULTIMATE.start_f_~x~0.base_3) 1) (<= 0 v_ULTIMATE.start_f_~x~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_f_~x~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~x~0.base_3) v_ULTIMATE.start_f_~x~0.offset_3 1)) |v_#memory_int_3|)) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_3, #length=|v_#length_9|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_3, #length=|v_#length_9|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 8773#L12 [276] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_f_~y~0.offset_3) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~y~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~y~0.base_3) v_ULTIMATE.start_f_~y~0.offset_3 1))) (<= (+ v_ULTIMATE.start_f_~y~0.offset_3 4) (select |v_#length_11| v_ULTIMATE.start_f_~y~0.base_3)) (= 1 (select |v_#valid_13| v_ULTIMATE.start_f_~y~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_3, #length=|v_#length_11|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_3, #valid=|v_#valid_13|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_3, #length=|v_#length_11|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_3, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#memory_int] 8774#L13 [401] L13-->L14: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_f_~k~0.base_3)) (<= 0 v_ULTIMATE.start_f_~k~0.offset_3) (<= (+ v_ULTIMATE.start_f_~k~0.offset_3 4) (select |v_#length_13| v_ULTIMATE.start_f_~k~0.base_3)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_f_~k~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~k~0.base_3) v_ULTIMATE.start_f_~k~0.offset_3 1)))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_3, #length=|v_#length_13|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_3, #valid=|v_#valid_15|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_3, #length=|v_#length_13|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_3, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#memory_int] 8779#L14 [334] L14-->L15: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| v_ULTIMATE.start_f_~z~0.base_3 (store (select |v_#memory_int_10| v_ULTIMATE.start_f_~z~0.base_3) v_ULTIMATE.start_f_~z~0.offset_3 1))) (<= 0 v_ULTIMATE.start_f_~z~0.offset_3) (= 1 (select |v_#valid_17| v_ULTIMATE.start_f_~z~0.base_3)) (<= (+ v_ULTIMATE.start_f_~z~0.offset_3 4) (select |v_#length_15| v_ULTIMATE.start_f_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_15|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_3, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_3, #valid=|v_#valid_17|} OutVars{#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_3, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_3, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#memory_int] 8780#L15 [795] L15-->L21-3: Formula: (and (<= 0 v_ULTIMATE.start_f_~k~0.offset_17) (<= (select (select |v_#memory_int_83| v_ULTIMATE.start_f_~k~0.base_23) v_ULTIMATE.start_f_~k~0.offset_17) 1073741823) (= (select |v_#valid_139| v_ULTIMATE.start_f_~k~0.base_23) 1) (<= (+ v_ULTIMATE.start_f_~k~0.offset_17 4) (select |v_#length_107| v_ULTIMATE.start_f_~k~0.base_23))) InVars {#valid=|v_#valid_139|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_23, #memory_int=|v_#memory_int_83|, #length=|v_#length_107|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_17} OutVars{ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_13|, #valid=|v_#valid_139|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_23, #memory_int=|v_#memory_int_83|, #length=|v_#length_107|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 8783#L21-3 [389] L21-3-->L21: Formula: (and (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_f_~z~0.base_6) v_ULTIMATE.start_f_~z~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_5) (= 1 (select |v_#valid_27| v_ULTIMATE.start_f_~z~0.base_6)) (<= (+ v_ULTIMATE.start_f_~z~0.offset_5 4) (select |v_#length_19| v_ULTIMATE.start_f_~z~0.base_6))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_6, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_5, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 8765#L21 [249] L21-->L21-1: Formula: (and (= 1 (select |v_#valid_29| v_ULTIMATE.start_f_~k~0.base_9)) (<= (+ v_ULTIMATE.start_f_~k~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_f_~k~0.base_9)) (<= 0 v_ULTIMATE.start_f_~k~0.offset_7) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~k~0.base_9) v_ULTIMATE.start_f_~k~0.offset_7))) InVars {ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_9, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_7, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_29|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_9, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 8766#L21-1 [450] L21-1-->L26-2: Formula: (>= |v_ULTIMATE.start_f_#t~mem6_4| |v_ULTIMATE.start_f_#t~mem7_4|) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_4|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_4|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_3|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7] 8790#L26-2 [267] L26-2-->L25: Formula: (and (= (select |v_#valid_35| v_ULTIMATE.start_f_~x~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~x~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_f_~x~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_f_~x~0.base_6) v_ULTIMATE.start_f_~x~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_5)) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, #length=|v_#length_27|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_2|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 8782#L25 [674] L25-->L25-1: Formula: (and |v_ULTIMATE.start_f_#t~short11_2| (< 0 |v_ULTIMATE.start_f_#t~mem9_3|)) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_2|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 8778#L25-1 [331] L25-1-->L25-2: Formula: |v_ULTIMATE.start_f_#t~short11_3| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_3|} AuxVars[] AssignedVars[] 8776#L25-2 [325] L25-2-->L25-3: Formula: (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_f_~y~0.base_6) v_ULTIMATE.start_f_~y~0.offset_5) |v_ULTIMATE.start_f_#t~mem10_2|) (<= 0 v_ULTIMATE.start_f_~y~0.offset_5) (= 1 (select |v_#valid_37| v_ULTIMATE.start_f_~y~0.base_6)) (<= (+ v_ULTIMATE.start_f_~y~0.offset_5 4) (select |v_#length_29| v_ULTIMATE.start_f_~y~0.base_6))) InVars {#memory_int=|v_#memory_int_18|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_6, #length=|v_#length_29|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_5, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_2|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_6, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10] 8771#L25-3 [702] L25-3-->L25-5: Formula: (and (< 0 |v_ULTIMATE.start_f_#t~mem10_3|) |v_ULTIMATE.start_f_#t~short11_4|) InVars {ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_4|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 8772#L25-5 [298] L25-5-->L26: Formula: |v_ULTIMATE.start_f_#t~short11_9| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_9|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_5|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_5|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_8|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~short11] 8785#L26 [259] L26-->L32: Formula: (= |v_ULTIMATE.start_f_#t~nondet12_5| 0) InVars {ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_5|} OutVars{ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_4|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~nondet12] 8768#L32 [252] L32-->L32-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~y~0.offset_9 4) (select |v_#length_43| v_ULTIMATE.start_f_~y~0.base_12)) (= 1 (select |v_#valid_51| v_ULTIMATE.start_f_~y~0.base_12)) (<= 0 v_ULTIMATE.start_f_~y~0.offset_9) (= |v_ULTIMATE.start_f_#t~mem17_2| (select (select |v_#memory_int_28| v_ULTIMATE.start_f_~y~0.base_12) v_ULTIMATE.start_f_~y~0.offset_9))) InVars {#memory_int=|v_#memory_int_28|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_12, #length=|v_#length_43|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_9, #valid=|v_#valid_51|} OutVars{ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_9, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_2|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_12, #length=|v_#length_43|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem17] 8763#L32-1 [246] L32-1-->L32-2: Formula: (and (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_7 4) (select |v_#length_45| v_ULTIMATE.start_f_~d_ref~0.base_9)) (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_7) (= 1 (select |v_#valid_53| v_ULTIMATE.start_f_~d_ref~0.base_9)) (= |v_ULTIMATE.start_f_#t~mem18_2| (select (select |v_#memory_int_29| v_ULTIMATE.start_f_~d_ref~0.base_9) v_ULTIMATE.start_f_~d_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_29|, #length=|v_#length_45|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_9, #valid=|v_#valid_53|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_7} OutVars{#valid=|v_#valid_53|, #memory_int=|v_#memory_int_29|, #length=|v_#length_45|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_2|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_9, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem18] 8764#L32-2 [787] L32-2-->L26-2: Formula: (and (= (store |v_#memory_int_68| v_ULTIMATE.start_f_~y~0.base_35 (store (select |v_#memory_int_68| v_ULTIMATE.start_f_~y~0.base_35) v_ULTIMATE.start_f_~y~0.offset_25 (+ |v_ULTIMATE.start_f_#t~mem17_10| (* (- 1) |v_ULTIMATE.start_f_#t~mem18_10|)))) |v_#memory_int_67|) (<= 0 v_ULTIMATE.start_f_~y~0.offset_25) (<= (+ v_ULTIMATE.start_f_~y~0.offset_25 4) (select |v_#length_99| v_ULTIMATE.start_f_~y~0.base_35)) (= 1 (select |v_#valid_131| v_ULTIMATE.start_f_~y~0.base_35))) InVars {ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_25, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_68|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_10|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_35, #length=|v_#length_99|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_10|} OutVars{ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_25, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_67|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_9|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_35, #length=|v_#length_99|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_9|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_f_#t~mem17, ULTIMATE.start_f_#t~mem18] 8789#L26-2 [267] L26-2-->L25: Formula: (and (= (select |v_#valid_35| v_ULTIMATE.start_f_~x~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~x~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_f_~x~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_f_~x~0.base_6) v_ULTIMATE.start_f_~x~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_5)) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, #length=|v_#length_27|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_2|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 8781#L25 [674] L25-->L25-1: Formula: (and |v_ULTIMATE.start_f_#t~short11_2| (< 0 |v_ULTIMATE.start_f_#t~mem9_3|)) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_2|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 8777#L25-1 [331] L25-1-->L25-2: Formula: |v_ULTIMATE.start_f_#t~short11_3| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_3|} AuxVars[] AssignedVars[] 8775#L25-2 [325] L25-2-->L25-3: Formula: (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_f_~y~0.base_6) v_ULTIMATE.start_f_~y~0.offset_5) |v_ULTIMATE.start_f_#t~mem10_2|) (<= 0 v_ULTIMATE.start_f_~y~0.offset_5) (= 1 (select |v_#valid_37| v_ULTIMATE.start_f_~y~0.base_6)) (<= (+ v_ULTIMATE.start_f_~y~0.offset_5 4) (select |v_#length_29| v_ULTIMATE.start_f_~y~0.base_6))) InVars {#memory_int=|v_#memory_int_18|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_6, #length=|v_#length_29|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_5, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_2|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_6, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10] 8769#L25-3 [702] L25-3-->L25-5: Formula: (and (< 0 |v_ULTIMATE.start_f_#t~mem10_3|) |v_ULTIMATE.start_f_#t~short11_4|) InVars {ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_4|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 8770#L25-5 [298] L25-5-->L26: Formula: |v_ULTIMATE.start_f_#t~short11_9| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_9|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_5|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_5|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_8|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~short11] 8784#L26 [703] L26-->L27: Formula: (< |v_ULTIMATE.start_f_#t~nondet12_3| 0) InVars {ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_3|} OutVars{ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_2|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~nondet12] 8755#L27 173.39/123.38 [2019-03-28 12:46:09,116 INFO L796 eck$LassoCheckResult]: Loop: 8755#L27 [368] L27-->L28: Formula: (and (= |v_ULTIMATE.start_f_#t~mem13_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_f_~x~0.base_9) v_ULTIMATE.start_f_~x~0.offset_7)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_f_~x~0.base_9)) (<= (+ v_ULTIMATE.start_f_~x~0.offset_7 4) (select |v_#length_31| v_ULTIMATE.start_f_~x~0.base_9)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_7)) InVars {#memory_int=|v_#memory_int_19|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_9, #length=|v_#length_31|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_7, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_9, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_7, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, #length=|v_#length_31|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_2|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem13] 8756#L28 [293] L28-->L28-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_f_~d_ref~0.base_6)) (= 1 (select |v_#valid_41| v_ULTIMATE.start_f_~d_ref~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem14_2| (select (select |v_#memory_int_20| v_ULTIMATE.start_f_~d_ref~0.base_6) v_ULTIMATE.start_f_~d_ref~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_6, #valid=|v_#valid_41|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_5} OutVars{#valid=|v_#valid_41|, #memory_int=|v_#memory_int_20|, #length=|v_#length_33|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_6, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_2|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem14] 8786#L28-1 [788] L28-1-->L29: Formula: (and (<= (+ v_ULTIMATE.start_f_~x~0.offset_21 4) (select |v_#length_100| v_ULTIMATE.start_f_~x~0.base_29)) (= (store |v_#memory_int_70| v_ULTIMATE.start_f_~x~0.base_29 (store (select |v_#memory_int_70| v_ULTIMATE.start_f_~x~0.base_29) v_ULTIMATE.start_f_~x~0.offset_21 (+ (* (- 1) |v_ULTIMATE.start_f_#t~mem14_10|) |v_ULTIMATE.start_f_#t~mem13_10|))) |v_#memory_int_69|) (<= 0 v_ULTIMATE.start_f_~x~0.offset_21) (= (select |v_#valid_132| v_ULTIMATE.start_f_~x~0.base_29) 1)) InVars {ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_29, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_21, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_70|, #length=|v_#length_100|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_10|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_10|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_29, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_21, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_69|, #length=|v_#length_100|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_9|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_9|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14] 8759#L29 [791] L29-->L30: Formula: (and (= 1 (select |v_#valid_135| v_ULTIMATE.start_f_~y~0.base_37)) (= (store |v_#memory_int_76| v_ULTIMATE.start_f_~y~0.base_37 (store (select |v_#memory_int_76| v_ULTIMATE.start_f_~y~0.base_37) v_ULTIMATE.start_f_~y~0.offset_27 |v_ULTIMATE.start_f_#t~nondet15_8|)) |v_#memory_int_75|) (<= 0 v_ULTIMATE.start_f_~y~0.offset_27) (<= (+ v_ULTIMATE.start_f_~y~0.offset_27 4) (select |v_#length_103| v_ULTIMATE.start_f_~y~0.base_37))) InVars {ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_8|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_27, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_76|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_37, #length=|v_#length_103|} OutVars{ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_7|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_27, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_75|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_37, #length=|v_#length_103|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~nondet15, #memory_int] 8760#L30 [348] L30-->L30-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~z~0.offset_11 4) (select |v_#length_39| v_ULTIMATE.start_f_~z~0.base_15)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_f_~z~0.base_15)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_11) (= |v_ULTIMATE.start_f_#t~mem16_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_f_~z~0.base_15) v_ULTIMATE.start_f_~z~0.offset_11))) InVars {#memory_int=|v_#memory_int_25|, #length=|v_#length_39|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_15, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_11, #valid=|v_#valid_47|} OutVars{ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_11, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_2|, #length=|v_#length_39|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem16] 8787#L30-1 [793] L30-1-->L26-2: Formula: (and (= |v_#memory_int_79| (store |v_#memory_int_80| v_ULTIMATE.start_f_~z~0.base_43 (store (select |v_#memory_int_80| v_ULTIMATE.start_f_~z~0.base_43) v_ULTIMATE.start_f_~z~0.offset_31 (+ |v_ULTIMATE.start_f_#t~mem16_10| (- 1))))) (= 1 (select |v_#valid_137| v_ULTIMATE.start_f_~z~0.base_43)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_31) (<= (+ v_ULTIMATE.start_f_~z~0.offset_31 4) (select |v_#length_105| v_ULTIMATE.start_f_~z~0.base_43))) InVars {ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_31, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_80|, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_10|, #length=|v_#length_105|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_43} OutVars{ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_31, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_9|, #length=|v_#length_105|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_43} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_f_#t~mem16] 8788#L26-2 [267] L26-2-->L25: Formula: (and (= (select |v_#valid_35| v_ULTIMATE.start_f_~x~0.base_6) 1) (<= (+ v_ULTIMATE.start_f_~x~0.offset_5 4) (select |v_#length_27| v_ULTIMATE.start_f_~x~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem9_2| (select (select |v_#memory_int_17| v_ULTIMATE.start_f_~x~0.base_6) v_ULTIMATE.start_f_~x~0.offset_5)) (<= 0 v_ULTIMATE.start_f_~x~0.offset_5)) InVars {#memory_int=|v_#memory_int_17|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, #length=|v_#length_27|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_6, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_2|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_5, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, #length=|v_#length_27|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9] 8793#L25 [674] L25-->L25-1: Formula: (and |v_ULTIMATE.start_f_#t~short11_2| (< 0 |v_ULTIMATE.start_f_#t~mem9_3|)) InVars {ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_2|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 8798#L25-1 [331] L25-1-->L25-2: Formula: |v_ULTIMATE.start_f_#t~short11_3| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_3|} AuxVars[] AssignedVars[] 8797#L25-2 [325] L25-2-->L25-3: Formula: (and (= (select (select |v_#memory_int_18| v_ULTIMATE.start_f_~y~0.base_6) v_ULTIMATE.start_f_~y~0.offset_5) |v_ULTIMATE.start_f_#t~mem10_2|) (<= 0 v_ULTIMATE.start_f_~y~0.offset_5) (= 1 (select |v_#valid_37| v_ULTIMATE.start_f_~y~0.base_6)) (<= (+ v_ULTIMATE.start_f_~y~0.offset_5 4) (select |v_#length_29| v_ULTIMATE.start_f_~y~0.base_6))) InVars {#memory_int=|v_#memory_int_18|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_6, #length=|v_#length_29|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_5, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_2|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_5, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_6, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem10] 8796#L25-3 [702] L25-3-->L25-5: Formula: (and (< 0 |v_ULTIMATE.start_f_#t~mem10_3|) |v_ULTIMATE.start_f_#t~short11_4|) InVars {ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_3|} OutVars{ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_4|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_3|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~short11] 8795#L25-5 [298] L25-5-->L26: Formula: |v_ULTIMATE.start_f_#t~short11_9| InVars {ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_9|} OutVars{ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_5|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_5|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_8|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_#t~short11] 8794#L26 [704] L26-->L27: Formula: (> |v_ULTIMATE.start_f_#t~nondet12_3| 0) InVars {ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_3|} OutVars{ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_2|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~nondet12] 8755#L27 173.39/123.38 [2019-03-28 12:46:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.38 [2019-03-28 12:46:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1914192650, now seen corresponding path program 1 times 173.39/123.38 [2019-03-28 12:46:09,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.38 [2019-03-28 12:46:09,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.38 [2019-03-28 12:46:09,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:09,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:09,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.38 [2019-03-28 12:46:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.38 [2019-03-28 12:46:09,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 173.39/123.38 [2019-03-28 12:46:09,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 173.39/123.38 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 173.39/123.38 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 173.39/123.38 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 173.39/123.38 [2019-03-28 12:46:09,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 173.39/123.38 [2019-03-28 12:46:09,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core 173.39/123.38 [2019-03-28 12:46:09,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... 173.39/123.38 [2019-03-28 12:46:09,761 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:09,762 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 101 173.39/123.38 [2019-03-28 12:46:09,762 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:09,778 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:09,779 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:09,779 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:44 173.39/123.38 [2019-03-28 12:46:09,818 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 173.39/123.38 [2019-03-28 12:46:09,818 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:09,837 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:09,837 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:09,838 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 173.39/123.38 [2019-03-28 12:46:09,879 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 173.39/123.38 [2019-03-28 12:46:09,880 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:09,899 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:09,900 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:09,900 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:55 173.39/123.38 [2019-03-28 12:46:09,945 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 173.39/123.38 [2019-03-28 12:46:09,946 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:09,967 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:09,968 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:09,968 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:62 173.39/123.38 [2019-03-28 12:46:10,020 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 173.39/123.38 [2019-03-28 12:46:10,021 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:10,048 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:10,049 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:10,050 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:69 173.39/123.38 [2019-03-28 12:46:10,107 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 173.39/123.38 [2019-03-28 12:46:10,107 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:10,138 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:10,139 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:10,140 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:80, output treesize:76 173.39/123.38 [2019-03-28 12:46:10,877 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 173.39/123.38 [2019-03-28 12:46:10,878 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:10,915 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:10,917 INFO L427 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:10,917 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:105, output treesize:82 173.39/123.38 [2019-03-28 12:46:10,995 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 173.39/123.38 [2019-03-28 12:46:10,995 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:11,017 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 173.39/123.38 [2019-03-28 12:46:11,017 INFO L427 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 173.39/123.38 [2019-03-28 12:46:11,018 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:89, output treesize:3 173.39/123.38 [2019-03-28 12:46:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 173.39/123.38 [2019-03-28 12:46:11,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 173.39/123.38 [2019-03-28 12:46:11,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 173.39/123.38 [2019-03-28 12:46:11,058 INFO L799 eck$LassoCheckResult]: stem already infeasible 173.39/123.38 [2019-03-28 12:46:11,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 173.39/123.38 [2019-03-28 12:46:11,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1106264147, now seen corresponding path program 2 times 173.39/123.38 [2019-03-28 12:46:11,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 173.39/123.38 [2019-03-28 12:46:11,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 173.39/123.38 [2019-03-28 12:46:11,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:11,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:11,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 173.39/123.38 [2019-03-28 12:46:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:46:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 173.39/123.38 [2019-03-28 12:46:11,197 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 83 173.39/123.38 [2019-03-28 12:46:11,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. 173.39/123.38 [2019-03-28 12:46:11,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 173.39/123.38 [2019-03-28 12:46:11,293 INFO L87 Difference]: Start difference. First operand 44 states and 109 transitions. cyclomatic complexity: 67 Second operand 23 states. 173.39/123.38 [2019-03-28 12:46:13,701 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 173.39/123.38 [2019-03-28 12:46:13,868 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 53 173.39/123.38 [2019-03-28 12:46:14,046 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 173.39/123.38 [2019-03-28 12:46:14,256 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 59 173.39/123.38 [2019-03-28 12:46:14,441 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 173.39/123.38 [2019-03-28 12:46:14,679 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 173.39/123.38 [2019-03-28 12:46:14,886 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 173.39/123.38 [2019-03-28 12:46:15,142 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 173.39/123.38 [2019-03-28 12:46:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 173.39/123.38 [2019-03-28 12:46:15,143 INFO L93 Difference]: Finished difference Result 30 states and 90 transitions. 173.39/123.38 [2019-03-28 12:46:15,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 173.39/123.38 [2019-03-28 12:46:15,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 90 transitions. 173.39/123.38 [2019-03-28 12:46:15,174 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 173.39/123.38 [2019-03-28 12:46:15,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. 173.39/123.38 [2019-03-28 12:46:15,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 173.39/123.38 [2019-03-28 12:46:15,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 173.39/123.38 [2019-03-28 12:46:15,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 173.39/123.38 [2019-03-28 12:46:15,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 173.39/123.38 [2019-03-28 12:46:15,175 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 173.39/123.38 [2019-03-28 12:46:15,175 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 173.39/123.38 [2019-03-28 12:46:15,175 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 173.39/123.38 [2019-03-28 12:46:15,175 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 173.39/123.38 [2019-03-28 12:46:15,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 173.39/123.38 [2019-03-28 12:46:15,175 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 173.39/123.38 [2019-03-28 12:46:15,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 173.39/123.38 [2019-03-28 12:46:15,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:46:15 BasicIcfg 173.39/123.38 [2019-03-28 12:46:15,182 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 173.39/123.38 [2019-03-28 12:46:15,182 INFO L168 Benchmark]: Toolchain (without parser) took 119224.76 ms. Allocated memory was 649.6 MB in the beginning and 1.2 GB in the end (delta: 509.1 MB). Free memory was 564.0 MB in the beginning and 585.1 MB in the end (delta: -21.1 MB). Peak memory consumption was 487.9 MB. Max. memory is 50.3 GB. 173.39/123.38 [2019-03-28 12:46:15,183 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 173.39/123.38 [2019-03-28 12:46:15,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.47 ms. Allocated memory was 649.6 MB in the beginning and 688.9 MB in the end (delta: 39.3 MB). Free memory was 564.0 MB in the beginning and 653.9 MB in the end (delta: -90.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 173.39/123.38 [2019-03-28 12:46:15,184 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.71 ms. Allocated memory is still 688.9 MB. Free memory was 653.9 MB in the beginning and 649.5 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. 173.39/123.38 [2019-03-28 12:46:15,184 INFO L168 Benchmark]: Boogie Preprocessor took 33.50 ms. Allocated memory is still 688.9 MB. Free memory was 649.5 MB in the beginning and 648.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 173.39/123.38 [2019-03-28 12:46:15,184 INFO L168 Benchmark]: RCFGBuilder took 670.35 ms. Allocated memory is still 688.9 MB. Free memory was 648.1 MB in the beginning and 597.4 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 50.3 GB. 173.39/123.38 [2019-03-28 12:46:15,185 INFO L168 Benchmark]: BlockEncodingV2 took 237.24 ms. Allocated memory is still 688.9 MB. Free memory was 597.4 MB in the beginning and 556.9 MB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 50.3 GB. 173.39/123.38 [2019-03-28 12:46:15,185 INFO L168 Benchmark]: TraceAbstraction took 7071.91 ms. Allocated memory was 688.9 MB in the beginning and 847.8 MB in the end (delta: 158.9 MB). Free memory was 556.9 MB in the beginning and 610.3 MB in the end (delta: -53.4 MB). Peak memory consumption was 105.4 MB. Max. memory is 50.3 GB. 173.39/123.38 [2019-03-28 12:46:15,186 INFO L168 Benchmark]: BuchiAutomizer took 110831.11 ms. Allocated memory was 847.8 MB in the beginning and 1.2 GB in the end (delta: 310.9 MB). Free memory was 610.3 MB in the beginning and 585.1 MB in the end (delta: 25.2 MB). Peak memory consumption was 336.1 MB. Max. memory is 50.3 GB. 173.39/123.38 [2019-03-28 12:46:15,189 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 173.39/123.38 --- Results --- 173.39/123.38 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 173.39/123.38 - StatisticsResult: Initial Icfg 173.39/123.38 158 locations, 172 edges 173.39/123.38 - StatisticsResult: Encoded RCFG 173.39/123.38 140 locations, 331 edges 173.39/123.38 * Results from de.uni_freiburg.informatik.ultimate.core: 173.39/123.38 - StatisticsResult: Toolchain Benchmarks 173.39/123.38 Benchmark results are: 173.39/123.38 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.5 MB. There was no memory consumed. Max. memory is 50.3 GB. 173.39/123.38 * CACSL2BoogieTranslator took 325.47 ms. Allocated memory was 649.6 MB in the beginning and 688.9 MB in the end (delta: 39.3 MB). Free memory was 564.0 MB in the beginning and 653.9 MB in the end (delta: -90.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 173.39/123.38 * Boogie Procedure Inliner took 49.71 ms. Allocated memory is still 688.9 MB. Free memory was 653.9 MB in the beginning and 649.5 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. 173.39/123.38 * Boogie Preprocessor took 33.50 ms. Allocated memory is still 688.9 MB. Free memory was 649.5 MB in the beginning and 648.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 173.39/123.38 * RCFGBuilder took 670.35 ms. Allocated memory is still 688.9 MB. Free memory was 648.1 MB in the beginning and 597.4 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 50.3 GB. 173.39/123.38 * BlockEncodingV2 took 237.24 ms. Allocated memory is still 688.9 MB. Free memory was 597.4 MB in the beginning and 556.9 MB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 50.3 GB. 173.39/123.38 * TraceAbstraction took 7071.91 ms. Allocated memory was 688.9 MB in the beginning and 847.8 MB in the end (delta: 158.9 MB). Free memory was 556.9 MB in the beginning and 610.3 MB in the end (delta: -53.4 MB). Peak memory consumption was 105.4 MB. Max. memory is 50.3 GB. 173.39/123.38 * BuchiAutomizer took 110831.11 ms. Allocated memory was 847.8 MB in the beginning and 1.2 GB in the end (delta: 310.9 MB). Free memory was 610.3 MB in the beginning and 585.1 MB in the end (delta: 25.2 MB). Peak memory consumption was 336.1 MB. Max. memory is 50.3 GB. 173.39/123.38 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 173.39/123.38 - GenericResult: Unfinished Backtranslation 173.39/123.38 unknown boogie variable #memory_int 173.39/123.38 - GenericResult: Unfinished Backtranslation 173.39/123.38 unknown boogie variable #memory_int 173.39/123.38 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 173.39/123.38 - PositiveResult [Line: 14]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 28]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 13]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 29]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 15]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 15]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 29]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 17]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 30]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 12]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 17]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 30]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 28]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 12]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 28]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 13]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 28]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 28]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 28]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 14]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 32]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 22]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 22]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 25]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 32]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 32]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 25]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 11]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 25]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 25]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 11]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 21]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 30]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 30]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 21]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 21]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 22]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 32]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 32]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 22]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 32]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 28]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 15]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 28]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 15]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 29]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 13]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 29]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 17]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 17]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 21]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 12]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 30]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 30]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 12]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 25]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 13]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 28]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 28]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 28]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 14]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 28]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 14]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 22]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 32]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 22]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 32]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 11]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 25]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 25]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 25]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 11]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 21]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 21]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 30]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 30]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 21]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 32]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 21]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 32]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 22]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 22]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 32]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - PositiveResult [Line: 32]: pointer dereference always succeeds 173.39/123.38 For all program executions holds that pointer dereference always succeeds at this location 173.39/123.38 - AllSpecificationsHoldResult: All specifications hold 173.39/123.38 84 specifications checked. All of them hold 173.39/123.38 - StatisticsResult: Ultimate Automizer benchmark data 173.39/123.38 CFG has 1 procedures, 140 locations, 84 error locations. SAFE Result, 7.0s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 1766 SDslu, 7 SDs, 0 SdLazy, 2761 SolverSat, 1296 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred 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, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 1124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 173.39/123.38 - StatisticsResult: Constructed decomposition of program 173.39/123.38 Your program was decomposed into 7 terminating modules (5 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 184 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 29 locations. 5 modules have a trivial ranking function, the largest among these consists of 28 locations. 173.39/123.38 - StatisticsResult: Timing statistics 173.39/123.38 BüchiAutomizer plugin needed 110.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 15.4s. Construction of modules took 46.8s. Büchi inclusion checks took 48.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 3708 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 96 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 204 SDtfs, 15270 SDslu, 2477 SDs, 0 SdLazy, 12370 SolverSat, 5205 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 46.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital557 mio100 ax100 hnf100 lsp97 ukn45 mio100 lsp34 div100 bol100 ite100 ukn100 eq189 hnf88 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 173.39/123.38 - TerminationAnalysisResult: Termination proven 173.39/123.38 Buchi Automizer proved that your program is terminating 173.39/123.38 RESULT: Ultimate proved your program to be correct! 173.39/123.38 !SESSION 2019-03-28 12:44:12.708 ----------------------------------------------- 173.39/123.38 eclipse.buildId=unknown 173.39/123.38 java.version=1.8.0_181 173.39/123.38 java.vendor=Oracle Corporation 173.39/123.38 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 173.39/123.38 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 173.39/123.38 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 173.39/123.38 173.39/123.38 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:46:15.422 173.39/123.38 !MESSAGE The workspace will exit with unsaved changes in this session. 173.39/123.38 Received shutdown request... 173.39/123.38 Ultimate: 173.39/123.38 GTK+ Version Check 173.39/123.38 EOF