YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 08:51:55,295 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 08:51:55,297 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 08:51:55,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 08:51:55,309 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 08:51:55,310 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 08:51:55,311 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 08:51:55,312 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 08:51:55,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 08:51:55,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 08:51:55,315 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 08:51:55,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 08:51:55,317 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 08:51:55,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 08:51:55,318 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 08:51:55,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 08:51:55,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 08:51:55,322 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 08:51:55,324 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 08:51:55,325 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 08:51:55,326 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 08:51:55,327 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 08:51:55,329 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 08:51:55,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 08:51:55,330 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 08:51:55,346 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 08:51:55,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 08:51:55,352 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 08:51:55,352 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 08:51:55,353 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 08:51:55,354 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 08:51:55,355 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 08:51:55,356 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 08:51:55,356 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 08:51:55,356 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 08:51:55,357 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 08:51:55,357 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 08:51:55,358 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 08:51:55,358 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 08:51:55,359 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 08:51:55,373 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 08:51:55,373 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 08:51:55,375 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 08:51:55,375 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 08:51:55,375 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 08:51:55,375 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:51:55,375 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 08:51:55,375 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 08:51:55,376 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 08:51:55,376 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 08:51:55,376 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 08:51:55,376 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 08:51:55,376 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 08:51:55,376 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 08:51:55,377 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:51:55,377 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 08:51:55,377 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 08:51:55,377 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 08:51:55,377 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 08:51:55,377 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 08:51:55,377 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 08:51:55,378 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 08:51:55,378 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 08:51:55,378 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 08:51:55,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:51:55,378 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 08:51:55,379 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 08:51:55,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 08:51:55,379 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 08:51:55,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 08:51:55,423 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 08:51:55,430 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 08:51:55,432 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 08:51:55,432 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 08:51:55,433 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:51:55,507 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/36438ab3650f4fd89b11eea6622d4eaa/FLAGa52813e54 [2020-06-22 08:51:55,877 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 08:51:55,877 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:51:55,878 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 08:51:55,884 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/36438ab3650f4fd89b11eea6622d4eaa/FLAGa52813e54 [2020-06-22 08:51:56,257 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/36438ab3650f4fd89b11eea6622d4eaa [2020-06-22 08:51:56,268 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 08:51:56,269 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 08:51:56,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 08:51:56,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 08:51:56,274 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 08:51:56,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778a7c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56, skipping insertion in model container [2020-06-22 08:51:56,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 08:51:56,306 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 08:51:56,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:51:56,485 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 08:51:56,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:51:56,583 INFO L195 MainTranslator]: Completed translation [2020-06-22 08:51:56,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56 WrapperNode [2020-06-22 08:51:56,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 08:51:56,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 08:51:56,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 08:51:56,586 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 08:51:56,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 08:51:56,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 08:51:56,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 08:51:56,630 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 08:51:56,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 08:51:56,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 08:51:56,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 08:51:56,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 08:51:56,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:51:56,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 08:51:56,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 08:51:56,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 08:51:56,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 08:51:56,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 08:51:56,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 08:51:56,981 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 08:51:56,981 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 08:51:56,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:51:56 BoogieIcfgContainer [2020-06-22 08:51:56,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 08:51:56,984 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 08:51:56,984 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 08:51:56,986 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 08:51:56,987 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:57,003 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 36 edges [2020-06-22 08:51:57,005 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 08:51:57,005 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 08:51:57,006 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 08:51:57,006 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:51:57,008 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 08:51:57,009 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 08:51:57,009 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 08:51:57,033 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 08:51:57,064 INFO L200 BlockEncoder]: SBE split 12 edges [2020-06-22 08:51:57,069 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 08:51:57,070 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:51:57,103 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 08:51:57,105 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 08:51:57,107 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:51:57,107 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:51:57,107 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 08:51:57,108 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:51:57,108 INFO L313 BlockEncoder]: Encoded RCFG 21 locations, 38 edges [2020-06-22 08:51:57,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:51:57 BasicIcfg [2020-06-22 08:51:57,109 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 08:51:57,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 08:51:57,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 08:51:57,113 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 08:51:57,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 08:51:56" (1/4) ... [2020-06-22 08:51:57,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d14afa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:51:57, skipping insertion in model container [2020-06-22 08:51:57,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (2/4) ... [2020-06-22 08:51:57,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d14afa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:51:57, skipping insertion in model container [2020-06-22 08:51:57,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:51:56" (3/4) ... [2020-06-22 08:51:57,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d14afa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:51:57, skipping insertion in model container [2020-06-22 08:51:57,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:51:57" (4/4) ... [2020-06-22 08:51:57,117 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:51:57,127 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 08:51:57,135 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-06-22 08:51:57,151 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-06-22 08:51:57,180 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:51:57,181 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 08:51:57,181 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 08:51:57,181 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:51:57,181 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:51:57,181 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:51:57,181 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 08:51:57,181 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:51:57,182 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 08:51:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-06-22 08:51:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:51:57,203 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:57,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:51:57,204 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:57,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:57,209 INFO L82 PathProgramCache]: Analyzing trace with hash 164786450, now seen corresponding path program 1 times [2020-06-22 08:51:57,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:57,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:57,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:57,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:57,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:57,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:51:57,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:51:57,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:51:57,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:57,414 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-06-22 08:51:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:57,507 INFO L93 Difference]: Finished difference Result 21 states and 38 transitions. [2020-06-22 08:51:57,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:51:57,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 08:51:57,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:57,523 INFO L225 Difference]: With dead ends: 21 [2020-06-22 08:51:57,523 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 08:51:57,526 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 [2020-06-22 08:51:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 08:51:57,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 08:51:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 08:51:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 36 transitions. [2020-06-22 08:51:57,565 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 36 transitions. Word has length 5 [2020-06-22 08:51:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:57,566 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 36 transitions. [2020-06-22 08:51:57,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:51:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 36 transitions. [2020-06-22 08:51:57,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:51:57,567 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:57,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:51:57,567 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:57,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:57,567 INFO L82 PathProgramCache]: Analyzing trace with hash 164786452, now seen corresponding path program 1 times [2020-06-22 08:51:57,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:57,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:57,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:57,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:57,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:57,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:51:57,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:51:57,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:51:57,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:57,618 INFO L87 Difference]: Start difference. First operand 20 states and 36 transitions. Second operand 3 states. [2020-06-22 08:51:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:57,695 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. [2020-06-22 08:51:57,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:51:57,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 08:51:57,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:57,696 INFO L225 Difference]: With dead ends: 21 [2020-06-22 08:51:57,697 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 08:51:57,698 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 [2020-06-22 08:51:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 08:51:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 08:51:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 08:51:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2020-06-22 08:51:57,702 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 35 transitions. Word has length 5 [2020-06-22 08:51:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:57,702 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-06-22 08:51:57,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:51:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. [2020-06-22 08:51:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:51:57,703 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:57,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:51:57,703 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:57,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:57,704 INFO L82 PathProgramCache]: Analyzing trace with hash 164786453, now seen corresponding path program 1 times [2020-06-22 08:51:57,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:57,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:57,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:57,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:57,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:57,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:51:57,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:51:57,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:51:57,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:51:57,742 INFO L87 Difference]: Start difference. First operand 20 states and 35 transitions. Second operand 4 states. [2020-06-22 08:51:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:57,796 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2020-06-22 08:51:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:51:57,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 08:51:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:57,797 INFO L225 Difference]: With dead ends: 20 [2020-06-22 08:51:57,797 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 08:51:57,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:51:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 08:51:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 08:51:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 08:51:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2020-06-22 08:51:57,802 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 5 [2020-06-22 08:51:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:57,802 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 34 transitions. [2020-06-22 08:51:57,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:51:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 34 transitions. [2020-06-22 08:51:57,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 08:51:57,803 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:57,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:51:57,803 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:57,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:57,804 INFO L82 PathProgramCache]: Analyzing trace with hash 813411697, now seen corresponding path program 1 times [2020-06-22 08:51:57,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:57,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:57,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:57,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:57,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:57,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:51:57,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:51:57,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:51:57,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:57,841 INFO L87 Difference]: Start difference. First operand 19 states and 34 transitions. Second operand 3 states. [2020-06-22 08:51:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:57,896 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. [2020-06-22 08:51:57,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:51:57,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 08:51:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:57,898 INFO L225 Difference]: With dead ends: 20 [2020-06-22 08:51:57,898 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 08:51:57,898 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 [2020-06-22 08:51:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 08:51:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 08:51:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 08:51:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2020-06-22 08:51:57,902 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 6 [2020-06-22 08:51:57,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:57,903 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 33 transitions. [2020-06-22 08:51:57,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:51:57,903 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 33 transitions. [2020-06-22 08:51:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 08:51:57,903 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:57,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:51:57,904 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:57,904 INFO L82 PathProgramCache]: Analyzing trace with hash 813411698, now seen corresponding path program 1 times [2020-06-22 08:51:57,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:57,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:57,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:57,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:57,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:57,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:51:57,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:51:57,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:51:57,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:51:57,956 INFO L87 Difference]: Start difference. First operand 19 states and 33 transitions. Second operand 4 states. [2020-06-22 08:51:57,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:57,998 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2020-06-22 08:51:57,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:51:57,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 08:51:57,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:57,999 INFO L225 Difference]: With dead ends: 19 [2020-06-22 08:51:57,999 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 08:51:58,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:51:58,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 08:51:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 08:51:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 08:51:58,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2020-06-22 08:51:58,003 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 6 [2020-06-22 08:51:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,004 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 32 transitions. [2020-06-22 08:51:58,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:51:58,004 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. [2020-06-22 08:51:58,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 08:51:58,004 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,005 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,005 INFO L82 PathProgramCache]: Analyzing trace with hash 813411695, now seen corresponding path program 1 times [2020-06-22 08:51:58,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:51:58,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:51:58,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:51:58,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:58,031 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand 3 states. [2020-06-22 08:51:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:58,073 INFO L93 Difference]: Finished difference Result 18 states and 32 transitions. [2020-06-22 08:51:58,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:51:58,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 08:51:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:58,074 INFO L225 Difference]: With dead ends: 18 [2020-06-22 08:51:58,074 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 08:51:58,075 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 [2020-06-22 08:51:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 08:51:58,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 08:51:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 08:51:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2020-06-22 08:51:58,078 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 6 [2020-06-22 08:51:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,079 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2020-06-22 08:51:58,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:51:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2020-06-22 08:51:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 08:51:58,079 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,080 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash 4612450, now seen corresponding path program 1 times [2020-06-22 08:51:58,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:51:58,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:51:58,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:51:58,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:51:58,145 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 5 states. [2020-06-22 08:51:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:58,249 INFO L93 Difference]: Finished difference Result 17 states and 30 transitions. [2020-06-22 08:51:58,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:51:58,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-06-22 08:51:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:58,250 INFO L225 Difference]: With dead ends: 17 [2020-06-22 08:51:58,250 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 08:51:58,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:51:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 08:51:58,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 08:51:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 08:51:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 28 transitions. [2020-06-22 08:51:58,254 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 28 transitions. Word has length 8 [2020-06-22 08:51:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,254 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 28 transitions. [2020-06-22 08:51:58,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:51:58,254 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 28 transitions. [2020-06-22 08:51:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 08:51:58,255 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,255 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,256 INFO L82 PathProgramCache]: Analyzing trace with hash 4612452, now seen corresponding path program 1 times [2020-06-22 08:51:58,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:51:58,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:51:58,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:51:58,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:51:58,301 INFO L87 Difference]: Start difference. First operand 16 states and 28 transitions. Second operand 5 states. [2020-06-22 08:51:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:58,406 INFO L93 Difference]: Finished difference Result 21 states and 34 transitions. [2020-06-22 08:51:58,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:51:58,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-06-22 08:51:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:58,407 INFO L225 Difference]: With dead ends: 21 [2020-06-22 08:51:58,408 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 08:51:58,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:51:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 08:51:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-06-22 08:51:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 08:51:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2020-06-22 08:51:58,413 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 31 transitions. Word has length 8 [2020-06-22 08:51:58,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,413 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 31 transitions. [2020-06-22 08:51:58,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:51:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 31 transitions. [2020-06-22 08:51:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 08:51:58,414 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,414 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash 4612453, now seen corresponding path program 1 times [2020-06-22 08:51:58,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 08:51:58,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 08:51:58,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 08:51:58,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:51:58,505 INFO L87 Difference]: Start difference. First operand 18 states and 31 transitions. Second operand 7 states. [2020-06-22 08:51:58,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:58,623 INFO L93 Difference]: Finished difference Result 20 states and 33 transitions. [2020-06-22 08:51:58,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 08:51:58,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-06-22 08:51:58,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:58,624 INFO L225 Difference]: With dead ends: 20 [2020-06-22 08:51:58,624 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 08:51:58,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-06-22 08:51:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 08:51:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-06-22 08:51:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 08:51:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2020-06-22 08:51:58,628 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 30 transitions. Word has length 8 [2020-06-22 08:51:58,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,628 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 30 transitions. [2020-06-22 08:51:58,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 08:51:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 30 transitions. [2020-06-22 08:51:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 08:51:58,629 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,629 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,630 INFO L82 PathProgramCache]: Analyzing trace with hash -28846887, now seen corresponding path program 1 times [2020-06-22 08:51:58,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:51:58,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:51:58,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:51:58,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:51:58,675 INFO L87 Difference]: Start difference. First operand 18 states and 30 transitions. Second operand 5 states. [2020-06-22 08:51:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:58,756 INFO L93 Difference]: Finished difference Result 19 states and 32 transitions. [2020-06-22 08:51:58,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:51:58,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-06-22 08:51:58,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:58,757 INFO L225 Difference]: With dead ends: 19 [2020-06-22 08:51:58,757 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 08:51:58,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:51:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 08:51:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-06-22 08:51:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 08:51:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2020-06-22 08:51:58,761 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 28 transitions. Word has length 11 [2020-06-22 08:51:58,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,761 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 28 transitions. [2020-06-22 08:51:58,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:51:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 28 transitions. [2020-06-22 08:51:58,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 08:51:58,762 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,762 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,762 INFO L82 PathProgramCache]: Analyzing trace with hash -28846885, now seen corresponding path program 1 times [2020-06-22 08:51:58,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 08:51:58,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 08:51:58,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 08:51:58,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:51:58,812 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. Second operand 6 states. [2020-06-22 08:51:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:58,904 INFO L93 Difference]: Finished difference Result 22 states and 35 transitions. [2020-06-22 08:51:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 08:51:58,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-06-22 08:51:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:58,905 INFO L225 Difference]: With dead ends: 22 [2020-06-22 08:51:58,905 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 08:51:58,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-06-22 08:51:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 08:51:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-06-22 08:51:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 08:51:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2020-06-22 08:51:58,910 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 11 [2020-06-22 08:51:58,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,910 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. [2020-06-22 08:51:58,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 08:51:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-06-22 08:51:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 08:51:58,911 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,911 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,911 INFO L82 PathProgramCache]: Analyzing trace with hash -28846884, now seen corresponding path program 1 times [2020-06-22 08:51:58,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 08:51:58,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 08:51:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 08:51:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:51:58,984 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand 7 states. [2020-06-22 08:51:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:59,098 INFO L93 Difference]: Finished difference Result 21 states and 34 transitions. [2020-06-22 08:51:59,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 08:51:59,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-06-22 08:51:59,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:59,099 INFO L225 Difference]: With dead ends: 21 [2020-06-22 08:51:59,099 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 08:51:59,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-06-22 08:51:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 08:51:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 08:51:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 08:51:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2020-06-22 08:51:59,103 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 30 transitions. Word has length 11 [2020-06-22 08:51:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:59,103 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 30 transitions. [2020-06-22 08:51:59,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 08:51:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2020-06-22 08:51:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 08:51:59,104 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:59,104 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:59,104 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:59,104 INFO L82 PathProgramCache]: Analyzing trace with hash -383674474, now seen corresponding path program 1 times [2020-06-22 08:51:59,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:59,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:59,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:59,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:51:59,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:51:59,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:59,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:51:59,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:51:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:59,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:51:59,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 08:51:59,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 08:51:59,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 08:51:59,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:51:59,264 INFO L87 Difference]: Start difference. First operand 19 states and 30 transitions. Second operand 8 states. [2020-06-22 08:51:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:59,396 INFO L93 Difference]: Finished difference Result 21 states and 32 transitions. [2020-06-22 08:51:59,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 08:51:59,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-06-22 08:51:59,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:59,397 INFO L225 Difference]: With dead ends: 21 [2020-06-22 08:51:59,397 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 08:51:59,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-06-22 08:51:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 08:51:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-06-22 08:51:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 08:51:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2020-06-22 08:51:59,401 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 14 [2020-06-22 08:51:59,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:59,402 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-06-22 08:51:59,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 08:51:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. [2020-06-22 08:51:59,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-06-22 08:51:59,402 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:59,402 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:59,403 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:51:59,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:59,403 INFO L82 PathProgramCache]: Analyzing trace with hash -383674473, now seen corresponding path program 1 times [2020-06-22 08:51:59,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:59,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:59,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:59,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:59,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:59,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:51:59,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:51:59,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:59,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 28 conjunts are in the unsatisfiable core [2020-06-22 08:51:59,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:51:59,676 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 08:51:59,676 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:51:59,689 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:51:59,690 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:51:59,691 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2020-06-22 08:51:59,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:51:59,733 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 08:51:59,734 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:51:59,748 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:51:59,749 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. [2020-06-22 08:51:59,750 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 [2020-06-22 08:51:59,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:51:59,855 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:51:59,855 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2020-06-22 08:51:59,859 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:51:59,875 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:51:59,882 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:51:59,882 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:52, output treesize:27 [2020-06-22 08:51:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:59,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:51:59,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-06-22 08:51:59,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 08:51:59,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 08:51:59,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-06-22 08:51:59,998 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand 17 states. [2020-06-22 08:52:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:01,162 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2020-06-22 08:52:01,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-06-22 08:52:01,162 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2020-06-22 08:52:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:52:01,163 INFO L225 Difference]: With dead ends: 56 [2020-06-22 08:52:01,163 INFO L226 Difference]: Without dead ends: 55 [2020-06-22 08:52:01,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2020-06-22 08:52:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-06-22 08:52:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2020-06-22 08:52:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 08:52:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 44 transitions. [2020-06-22 08:52:01,172 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 44 transitions. Word has length 14 [2020-06-22 08:52:01,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:52:01,172 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 44 transitions. [2020-06-22 08:52:01,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 08:52:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 44 transitions. [2020-06-22 08:52:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 08:52:01,173 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:52:01,173 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:01,173 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:52:01,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash 992524143, now seen corresponding path program 1 times [2020-06-22 08:52:01,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:01,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:01,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:01,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:01,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:01,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:01,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:52:01,229 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:52:01,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:01,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 08:52:01,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:01,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:52:01,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2020-06-22 08:52:01,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 08:52:01,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 08:52:01,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 08:52:01,303 INFO L87 Difference]: Start difference. First operand 28 states and 44 transitions. Second operand 9 states. [2020-06-22 08:52:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:01,460 INFO L93 Difference]: Finished difference Result 31 states and 50 transitions. [2020-06-22 08:52:01,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 08:52:01,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-06-22 08:52:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:52:01,461 INFO L225 Difference]: With dead ends: 31 [2020-06-22 08:52:01,461 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 08:52:01,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-06-22 08:52:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 08:52:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-06-22 08:52:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 08:52:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2020-06-22 08:52:01,468 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 15 [2020-06-22 08:52:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:52:01,469 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-06-22 08:52:01,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 08:52:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-06-22 08:52:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 08:52:01,469 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:52:01,469 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:01,470 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:52:01,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:01,470 INFO L82 PathProgramCache]: Analyzing trace with hash 992524144, now seen corresponding path program 1 times [2020-06-22 08:52:01,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:01,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:01,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:01,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:01,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:01,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:52:01,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 08:52:01,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 08:52:01,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 08:52:01,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:52:01,564 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 8 states. [2020-06-22 08:52:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:01,761 INFO L93 Difference]: Finished difference Result 63 states and 94 transitions. [2020-06-22 08:52:01,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 08:52:01,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-06-22 08:52:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:52:01,762 INFO L225 Difference]: With dead ends: 63 [2020-06-22 08:52:01,762 INFO L226 Difference]: Without dead ends: 46 [2020-06-22 08:52:01,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-06-22 08:52:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-06-22 08:52:01,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-06-22 08:52:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 08:52:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2020-06-22 08:52:01,772 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 15 [2020-06-22 08:52:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:52:01,773 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2020-06-22 08:52:01,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 08:52:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2020-06-22 08:52:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 08:52:01,773 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:52:01,774 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:01,774 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:52:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:01,774 INFO L82 PathProgramCache]: Analyzing trace with hash -393243502, now seen corresponding path program 1 times [2020-06-22 08:52:01,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:01,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:01,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:01,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:01,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:01,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:52:01,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:52:01,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:02,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 27 conjunts are in the unsatisfiable core [2020-06-22 08:52:02,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:02,022 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 08:52:02,022 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:02,034 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:02,035 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. [2020-06-22 08:52:02,035 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 08:52:02,147 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:02,148 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-06-22 08:52:02,149 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:52:02,169 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:02,172 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 08:52:02,173 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2020-06-22 08:52:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:02,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:52:02,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2020-06-22 08:52:02,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 08:52:02,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 08:52:02,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-06-22 08:52:02,241 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 15 states. [2020-06-22 08:52:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:03,061 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2020-06-22 08:52:03,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-06-22 08:52:03,062 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2020-06-22 08:52:03,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:52:03,063 INFO L225 Difference]: With dead ends: 60 [2020-06-22 08:52:03,063 INFO L226 Difference]: Without dead ends: 59 [2020-06-22 08:52:03,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2020-06-22 08:52:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-06-22 08:52:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2020-06-22 08:52:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-06-22 08:52:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2020-06-22 08:52:03,075 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 15 [2020-06-22 08:52:03,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:52:03,075 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. [2020-06-22 08:52:03,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 08:52:03,075 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2020-06-22 08:52:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-06-22 08:52:03,076 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:52:03,076 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:03,076 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:52:03,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:03,077 INFO L82 PathProgramCache]: Analyzing trace with hash 930982950, now seen corresponding path program 2 times [2020-06-22 08:52:03,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:03,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:03,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:03,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:03,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:03,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:52:03,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:52:03,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 08:52:03,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 08:52:03,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 08:52:03,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 30 conjunts are in the unsatisfiable core [2020-06-22 08:52:03,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:03,374 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:03,375 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 08:52:03,375 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:03,390 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 08:52:03,390 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:52:03,390 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-06-22 08:52:03,409 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 08:52:03,410 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:03,415 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:03,415 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:52:03,416 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-06-22 08:52:03,510 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:03,511 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 08:52:03,512 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:52:03,522 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:03,525 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 08:52:03,525 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:23 [2020-06-22 08:52:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:52:03,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:52:03,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2020-06-22 08:52:03,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 08:52:03,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 08:52:03,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2020-06-22 08:52:03,590 INFO L87 Difference]: Start difference. First operand 53 states and 79 transitions. Second operand 17 states. [2020-06-22 08:52:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:04,725 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. [2020-06-22 08:52:04,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-06-22 08:52:04,726 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2020-06-22 08:52:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:52:04,726 INFO L225 Difference]: With dead ends: 61 [2020-06-22 08:52:04,726 INFO L226 Difference]: Without dead ends: 60 [2020-06-22 08:52:04,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2020-06-22 08:52:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-06-22 08:52:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2020-06-22 08:52:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 08:52:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-06-22 08:52:04,736 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 19 [2020-06-22 08:52:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:52:04,736 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-06-22 08:52:04,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 08:52:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2020-06-22 08:52:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 08:52:04,737 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:52:04,737 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:04,738 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:52:04,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:04,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1731453001, now seen corresponding path program 2 times [2020-06-22 08:52:04,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:04,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:04,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:04,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:52:04,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:04,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:52:04,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:52:04,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 08:52:05,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 08:52:05,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 08:52:05,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 33 conjunts are in the unsatisfiable core [2020-06-22 08:52:05,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:05,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:52:05,030 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 08:52:05,030 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:05,040 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:05,040 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:52:05,041 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 [2020-06-22 08:52:05,072 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 08:52:05,072 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:05,082 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:05,083 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:52:05,083 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2020-06-22 08:52:05,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:52:05,129 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-06-22 08:52:05,130 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:05,141 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:05,142 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. [2020-06-22 08:52:05,142 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2020-06-22 08:52:05,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:52:05,268 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:05,268 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-06-22 08:52:05,269 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:52:05,288 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:05,291 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:52:05,292 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:27 [2020-06-22 08:52:05,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:52:05,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:52:05,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2020-06-22 08:52:05,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 08:52:05,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 08:52:05,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-06-22 08:52:05,456 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 18 states. [2020-06-22 08:52:06,239 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 [2020-06-22 08:52:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:10,325 INFO L93 Difference]: Finished difference Result 90 states and 129 transitions. [2020-06-22 08:52:10,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-06-22 08:52:10,325 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2020-06-22 08:52:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:52:10,326 INFO L225 Difference]: With dead ends: 90 [2020-06-22 08:52:10,326 INFO L226 Difference]: Without dead ends: 53 [2020-06-22 08:52:10,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=270, Invalid=1136, Unknown=0, NotChecked=0, Total=1406 [2020-06-22 08:52:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-06-22 08:52:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-06-22 08:52:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-06-22 08:52:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2020-06-22 08:52:10,339 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 20 [2020-06-22 08:52:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:52:10,339 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2020-06-22 08:52:10,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 08:52:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2020-06-22 08:52:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-06-22 08:52:10,340 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:52:10,340 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:10,340 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== [2020-06-22 08:52:10,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1656157372, now seen corresponding path program 1 times [2020-06-22 08:52:10,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:10,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:10,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:52:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 08:52:10,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:52:10,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:52:10,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:10,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 37 conjunts are in the unsatisfiable core [2020-06-22 08:52:10,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:10,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:52:10,554 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 08:52:10,555 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:10,565 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:10,566 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:52:10,566 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2020-06-22 08:52:10,595 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 08:52:10,595 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:10,604 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:10,605 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:52:10,605 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2020-06-22 08:52:10,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:52:10,634 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-06-22 08:52:10,634 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:10,643 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:10,644 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. [2020-06-22 08:52:10,644 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2020-06-22 08:52:10,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:52:10,732 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:10,732 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-06-22 08:52:10,734 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:52:10,748 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:10,749 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:52:10,750 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:27 [2020-06-22 08:52:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-06-22 08:52:10,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:52:10,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2020-06-22 08:52:10,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 08:52:10,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 08:52:10,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-06-22 08:52:10,857 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand 17 states. [2020-06-22 08:52:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:16,889 INFO L93 Difference]: Finished difference Result 137 states and 191 transitions. [2020-06-22 08:52:16,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-06-22 08:52:16,889 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2020-06-22 08:52:16,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:52:16,890 INFO L225 Difference]: With dead ends: 137 [2020-06-22 08:52:16,890 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 08:52:16,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2020-06-22 08:52:16,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 08:52:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 08:52:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 08:52:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 08:52:16,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-06-22 08:52:16,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:52:16,892 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:52:16,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 08:52:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:52:16,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 08:52:16,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 08:52:17,142 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 226 [2020-06-22 08:52:17,330 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 211 [2020-06-22 08:52:18,649 WARN L188 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 224 DAG size of output: 84 [2020-06-22 08:52:20,133 WARN L188 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 211 DAG size of output: 103 [2020-06-22 08:52:20,136 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2020-06-22 08:52:20,136 INFO L448 ceAbstractionStarter]: For program point L29-2(lines 26 41) no Hoare annotation was computed. [2020-06-22 08:52:20,136 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-06-22 08:52:20,136 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 21) no Hoare annotation was computed. [2020-06-22 08:52:20,137 INFO L444 ceAbstractionStarter]: At program point L19-5(lines 19 21) the Hoare annotation is: (let ((.cse25 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse6 (<= 1 ULTIMATE.start_cstrpbrk_~s1.offset)) (.cse5 (= ULTIMATE.start_cstrpbrk_~s2.offset 0)) (.cse7 (= ULTIMATE.start_main_~length1~0 .cse25)) (.cse21 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse18 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse8 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse9 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~scanp~0.base))) (.cse10 (<= 1 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse11 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse13 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse17 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse14 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse15 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s1.base))) (.cse16 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse24 (select |#length| ULTIMATE.start_cstrpbrk_~s1.base)) (.cse26 (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse0 (= 0 (select .cse26 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse25 (- 1))))) (.cse22 (<= (+ ULTIMATE.start_cstrpbrk_~s1.offset 1) .cse24)) (.cse3 (and .cse6 .cse5 .cse7 (or (<= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse25)) (and .cse21 (= 0 (select .cse26 ULTIMATE.start_main_~nondetString1~0.offset)))) .cse18 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse16)) (.cse1 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~s2.base) (- 1))) 0)))) (.cse2 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~scanp~0.base) (+ (select |#length| ULTIMATE.start_cstrpbrk_~scanp~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse19 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~scanp~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_cstrpbrk_~scanp~0.base)) (<= ULTIMATE.start_cstrpbrk_~scanp~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= 1 ULTIMATE.start_main_~length2~0)))) (.cse20 (= ULTIMATE.start_cstrpbrk_~scanp~0.offset 0)) (.cse23 (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s1.base) (+ .cse24 (- 1))) 0))) (or (and .cse0 (let ((.cse4 (= 0 ULTIMATE.start_cstrpbrk_~sc~0))) (or (and (<= (+ ULTIMATE.start_cstrpbrk_~scanp~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~scanp~0.base)) (<= 1 ULTIMATE.start_cstrpbrk_~scanp~0.offset) .cse1 .cse2 .cse3 (not .cse4)) (and .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse4 .cse17 .cse1 .cse2 .cse18 .cse19 .cse20))) .cse21 .cse22 .cse23) (and .cse0 .cse21 .cse22 (<= ULTIMATE.start_cstrpbrk_~s1.offset 1) (and .cse3 .cse1 .cse2 .cse19 .cse20) .cse23))))) [2020-06-22 08:52:20,137 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 18 22) the Hoare annotation is: (let ((.cse17 (select |#length| ULTIMATE.start_cstrpbrk_~s1.base)) (.cse18 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse0 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset .cse18 (- 1))))) (.cse9 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse14 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse10 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse1 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base) (+ ULTIMATE.start_main_~nondetString2~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~s2.base) (- 1))) 0)))) (.cse2 (= ULTIMATE.start_cstrpbrk_~s2.offset 0)) (.cse3 (= ULTIMATE.start_main_~length1~0 .cse18)) (.cse4 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse5 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse6 (<= 1 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse7 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse8 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse11 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse12 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s1.base))) (.cse15 (<= (+ ULTIMATE.start_cstrpbrk_~s1.offset 1) .cse17)) (.cse13 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse16 (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s1.base) (+ .cse17 (- 1))) 0))) (or (and .cse0 (and .cse1 (and (= 0 ULTIMATE.start_cstrpbrk_~sc~0) (<= 1 ULTIMATE.start_cstrpbrk_~scanp~0.offset) (and (<= 1 ULTIMATE.start_cstrpbrk_~s1.offset) .cse2 .cse3 .cse4 .cse5 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~scanp~0.base)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~scanp~0.base) (+ (select |#length| ULTIMATE.start_cstrpbrk_~scanp~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset))) (<= ULTIMATE.start_cstrpbrk_~scanp~0.offset (select |#length| ULTIMATE.start_cstrpbrk_~scanp~0.base))) .cse14 .cse15 .cse16) (and .cse0 .cse9 .cse14 .cse10 .cse1 (and .cse2 .cse3 (= 0 ULTIMATE.start_cstrpbrk_~s1.offset) .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse15 .cse13) .cse16)))) [2020-06-22 08:52:20,138 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 32 34) no Hoare annotation was computed. [2020-06-22 08:52:20,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 08:52:20,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 08:52:20,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 08:52:20,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:52:20,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:52:20,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. [2020-06-22 08:52:20,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 38) no Hoare annotation was computed. [2020-06-22 08:52:20,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-06-22 08:52:20,138 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-06-22 08:52:20,139 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 21) no Hoare annotation was computed. [2020-06-22 08:52:20,139 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-06-22 08:52:20,139 INFO L448 ceAbstractionStarter]: For program point L18-3(lines 18 22) no Hoare annotation was computed. [2020-06-22 08:52:20,139 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2020-06-22 08:52:20,139 INFO L448 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-06-22 08:52:20,139 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 08:52:20,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,158 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,158 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,158 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,158 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,162 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,162 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,162 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,162 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,181 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:20,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:20,190 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,191 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:20,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:20,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:20,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:20,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,200 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,201 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,202 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,203 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,206 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:20,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:20,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,214 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:20,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:20,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:20,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:20,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:20,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:20,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:20,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:52:20 BasicIcfg [2020-06-22 08:52:20,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 08:52:20,233 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 08:52:20,233 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 08:52:20,237 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 08:52:20,238 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:52:20,238 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 08:51:56" (1/5) ... [2020-06-22 08:52:20,238 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@577a3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:52:20, skipping insertion in model container [2020-06-22 08:52:20,238 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:52:20,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (2/5) ... [2020-06-22 08:52:20,239 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@577a3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:52:20, skipping insertion in model container [2020-06-22 08:52:20,239 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:52:20,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:51:56" (3/5) ... [2020-06-22 08:52:20,239 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@577a3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:52:20, skipping insertion in model container [2020-06-22 08:52:20,239 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:52:20,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:51:57" (4/5) ... [2020-06-22 08:52:20,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@577a3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:52:20, skipping insertion in model container [2020-06-22 08:52:20,240 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:52:20,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:52:20" (5/5) ... [2020-06-22 08:52:20,241 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:52:20,263 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:52:20,263 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 08:52:20,264 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 08:52:20,264 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:52:20,264 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:52:20,264 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:52:20,264 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 08:52:20,264 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:52:20,264 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 08:52:20,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-06-22 08:52:20,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 08:52:20,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:52:20,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:52:20,276 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:52:20,277 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:52:20,277 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 08:52:20,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-06-22 08:52:20,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 08:52:20,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:52:20,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:52:20,278 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:52:20,279 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:52:20,284 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue [144] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start_main_~length2~0] 10#L29true [77] L29-->L29-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 7#L29-2true [105] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 14#L32-1true [121] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4|) 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4|)) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_4|) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4| 1)) (> |v_ULTIMATE.start_main_#t~malloc7.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_4|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_4|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 5#L37true [87] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 23#L37-1true [145] L37-1-->L19-6: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_6 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_6) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_7|, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_8|, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_6, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_8|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, #length=|v_#length_12|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_6, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_8, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_6, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_6, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, #memory_int, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 20#L19-6true [2020-06-22 08:52:20,284 INFO L796 eck$LassoCheckResult]: Loop: 20#L19-6true [98] L19-6-->L18-1: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_4) (= |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| v_ULTIMATE.start_cstrpbrk_~s1.offset_4) (= v_ULTIMATE.start_cstrpbrk_~s1.base_3 |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_4} OutVars{ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2|, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset, ULTIMATE.start_cstrpbrk_~s1.base] 8#L18-1true [146] L18-1-->L18-3: Formula: (and (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| v_ULTIMATE.start_cstrpbrk_~c~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_9, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem1] 4#L18-3true [134] L18-3-->L19-5: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (< 0 v_ULTIMATE.start_cstrpbrk_~c~0_5)) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_7|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 22#L19-5true [99] L19-5-->L19-1: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4 |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4 (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5)) InVars {ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~scanp~0.offset] 9#L19-1true [149] L19-1-->L19-3: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| v_ULTIMATE.start_cstrpbrk_~sc~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|)) (= 1 (select |v_#valid_23| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~mem3] 6#L19-3true [90] L19-3-->L19-6: Formula: (= 0 v_ULTIMATE.start_cstrpbrk_~sc~0_4) InVars {ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_4} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_6|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_#t~mem3] 20#L19-6true [2020-06-22 08:52:20,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash 789492424, now seen corresponding path program 1 times [2020-06-22 08:52:20,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:20,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:20,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:20,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:20,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:20,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:20,315 INFO L82 PathProgramCache]: Analyzing trace with hash -462880909, now seen corresponding path program 1 times [2020-06-22 08:52:20,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:20,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:20,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:20,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:20,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:20,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:20,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1159872762, now seen corresponding path program 1 times [2020-06-22 08:52:20,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:20,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:20,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:20,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:20,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:20,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:52:20,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 08:52:20,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 08:52:20,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:52:20,568 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 8 states. [2020-06-22 08:52:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:20,898 INFO L93 Difference]: Finished difference Result 34 states and 59 transitions. [2020-06-22 08:52:20,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 08:52:20,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 59 transitions. [2020-06-22 08:52:20,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 08:52:20,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 13 states and 21 transitions. [2020-06-22 08:52:20,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 08:52:20,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 08:52:20,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 21 transitions. [2020-06-22 08:52:20,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:52:20,905 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2020-06-22 08:52:20,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 21 transitions. [2020-06-22 08:52:20,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-06-22 08:52:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 08:52:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 21 transitions. [2020-06-22 08:52:20,908 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2020-06-22 08:52:20,908 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 21 transitions. [2020-06-22 08:52:20,908 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 08:52:20,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 21 transitions. [2020-06-22 08:52:20,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 08:52:20,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:52:20,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:52:20,909 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:52:20,909 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:52:20,910 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRY [144] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start_main_~length2~0] 90#L29 [104] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 86#L29-2 [105] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 87#L32-1 [121] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4|) 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4|)) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_4|) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4| 1)) (> |v_ULTIMATE.start_main_#t~malloc7.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_4|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_4|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 81#L37 [87] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 82#L37-1 [145] L37-1-->L19-6: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_6 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_6) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_7|, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_8|, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_6, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_8|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, #length=|v_#length_12|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_6, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_8, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_6, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_6, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, #memory_int, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 84#L19-6 [2020-06-22 08:52:20,910 INFO L796 eck$LassoCheckResult]: Loop: 84#L19-6 [98] L19-6-->L18-1: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_4) (= |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| v_ULTIMATE.start_cstrpbrk_~s1.offset_4) (= v_ULTIMATE.start_cstrpbrk_~s1.base_3 |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_4} OutVars{ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2|, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset, ULTIMATE.start_cstrpbrk_~s1.base] 88#L18-1 [146] L18-1-->L18-3: Formula: (and (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| v_ULTIMATE.start_cstrpbrk_~c~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_9, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem1] 79#L18-3 [134] L18-3-->L19-5: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (< 0 v_ULTIMATE.start_cstrpbrk_~c~0_5)) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_7|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 80#L19-5 [99] L19-5-->L19-1: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4 |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4 (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5)) InVars {ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~scanp~0.offset] 89#L19-1 [149] L19-1-->L19-3: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| v_ULTIMATE.start_cstrpbrk_~sc~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|)) (= 1 (select |v_#valid_23| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~mem3] 83#L19-3 [90] L19-3-->L19-6: Formula: (= 0 v_ULTIMATE.start_cstrpbrk_~sc~0_4) InVars {ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_4} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_6|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_4|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_#t~mem3] 84#L19-6 [2020-06-22 08:52:20,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:20,911 INFO L82 PathProgramCache]: Analyzing trace with hash 814427491, now seen corresponding path program 1 times [2020-06-22 08:52:20,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:20,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:20,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:20,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:20,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:20,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:20,923 INFO L82 PathProgramCache]: Analyzing trace with hash -462880909, now seen corresponding path program 2 times [2020-06-22 08:52:20,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:20,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:20,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:20,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:20,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:20,931 INFO L82 PathProgramCache]: Analyzing trace with hash -113173675, now seen corresponding path program 1 times [2020-06-22 08:52:20,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:20,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:20,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:20,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:52:20,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:21,289 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2020-06-22 08:52:21,393 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:52:21,395 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:52:21,395 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:52:21,395 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:52:21,395 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:52:21,395 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:52:21,395 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:52:21,395 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:52:21,396 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 08:52:21,396 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:52:21,396 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:52:21,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,680 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2020-06-22 08:52:21,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:21,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:22,175 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:52:22,181 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:52:22,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:22,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:22,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:22,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:22,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:22,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:22,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:22,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:22,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:22,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:22,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:22,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:22,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:22,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:22,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:22,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:22,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:22,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:22,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:22,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:22,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:22,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:22,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:22,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:22,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:22,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:22,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:22,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:22,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:22,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:22,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:22,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:22,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:22,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:22,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:22,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:22,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:22,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:22,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:22,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:22,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:22,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:22,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:22,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:22,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:22,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:22,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:22,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:22,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:22,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:22,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:22,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:22,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:22,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:22,298 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:52:22,325 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 08:52:22,326 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2020-06-22 08:52:22,328 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:52:22,329 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:52:22,330 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:52:22,330 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1) = -1*ULTIMATE.start_cstrpbrk_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1 Supporting invariants [] [2020-06-22 08:52:22,371 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2020-06-22 08:52:22,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:22,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:22,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:52:22,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:22,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 08:52:22,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:22,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 08:52:22,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:22,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 08:52:22,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:22,669 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 08:52:22,673 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2020-06-22 08:52:22,676 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 21 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-06-22 08:52:22,943 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 21 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 22 states and 34 transitions. Complement of second has 8 states. [2020-06-22 08:52:22,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 08:52:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 08:52:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2020-06-22 08:52:22,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 6 letters. [2020-06-22 08:52:22,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:52:22,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 12 letters. Loop has 6 letters. [2020-06-22 08:52:22,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:52:22,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 12 letters. [2020-06-22 08:52:22,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:52:22,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 34 transitions. [2020-06-22 08:52:22,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 08:52:22,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 31 transitions. [2020-06-22 08:52:22,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-06-22 08:52:22,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 08:52:22,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 31 transitions. [2020-06-22 08:52:22,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:52:22,956 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 31 transitions. [2020-06-22 08:52:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 31 transitions. [2020-06-22 08:52:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-06-22 08:52:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 08:52:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2020-06-22 08:52:22,957 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 30 transitions. [2020-06-22 08:52:22,957 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 30 transitions. [2020-06-22 08:52:22,958 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 08:52:22,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 30 transitions. [2020-06-22 08:52:22,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 08:52:22,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:52:22,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:52:22,959 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:22,959 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 08:52:22,960 INFO L794 eck$LassoCheckResult]: Stem: 303#ULTIMATE.startENTRY [144] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start_main_~length2~0] 302#L29 [104] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 297#L29-2 [105] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 298#L32-1 [121] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4|) 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4|)) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_4|) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4| 1)) (> |v_ULTIMATE.start_main_#t~malloc7.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_4|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_4|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 290#L37 [87] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 291#L37-1 [145] L37-1-->L19-6: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_6 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_6) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_7|, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_8|, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_6, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_8|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, #length=|v_#length_12|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_6, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_8, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_6, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_6, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, #memory_int, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 304#L19-6 [98] L19-6-->L18-1: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_4) (= |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| v_ULTIMATE.start_cstrpbrk_~s1.offset_4) (= v_ULTIMATE.start_cstrpbrk_~s1.base_3 |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_4} OutVars{ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2|, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset, ULTIMATE.start_cstrpbrk_~s1.base] 299#L18-1 [146] L18-1-->L18-3: Formula: (and (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| v_ULTIMATE.start_cstrpbrk_~c~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_9, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem1] 287#L18-3 [135] L18-3-->L19-5: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (> 0 v_ULTIMATE.start_cstrpbrk_~c~0_5)) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_7|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 289#L19-5 [2020-06-22 08:52:22,960 INFO L796 eck$LassoCheckResult]: Loop: 289#L19-5 [99] L19-5-->L19-1: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4 |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4 (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5)) InVars {ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~scanp~0.offset] 300#L19-1 [149] L19-1-->L19-3: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| v_ULTIMATE.start_cstrpbrk_~sc~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|)) (= 1 (select |v_#valid_23| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~mem3] 292#L19-3 [140] L19-3-->L20: Formula: (< 0 v_ULTIMATE.start_cstrpbrk_~sc~0_5) InVars {ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_7|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_#t~mem3] 293#L20 [142] L20-->L19-5: Formula: (> v_ULTIMATE.start_cstrpbrk_~c~0_7 v_ULTIMATE.start_cstrpbrk_~sc~0_7) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_7} OutVars{ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_7} AuxVars[] AssignedVars[] 289#L19-5 [2020-06-22 08:52:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:22,961 INFO L82 PathProgramCache]: Analyzing trace with hash 339228116, now seen corresponding path program 1 times [2020-06-22 08:52:22,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:22,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:22,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:22,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:22,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:22,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:22,983 INFO L82 PathProgramCache]: Analyzing trace with hash 4020501, now seen corresponding path program 1 times [2020-06-22 08:52:22,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:22,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:22,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:22,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:22,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:22,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:22,989 INFO L82 PathProgramCache]: Analyzing trace with hash 787508584, now seen corresponding path program 1 times [2020-06-22 08:52:22,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:22,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:22,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:22,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:22,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:23,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:52:23,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:52:23,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:52:23,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:52:23,058 INFO L87 Difference]: Start difference. First operand 18 states and 30 transitions. cyclomatic complexity: 14 Second operand 4 states. [2020-06-22 08:52:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:23,124 INFO L93 Difference]: Finished difference Result 34 states and 51 transitions. [2020-06-22 08:52:23,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:52:23,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 51 transitions. [2020-06-22 08:52:23,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-06-22 08:52:23,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 51 transitions. [2020-06-22 08:52:23,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-06-22 08:52:23,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-06-22 08:52:23,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 51 transitions. [2020-06-22 08:52:23,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:52:23,130 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 51 transitions. [2020-06-22 08:52:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 51 transitions. [2020-06-22 08:52:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2020-06-22 08:52:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 08:52:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2020-06-22 08:52:23,132 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 45 transitions. [2020-06-22 08:52:23,132 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 45 transitions. [2020-06-22 08:52:23,132 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 08:52:23,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 45 transitions. [2020-06-22 08:52:23,133 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 08:52:23,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:52:23,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:52:23,134 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:23,134 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 08:52:23,135 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY [144] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start_main_~length2~0] 370#L29 [104] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 363#L29-2 [105] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 364#L32-1 [121] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4|) 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4|)) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_4|) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4| 1)) (> |v_ULTIMATE.start_main_#t~malloc7.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_4|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_4|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 355#L37 [87] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 356#L37-1 [145] L37-1-->L19-6: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_6 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_6) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_7|, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_8|, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_6, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_8|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, #length=|v_#length_12|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_6, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_8, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_6, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_6, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, #memory_int, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 373#L19-6 [98] L19-6-->L18-1: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_4) (= |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| v_ULTIMATE.start_cstrpbrk_~s1.offset_4) (= v_ULTIMATE.start_cstrpbrk_~s1.base_3 |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_4} OutVars{ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2|, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset, ULTIMATE.start_cstrpbrk_~s1.base] 365#L18-1 [146] L18-1-->L18-3: Formula: (and (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| v_ULTIMATE.start_cstrpbrk_~c~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_9, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem1] 350#L18-3 [134] L18-3-->L19-5: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (< 0 v_ULTIMATE.start_cstrpbrk_~c~0_5)) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_7|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 352#L19-5 [2020-06-22 08:52:23,135 INFO L796 eck$LassoCheckResult]: Loop: 352#L19-5 [99] L19-5-->L19-1: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4 |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4 (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5)) InVars {ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~scanp~0.offset] 377#L19-1 [149] L19-1-->L19-3: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| v_ULTIMATE.start_cstrpbrk_~sc~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|)) (= 1 (select |v_#valid_23| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~mem3] 357#L19-3 [140] L19-3-->L20: Formula: (< 0 v_ULTIMATE.start_cstrpbrk_~sc~0_5) InVars {ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_7|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_#t~mem3] 358#L20 [142] L20-->L19-5: Formula: (> v_ULTIMATE.start_cstrpbrk_~c~0_7 v_ULTIMATE.start_cstrpbrk_~sc~0_7) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_7} OutVars{ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_7} AuxVars[] AssignedVars[] 352#L19-5 [2020-06-22 08:52:23,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:23,135 INFO L82 PathProgramCache]: Analyzing trace with hash 339228115, now seen corresponding path program 1 times [2020-06-22 08:52:23,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:23,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:23,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:23,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:23,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:23,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:23,154 INFO L82 PathProgramCache]: Analyzing trace with hash 4020501, now seen corresponding path program 2 times [2020-06-22 08:52:23,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:23,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:23,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:23,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:23,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:23,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:23,161 INFO L82 PathProgramCache]: Analyzing trace with hash 786585063, now seen corresponding path program 1 times [2020-06-22 08:52:23,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:23,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:23,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:23,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:52:23,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:23,676 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2020-06-22 08:52:23,807 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-06-22 08:52:23,809 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:52:23,809 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:52:23,809 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:52:23,809 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:52:23,810 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:52:23,810 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:52:23,810 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:52:23,810 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:52:23,810 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 08:52:23,810 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:52:23,810 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:52:23,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:23,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:23,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:23,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:23,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:23,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:23,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:23,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:23,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:23,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:23,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:24,115 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2020-06-22 08:52:24,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:24,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:24,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:24,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:24,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:24,548 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:52:24,548 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:52:24,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:24,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:24,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:24,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:24,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:24,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:24,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:24,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:24,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:24,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:24,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:24,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:24,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:24,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:24,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:24,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:24,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:24,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:24,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:24,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:24,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:24,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:24,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:24,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,567 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:24,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:24,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:24,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:24,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:24,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:24,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:24,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:24,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:24,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:24,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:24,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:24,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:24,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:24,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:24,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:24,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:24,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:24,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:24,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:24,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:24,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:24,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:24,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:24,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:24,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:24,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:24,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:24,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:24,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:24,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:24,638 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:52:24,648 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:52:24,648 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 08:52:24,648 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:52:24,649 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:52:24,649 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:52:24,650 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2020-06-22 08:52:24,683 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2020-06-22 08:52:24,685 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:24,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 08:52:24,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:24,762 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 08:52:24,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:24,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 08:52:24,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:24,955 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 08:52:24,955 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates [2020-06-22 08:52:24,955 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 28 states and 45 transitions. cyclomatic complexity: 20 Second operand 6 states. [2020-06-22 08:52:25,210 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 28 states and 45 transitions. cyclomatic complexity: 20. Second operand 6 states. Result 43 states and 68 transitions. Complement of second has 9 states. [2020-06-22 08:52:25,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 08:52:25,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 08:52:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2020-06-22 08:52:25,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 08:52:25,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:52:25,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 13 letters. Loop has 4 letters. [2020-06-22 08:52:25,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:52:25,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 9 letters. Loop has 8 letters. [2020-06-22 08:52:25,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:52:25,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 68 transitions. [2020-06-22 08:52:25,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 08:52:25,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 28 states and 44 transitions. [2020-06-22 08:52:25,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-06-22 08:52:25,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 08:52:25,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 44 transitions. [2020-06-22 08:52:25,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 08:52:25,217 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 44 transitions. [2020-06-22 08:52:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 44 transitions. [2020-06-22 08:52:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2020-06-22 08:52:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 08:52:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2020-06-22 08:52:25,219 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 38 transitions. [2020-06-22 08:52:25,219 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 38 transitions. [2020-06-22 08:52:25,219 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 08:52:25,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 38 transitions. [2020-06-22 08:52:25,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 08:52:25,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:52:25,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:52:25,220 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:25,221 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 08:52:25,221 INFO L794 eck$LassoCheckResult]: Stem: 593#ULTIMATE.startENTRY [144] ULTIMATE.startENTRY-->L29: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start_main_~length2~0] 591#L29 [104] L29-->L29-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 585#L29-2 [105] L29-2-->L32-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 586#L32-1 [121] L32-1-->L37: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4|) 0) (< |v_ULTIMATE.start_main_#t~malloc7.base_4| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc6.base_4|)) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc7.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= |v_ULTIMATE.start_main_#t~malloc7.offset_4| 0) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_4|) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= |v_#valid_6| (store .cse0 |v_ULTIMATE.start_main_#t~malloc7.base_4| 1)) (> |v_ULTIMATE.start_main_#t~malloc7.base_4| 0) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_4|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_4|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc7.offset] 577#L37 [87] L37-->L37-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 578#L37-1 [145] L37-1-->L19-6: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_6 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_6) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_12|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_7|, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_8|, ULTIMATE.start_cstrpbrk_#in~s2.base=|v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|, ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_6, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_8|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, #length=|v_#length_12|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_6, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_8, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_6|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_6, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_6, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#in~s2.base, ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#in~s1.base, ULTIMATE.start_cstrpbrk_#t~post0.base, #memory_int, ULTIMATE.start_cstrpbrk_#in~s1.offset, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 594#L19-6 [98] L19-6-->L18-1: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_4) (= |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| v_ULTIMATE.start_cstrpbrk_~s1.offset_4) (= v_ULTIMATE.start_cstrpbrk_~s1.base_3 |v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2| 1))) InVars {ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_4} OutVars{ULTIMATE.start_cstrpbrk_~s1.offset=v_ULTIMATE.start_cstrpbrk_~s1.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_2|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_2|, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s1.offset, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~post0.offset, ULTIMATE.start_cstrpbrk_~s1.base] 587#L18-1 [146] L18-1-->L18-3: Formula: (and (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem1_7| v_ULTIMATE.start_cstrpbrk_~c~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|) (= 1 (select |v_#valid_20| |v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} OutVars{ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_9|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_9, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_7|, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_#t~mem1] 573#L18-3 [135] L18-3-->L19-5: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (> 0 v_ULTIMATE.start_cstrpbrk_~c~0_5)) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_3, ULTIMATE.start_cstrpbrk_#t~post0.base=|v_ULTIMATE.start_cstrpbrk_#t~post0.base_7|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_5, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem1=|v_ULTIMATE.start_cstrpbrk_#t~mem1_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_3, ULTIMATE.start_cstrpbrk_#t~post0.offset=|v_ULTIMATE.start_cstrpbrk_#t~post0.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post0.base, ULTIMATE.start_cstrpbrk_#t~mem1, ULTIMATE.start_cstrpbrk_~scanp~0.offset, ULTIMATE.start_cstrpbrk_#t~post0.offset] 576#L19-5 [2020-06-22 08:52:25,221 INFO L796 eck$LassoCheckResult]: Loop: 576#L19-5 [99] L19-5-->L19-1: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4 |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|) (= v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4 (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| 1)) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.base_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5) (= |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2| v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5)) InVars {ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_5, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_2|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_2|, ULTIMATE.start_cstrpbrk_~scanp~0.base=v_ULTIMATE.start_cstrpbrk_~scanp~0.base_4, ULTIMATE.start_cstrpbrk_~scanp~0.offset=v_ULTIMATE.start_cstrpbrk_~scanp~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_~scanp~0.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~scanp~0.offset] 588#L19-1 [149] L19-1-->L19-3: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| (select (select |v_#memory_int_10| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|) |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_7| v_ULTIMATE.start_cstrpbrk_~sc~0_9) (<= 0 |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|) (<= (+ |v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8| 1) (select |v_#length_14| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|)) (= 1 (select |v_#valid_23| |v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|))) InVars {ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_9|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_9, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_8|, #length=|v_#length_14|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~sc~0, ULTIMATE.start_cstrpbrk_#t~mem3] 579#L19-3 [140] L19-3-->L20: Formula: (< 0 v_ULTIMATE.start_cstrpbrk_~sc~0_5) InVars {ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_5} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_7|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_6|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_#t~mem3] 580#L20 [143] L20-->L19-5: Formula: (< v_ULTIMATE.start_cstrpbrk_~c~0_7 v_ULTIMATE.start_cstrpbrk_~sc~0_7) InVars {ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_7} OutVars{ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~sc~0=v_ULTIMATE.start_cstrpbrk_~sc~0_7} AuxVars[] AssignedVars[] 576#L19-5 [2020-06-22 08:52:25,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:25,222 INFO L82 PathProgramCache]: Analyzing trace with hash 339228116, now seen corresponding path program 2 times [2020-06-22 08:52:25,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:25,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:25,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:25,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:25,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:25,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:25,239 INFO L82 PathProgramCache]: Analyzing trace with hash 4020502, now seen corresponding path program 1 times [2020-06-22 08:52:25,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:25,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:25,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:52:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:25,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:25,244 INFO L82 PathProgramCache]: Analyzing trace with hash 787508585, now seen corresponding path program 1 times [2020-06-22 08:52:25,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:25,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:25,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:25,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:25,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:52:25,676 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2020-06-22 08:52:25,801 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-06-22 08:52:25,803 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:52:25,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:52:25,803 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:52:25,803 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:52:25,804 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:52:25,804 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:52:25,804 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:52:25,804 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:52:25,804 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 08:52:25,804 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:52:25,804 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:52:25,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:25,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:25,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:25,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:25,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:25,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:26,167 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-06-22 08:52:26,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:26,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:26,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:26,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:26,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:26,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:26,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:26,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:26,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:26,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:52:26,617 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:52:26,617 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:52:26,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:26,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:26,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:26,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:26,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:26,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:26,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:26,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:26,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:26,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:26,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:26,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:26,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:26,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:26,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:26,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:26,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:26,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:26,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:26,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:26,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:26,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:26,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:26,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:26,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:26,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:26,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:26,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:26,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:52:26,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:26,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:26,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:26,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:52:26,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:52:26,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:26,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:26,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:26,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:26,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:26,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:26,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:26,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:26,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:26,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:26,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:26,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:26,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:26,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:26,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:26,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:26,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:26,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:26,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:26,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:26,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:26,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:26,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:26,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:26,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:26,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:26,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:26,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:26,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:26,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:26,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:26,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:26,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:26,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:26,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:26,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:26,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:26,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:26,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:26,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:26,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:26,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:26,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:26,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:26,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:26,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:26,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:26,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:26,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:26,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:26,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:26,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:26,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:26,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:26,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:26,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:26,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:26,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:26,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:26,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:26,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:26,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:26,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:26,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:26,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:52:26,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:52:26,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:52:26,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:52:26,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:52:26,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:52:26,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:52:26,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:52:26,683 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:52:26,696 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:52:26,696 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 08:52:26,697 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:52:26,697 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:52:26,698 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:52:26,698 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_3, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc7.base)_3 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2020-06-22 08:52:26,732 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2020-06-22 08:52:26,734 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:26,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:26,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 08:52:26,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:26,808 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 08:52:26,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:26,957 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 08:52:26,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:26,959 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 08:52:26,959 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates [2020-06-22 08:52:26,959 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 24 states and 38 transitions. cyclomatic complexity: 16 Second operand 6 states. [2020-06-22 08:52:27,184 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 24 states and 38 transitions. cyclomatic complexity: 16. Second operand 6 states. Result 41 states and 62 transitions. Complement of second has 9 states. [2020-06-22 08:52:27,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 08:52:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 08:52:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2020-06-22 08:52:27,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 08:52:27,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:52:27,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 13 letters. Loop has 4 letters. [2020-06-22 08:52:27,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:52:27,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 9 letters. Loop has 8 letters. [2020-06-22 08:52:27,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:52:27,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 62 transitions. [2020-06-22 08:52:27,190 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:52:27,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-06-22 08:52:27,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 08:52:27,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 08:52:27,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 08:52:27,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:52:27,191 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:52:27,191 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:52:27,191 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:52:27,191 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 08:52:27,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:52:27,191 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:52:27,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 08:52:27,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:52:27 BasicIcfg [2020-06-22 08:52:27,197 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 08:52:27,198 INFO L168 Benchmark]: Toolchain (without parser) took 30929.36 ms. Allocated memory was 514.9 MB in the beginning and 769.7 MB in the end (delta: 254.8 MB). Free memory was 440.1 MB in the beginning and 484.1 MB in the end (delta: -44.1 MB). Peak memory consumption was 210.7 MB. Max. memory is 50.3 GB. [2020-06-22 08:52:27,198 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:52:27,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.91 ms. Allocated memory was 514.9 MB in the beginning and 561.5 MB in the end (delta: 46.7 MB). Free memory was 439.5 MB in the beginning and 530.4 MB in the end (delta: -90.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. [2020-06-22 08:52:27,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.39 ms. Allocated memory is still 561.5 MB. Free memory was 530.4 MB in the beginning and 527.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. [2020-06-22 08:52:27,200 INFO L168 Benchmark]: Boogie Preprocessor took 27.31 ms. Allocated memory is still 561.5 MB. Free memory was 527.3 MB in the beginning and 525.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-06-22 08:52:27,200 INFO L168 Benchmark]: RCFGBuilder took 325.96 ms. Allocated memory is still 561.5 MB. Free memory was 525.6 MB in the beginning and 506.3 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:52:27,201 INFO L168 Benchmark]: BlockEncodingV2 took 125.30 ms. Allocated memory is still 561.5 MB. Free memory was 506.3 MB in the beginning and 497.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 50.3 GB. [2020-06-22 08:52:27,201 INFO L168 Benchmark]: TraceAbstraction took 23123.11 ms. Allocated memory was 561.5 MB in the beginning and 729.8 MB in the end (delta: 168.3 MB). Free memory was 497.1 MB in the beginning and 554.4 MB in the end (delta: -57.2 MB). Peak memory consumption was 252.8 MB. Max. memory is 50.3 GB. [2020-06-22 08:52:27,201 INFO L168 Benchmark]: BuchiAutomizer took 6964.01 ms. Allocated memory was 729.8 MB in the beginning and 769.7 MB in the end (delta: 39.8 MB). Free memory was 554.4 MB in the beginning and 484.1 MB in the end (delta: 70.3 MB). Peak memory consumption was 110.1 MB. Max. memory is 50.3 GB. [2020-06-22 08:52:27,205 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 30 locations, 36 edges - StatisticsResult: Encoded RCFG 21 locations, 38 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.55 ms. Allocated memory is still 514.9 MB. Free memory is still 459.6 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 314.91 ms. Allocated memory was 514.9 MB in the beginning and 561.5 MB in the end (delta: 46.7 MB). Free memory was 439.5 MB in the beginning and 530.4 MB in the end (delta: -90.9 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.39 ms. Allocated memory is still 561.5 MB. Free memory was 530.4 MB in the beginning and 527.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 27.31 ms. Allocated memory is still 561.5 MB. Free memory was 527.3 MB in the beginning and 525.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 325.96 ms. Allocated memory is still 561.5 MB. Free memory was 525.6 MB in the beginning and 506.3 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 125.30 ms. Allocated memory is still 561.5 MB. Free memory was 506.3 MB in the beginning and 497.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 50.3 GB. * TraceAbstraction took 23123.11 ms. Allocated memory was 561.5 MB in the beginning and 729.8 MB in the end (delta: 168.3 MB). Free memory was 497.1 MB in the beginning and 554.4 MB in the end (delta: -57.2 MB). Peak memory consumption was 252.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 6964.01 ms. Allocated memory was 729.8 MB in the beginning and 769.7 MB in the end (delta: 39.8 MB). Free memory was 554.4 MB in the beginning and 484.1 MB in the end (delta: 70.3 MB). Peak memory consumption was 110.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 38]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant [2020-06-22 08:52:27,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,218 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,219 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,233 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && (((\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0) && (0 == sc && 1 <= scanp) && ((((((((((((1 <= s1 && s2 == 0) && length1 == unknown-#length-unknown[nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 == \valid[scanp]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[s2]) && 1 == \valid[s1]) && 1 == \valid[nondetString2]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[scanp][unknown-#length-unknown[scanp] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && scanp <= unknown-#length-unknown[scanp]) && !(nondetString1 == nondetString2)) && s1 + 1 <= unknown-#length-unknown[s1]) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) || ((((((0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && nondetString1 == 0) && !(nondetString1 == nondetString2)) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && ((((((((((s2 == 0 && length1 == unknown-#length-unknown[nondetString1]) && 0 == s1) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s2]) && 1 == \valid[s1]) && s1 + 1 <= unknown-#length-unknown[s1]) && 1 == \valid[nondetString2]) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) - InvariantResult [Line: 19]: Loop Invariant [2020-06-22 08:52:27,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,234 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,234 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,234 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,234 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,234 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,235 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:27,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:27,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:27,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,238 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:27,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:27,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:27,240 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,241 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,241 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,241 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,241 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,241 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,242 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,242 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,242 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,242 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,242 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,243 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,243 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,243 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,243 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,244 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,244 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,244 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,244 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,245 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,246 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,250 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,250 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,250 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:27,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:27,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:27,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:27,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:27,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:52:27,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-06-22 08:52:27,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:52:27,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:52:27,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && ((((((scanp + 1 <= unknown-#length-unknown[scanp] && 1 <= scanp) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[scanp][unknown-#length-unknown[scanp] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && (((((((((((((1 <= s1 && s2 == 0) && length1 == unknown-#length-unknown[nondetString1]) && (2 <= nondetString1 + unknown-#length-unknown[nondetString1] || (!(nondetString1 == nondetString2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]))) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 == \valid[scanp]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[s2]) && 1 == \valid[s1]) && 1 == \valid[nondetString2]) && !(0 == sc)) || ((((((((s2 == 0 && (((((((((1 <= s1 && length1 == unknown-#length-unknown[nondetString1]) && 1 <= length2) && 1 == \valid[scanp]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && 1 == \valid[s2]) && 1 == \valid[s1]) && 1 == \valid[nondetString2]) && 0 == sc) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[scanp][unknown-#length-unknown[scanp] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && unknown-#length-unknown[nondetString2] == length2) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[scanp][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[scanp]) && scanp <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && scanp == 0))) && !(nondetString1 == nondetString2)) && s1 + 1 <= unknown-#length-unknown[s1]) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) || (((((0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && !(nondetString1 == nondetString2)) && s1 + 1 <= unknown-#length-unknown[s1]) && s1 <= 1) && (((((((((((((((((1 <= s1 && s2 == 0) && length1 == unknown-#length-unknown[nondetString1]) && (2 <= nondetString1 + unknown-#length-unknown[nondetString1] || (!(nondetString1 == nondetString2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]))) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 == \valid[scanp]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[s2]) && 1 == \valid[s1]) && 1 == \valid[nondetString2]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString2~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~nondetString2~0.offset + unknown-#length-unknown[s2] + -1] == 0)) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (ULTIMATE.start_main_~nondetString2~0.offset <= 0 && 0 == unknown-#memory_int-unknown[scanp][unknown-#length-unknown[scanp] + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((0 == unknown-#memory_int-unknown[scanp][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[scanp]) && scanp <= ULTIMATE.start_main_~nondetString2~0.offset) && 1 <= ULTIMATE.start_main_~length2~0)) && scanp == 0) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 8 error locations. SAFE Result, 22.9s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 15.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 124 SDtfs, 1324 SDslu, 881 SDs, 0 SdLazy, 1986 SolverSat, 405 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=17, 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.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 64 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 40 NumberOfFragments, 811 HoareAnnotationTreeSize, 2 FomulaSimplifications, 4765 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 2 FomulaSimplificationsInter, 23782 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 324 ConstructedInterpolants, 42 QuantifiedInterpolants, 62211 SizeOfPredicates, 78 NumberOfNonLiveVariables, 880 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 27 InterpolantComputations, 13 PerfectInterpolantSequences, 25/102 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[alloca(length1 * sizeof(char))] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length2 * sizeof(char))] + -1 * scanp and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length2 * sizeof(char))] + -1 * scanp and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. Construction of modules took 0.4s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 56 SDtfs, 220 SDslu, 334 SDs, 0 SdLazy, 623 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital203 mio100 ax100 hnf100 lsp97 ukn81 mio100 lsp34 div100 bol100 ite100 ukn100 eq190 hnf88 smp100 dnf100 smp100 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 08:51:53.009 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 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 !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 08:52:27.493 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check