YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 04:11:25,191 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 04:11:25,193 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 04:11:25,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 04:11:25,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 04:11:25,205 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 04:11:25,206 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 04:11:25,208 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 04:11:25,209 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 04:11:25,210 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 04:11:25,211 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 04:11:25,211 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 04:11:25,212 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 04:11:25,213 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 04:11:25,214 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 04:11:25,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 04:11:25,215 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 04:11:25,217 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 04:11:25,219 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 04:11:25,221 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 04:11:25,222 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 04:11:25,223 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 04:11:25,225 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 04:11:25,225 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 04:11:25,225 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 04:11:25,226 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 04:11:25,226 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 04:11:25,227 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 04:11:25,227 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 04:11:25,228 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 04:11:25,229 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 04:11:25,229 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 04:11:25,230 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 04:11:25,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 04:11:25,231 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 04:11:25,231 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 04:11:25,231 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 04:11:25,232 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 04:11:25,233 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 04:11:25,233 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 04:11:25,247 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 04:11:25,248 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 04:11:25,249 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 04:11:25,249 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 04:11:25,249 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 04:11:25,249 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:11:25,249 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 04:11:25,250 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 04:11:25,250 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 04:11:25,250 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 04:11:25,250 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 04:11:25,250 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 04:11:25,250 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 04:11:25,251 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 04:11:25,251 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 04:11:25,251 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 04:11:25,251 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 04:11:25,251 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 04:11:25,252 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 04:11:25,252 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 04:11:25,252 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 04:11:25,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 04:11:25,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 04:11:25,252 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 04:11:25,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 04:11:25,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 04:11:25,253 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 04:11:25,253 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 04:11:25,253 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 04:11:25,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 04:11:25,291 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 04:11:25,295 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 04:11:25,296 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 04:11:25,297 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 04:11:25,297 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 04:11:25,513 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/1f49250a612042b39be212cb58a4d552/FLAG184e300e3 [2020-06-22 04:11:25,848 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 04:11:25,849 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 04:11:25,849 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 04:11:25,856 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/1f49250a612042b39be212cb58a4d552/FLAG184e300e3 [2020-06-22 04:11:26,260 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/1f49250a612042b39be212cb58a4d552 [2020-06-22 04:11:26,271 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 04:11:26,273 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 04:11:26,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 04:11:26,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 04:11:26,278 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 04:11:26,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:11:26" (1/1) ... [2020-06-22 04:11:26,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9879c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26, skipping insertion in model container [2020-06-22 04:11:26,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 04:11:26" (1/1) ... [2020-06-22 04:11:26,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 04:11:26,309 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 04:11:26,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:11:26,541 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 04:11:26,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 04:11:26,577 INFO L195 MainTranslator]: Completed translation [2020-06-22 04:11:26,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26 WrapperNode [2020-06-22 04:11:26,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 04:11:26,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 04:11:26,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 04:11:26,579 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 04:11:26,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26" (1/1) ... [2020-06-22 04:11:26,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26" (1/1) ... [2020-06-22 04:11:26,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 04:11:26,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 04:11:26,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 04:11:26,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 04:11:26,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26" (1/1) ... [2020-06-22 04:11:26,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26" (1/1) ... [2020-06-22 04:11:26,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26" (1/1) ... [2020-06-22 04:11:26,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26" (1/1) ... [2020-06-22 04:11:26,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26" (1/1) ... [2020-06-22 04:11:26,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26" (1/1) ... [2020-06-22 04:11:26,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26" (1/1) ... [2020-06-22 04:11:26,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 04:11:26,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 04:11:26,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 04:11:26,651 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 04:11:26,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26" (1/1) ... No working directory specified, using /export/starexec/sandbox2/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 04:11:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 04:11:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-06-22 04:11:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 04:11:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 04:11:26,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 04:11:27,075 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 04:11:27,075 INFO L286 CfgBuilder]: Removed 12 assue(true) statements. [2020-06-22 04:11:27,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:11:27 BoogieIcfgContainer [2020-06-22 04:11:27,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 04:11:27,077 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 04:11:27,077 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 04:11:27,079 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 04:11:27,080 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:11:27" (1/1) ... [2020-06-22 04:11:27,099 INFO L313 BlockEncoder]: Initial Icfg 44 locations, 51 edges [2020-06-22 04:11:27,101 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 04:11:27,102 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 04:11:27,102 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 04:11:27,103 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 04:11:27,105 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 04:11:27,106 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 04:11:27,106 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 04:11:27,132 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 04:11:27,164 INFO L200 BlockEncoder]: SBE split 20 edges [2020-06-22 04:11:27,169 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 04:11:27,171 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:11:27,214 INFO L100 BaseMinimizeStates]: Removed 20 edges and 10 locations by large block encoding [2020-06-22 04:11:27,217 INFO L70 RemoveSinkStates]: Removed 4 edges and 2 locations by removing sink states [2020-06-22 04:11:27,218 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 04:11:27,218 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:11:27,223 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 04:11:27,223 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 04:11:27,224 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 04:11:27,224 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 04:11:27,224 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 04:11:27,225 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 04:11:27,225 INFO L313 BlockEncoder]: Encoded RCFG 31 locations, 64 edges [2020-06-22 04:11:27,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:11:27 BasicIcfg [2020-06-22 04:11:27,226 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 04:11:27,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 04:11:27,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 04:11:27,231 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 04:11:27,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 04:11:26" (1/4) ... [2020-06-22 04:11:27,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f06e275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:11:27, skipping insertion in model container [2020-06-22 04:11:27,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26" (2/4) ... [2020-06-22 04:11:27,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f06e275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 04:11:27, skipping insertion in model container [2020-06-22 04:11:27,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:11:27" (3/4) ... [2020-06-22 04:11:27,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f06e275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:11:27, skipping insertion in model container [2020-06-22 04:11:27,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:11:27" (4/4) ... [2020-06-22 04:11:27,234 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:11:27,244 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 04:11:27,252 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-06-22 04:11:27,268 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-06-22 04:11:27,297 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:11:27,298 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 04:11:27,298 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 04:11:27,298 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:11:27,298 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:11:27,298 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:11:27,299 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 04:11:27,299 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:11:27,299 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 04:11:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-06-22 04:11:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 04:11:27,319 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:27,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 04:11:27,321 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:27,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:27,326 INFO L82 PathProgramCache]: Analyzing trace with hash 7340499, now seen corresponding path program 1 times [2020-06-22 04:11:27,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:27,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:27,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:27,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:27,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:27,482 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 04:11:27,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:11:27,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 04:11:27,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 04:11:27,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:11:27,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:11:27,506 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2020-06-22 04:11:27,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:11:27,652 INFO L93 Difference]: Finished difference Result 51 states and 109 transitions. [2020-06-22 04:11:27,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:11:27,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 04:11:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:11:27,668 INFO L225 Difference]: With dead ends: 51 [2020-06-22 04:11:27,668 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 04:11:27,672 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 04:11:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 04:11:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 04:11:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 04:11:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 58 transitions. [2020-06-22 04:11:27,711 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 58 transitions. Word has length 4 [2020-06-22 04:11:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:11:27,712 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 58 transitions. [2020-06-22 04:11:27,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 04:11:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 58 transitions. [2020-06-22 04:11:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 04:11:27,712 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:27,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 04:11:27,713 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:27,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:27,713 INFO L82 PathProgramCache]: Analyzing trace with hash 7340501, now seen corresponding path program 1 times [2020-06-22 04:11:27,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:27,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:27,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:27,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:27,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:27,749 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 04:11:27,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:11:27,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 04:11:27,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 04:11:27,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 04:11:27,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 04:11:27,752 INFO L87 Difference]: Start difference. First operand 29 states and 58 transitions. Second operand 4 states. [2020-06-22 04:11:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:11:27,839 INFO L93 Difference]: Finished difference Result 31 states and 58 transitions. [2020-06-22 04:11:27,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 04:11:27,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-06-22 04:11:27,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:11:27,841 INFO L225 Difference]: With dead ends: 31 [2020-06-22 04:11:27,841 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 04:11:27,842 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 04:11:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 04:11:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 04:11:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 04:11:27,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 56 transitions. [2020-06-22 04:11:27,848 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 56 transitions. Word has length 4 [2020-06-22 04:11:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:11:27,848 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 56 transitions. [2020-06-22 04:11:27,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 04:11:27,848 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 56 transitions. [2020-06-22 04:11:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 04:11:27,849 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:27,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 04:11:27,849 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:27,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:27,849 INFO L82 PathProgramCache]: Analyzing trace with hash 7340502, now seen corresponding path program 1 times [2020-06-22 04:11:27,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:27,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:27,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:27,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:27,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:27,880 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 04:11:27,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:11:27,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 04:11:27,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 04:11:27,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:11:27,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:11:27,882 INFO L87 Difference]: Start difference. First operand 29 states and 56 transitions. Second operand 3 states. [2020-06-22 04:11:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:11:27,985 INFO L93 Difference]: Finished difference Result 29 states and 56 transitions. [2020-06-22 04:11:27,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:11:27,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 04:11:27,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:11:27,986 INFO L225 Difference]: With dead ends: 29 [2020-06-22 04:11:27,986 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 04:11:27,987 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 04:11:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 04:11:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 04:11:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 04:11:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 54 transitions. [2020-06-22 04:11:27,992 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 54 transitions. Word has length 4 [2020-06-22 04:11:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:11:27,992 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 54 transitions. [2020-06-22 04:11:27,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 04:11:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 54 transitions. [2020-06-22 04:11:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 04:11:27,993 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:27,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:11:27,993 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:27,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:27,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1697218165, now seen corresponding path program 1 times [2020-06-22 04:11:27,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:27,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:27,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:28,048 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 04:11:28,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:11:28,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 04:11:28,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 04:11:28,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 04:11:28,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 04:11:28,049 INFO L87 Difference]: Start difference. First operand 27 states and 54 transitions. Second operand 5 states. [2020-06-22 04:11:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:11:28,240 INFO L93 Difference]: Finished difference Result 49 states and 97 transitions. [2020-06-22 04:11:28,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 04:11:28,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-06-22 04:11:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:11:28,241 INFO L225 Difference]: With dead ends: 49 [2020-06-22 04:11:28,241 INFO L226 Difference]: Without dead ends: 47 [2020-06-22 04:11:28,242 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 04:11:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-06-22 04:11:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2020-06-22 04:11:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 04:11:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 64 transitions. [2020-06-22 04:11:28,249 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 64 transitions. Word has length 8 [2020-06-22 04:11:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:11:28,250 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 64 transitions. [2020-06-22 04:11:28,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 04:11:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 64 transitions. [2020-06-22 04:11:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 04:11:28,251 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:28,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:11:28,251 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:28,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:28,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1697218166, now seen corresponding path program 1 times [2020-06-22 04:11:28,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:28,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:28,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:28,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:28,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:28,387 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 04:11:28,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:11:28,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 04:11:28,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 04:11:28,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 04:11:28,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 04:11:28,389 INFO L87 Difference]: Start difference. First operand 30 states and 64 transitions. Second operand 7 states. [2020-06-22 04:11:29,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:11:29,019 INFO L93 Difference]: Finished difference Result 137 states and 293 transitions. [2020-06-22 04:11:29,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 04:11:29,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-06-22 04:11:29,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:11:29,023 INFO L225 Difference]: With dead ends: 137 [2020-06-22 04:11:29,023 INFO L226 Difference]: Without dead ends: 135 [2020-06-22 04:11:29,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-06-22 04:11:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-06-22 04:11:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 37. [2020-06-22 04:11:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 04:11:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 78 transitions. [2020-06-22 04:11:29,033 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 78 transitions. Word has length 8 [2020-06-22 04:11:29,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:11:29,034 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 78 transitions. [2020-06-22 04:11:29,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 04:11:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 78 transitions. [2020-06-22 04:11:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 04:11:29,034 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:29,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:11:29,035 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1697218163, now seen corresponding path program 1 times [2020-06-22 04:11:29,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:29,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:29,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:29,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:29,094 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 04:11:29,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:11:29,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 04:11:29,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 04:11:29,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 04:11:29,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 04:11:29,096 INFO L87 Difference]: Start difference. First operand 37 states and 78 transitions. Second operand 6 states. [2020-06-22 04:11:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:11:29,420 INFO L93 Difference]: Finished difference Result 99 states and 227 transitions. [2020-06-22 04:11:29,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 04:11:29,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-06-22 04:11:29,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:11:29,439 INFO L225 Difference]: With dead ends: 99 [2020-06-22 04:11:29,439 INFO L226 Difference]: Without dead ends: 97 [2020-06-22 04:11:29,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-06-22 04:11:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-06-22 04:11:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 35. [2020-06-22 04:11:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 04:11:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 66 transitions. [2020-06-22 04:11:29,447 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 66 transitions. Word has length 8 [2020-06-22 04:11:29,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:11:29,447 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 66 transitions. [2020-06-22 04:11:29,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 04:11:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 66 transitions. [2020-06-22 04:11:29,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 04:11:29,448 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:29,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:11:29,448 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:29,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:29,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1725847317, now seen corresponding path program 1 times [2020-06-22 04:11:29,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:29,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:29,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:29,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:29,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:29,524 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 04:11:29,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:11:29,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 04:11:29,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 04:11:29,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 04:11:29,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 04:11:29,525 INFO L87 Difference]: Start difference. First operand 35 states and 66 transitions. Second operand 7 states. [2020-06-22 04:11:29,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:11:29,711 INFO L93 Difference]: Finished difference Result 50 states and 97 transitions. [2020-06-22 04:11:29,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 04:11:29,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-06-22 04:11:29,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:11:29,712 INFO L225 Difference]: With dead ends: 50 [2020-06-22 04:11:29,712 INFO L226 Difference]: Without dead ends: 48 [2020-06-22 04:11:29,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-06-22 04:11:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-06-22 04:11:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2020-06-22 04:11:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 04:11:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2020-06-22 04:11:29,718 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 54 transitions. Word has length 8 [2020-06-22 04:11:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:11:29,718 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 54 transitions. [2020-06-22 04:11:29,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 04:11:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 54 transitions. [2020-06-22 04:11:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 04:11:29,719 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:29,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:11:29,719 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:29,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1469556797, now seen corresponding path program 1 times [2020-06-22 04:11:29,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:29,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:29,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:29,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:29,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:29,763 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 04:11:29,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:11:29,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 04:11:29,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 04:11:29,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 04:11:29,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 04:11:29,764 INFO L87 Difference]: Start difference. First operand 28 states and 54 transitions. Second operand 4 states. [2020-06-22 04:11:29,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:11:29,838 INFO L93 Difference]: Finished difference Result 28 states and 54 transitions. [2020-06-22 04:11:29,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 04:11:29,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-06-22 04:11:29,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:11:29,839 INFO L225 Difference]: With dead ends: 28 [2020-06-22 04:11:29,839 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 04:11:29,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 04:11:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 04:11:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 04:11:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 04:11:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 48 transitions. [2020-06-22 04:11:29,845 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 48 transitions. Word has length 11 [2020-06-22 04:11:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:11:29,845 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 48 transitions. [2020-06-22 04:11:29,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 04:11:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 48 transitions. [2020-06-22 04:11:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 04:11:29,846 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:29,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:11:29,846 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:29,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1469556799, now seen corresponding path program 1 times [2020-06-22 04:11:29,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:29,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:29,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:29,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:29,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:29,910 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 04:11:29,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:11:29,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 04:11:29,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 04:11:29,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 04:11:29,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 04:11:29,911 INFO L87 Difference]: Start difference. First operand 25 states and 48 transitions. Second operand 6 states. [2020-06-22 04:11:30,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:11:30,043 INFO L93 Difference]: Finished difference Result 38 states and 78 transitions. [2020-06-22 04:11:30,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 04:11:30,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-06-22 04:11:30,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:11:30,044 INFO L225 Difference]: With dead ends: 38 [2020-06-22 04:11:30,044 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 04:11:30,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 04:11:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 04:11:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-06-22 04:11:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 04:11:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 67 transitions. [2020-06-22 04:11:30,050 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 67 transitions. Word has length 11 [2020-06-22 04:11:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:11:30,050 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 67 transitions. [2020-06-22 04:11:30,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 04:11:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 67 transitions. [2020-06-22 04:11:30,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 04:11:30,051 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:30,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:11:30,051 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:30,052 INFO L82 PathProgramCache]: Analyzing trace with hash -190702542, now seen corresponding path program 1 times [2020-06-22 04:11:30,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:30,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:30,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:30,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:30,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:11:30,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:11:30,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 04:11:30,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 04:11:30,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:11:30,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:11:30,076 INFO L87 Difference]: Start difference. First operand 32 states and 67 transitions. Second operand 3 states. [2020-06-22 04:11:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:11:30,128 INFO L93 Difference]: Finished difference Result 58 states and 127 transitions. [2020-06-22 04:11:30,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:11:30,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-06-22 04:11:30,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:11:30,129 INFO L225 Difference]: With dead ends: 58 [2020-06-22 04:11:30,129 INFO L226 Difference]: Without dead ends: 36 [2020-06-22 04:11:30,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 04:11:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-06-22 04:11:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-06-22 04:11:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 04:11:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 70 transitions. [2020-06-22 04:11:30,135 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 70 transitions. Word has length 15 [2020-06-22 04:11:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:11:30,135 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 70 transitions. [2020-06-22 04:11:30,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 04:11:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 70 transitions. [2020-06-22 04:11:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 04:11:30,136 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:30,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:11:30,136 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:30,136 INFO L82 PathProgramCache]: Analyzing trace with hash -190672751, now seen corresponding path program 1 times [2020-06-22 04:11:30,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:30,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:30,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:30,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:30,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:11:30,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:11:30,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 04:11:30,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 04:11:30,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:11:30,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:11:30,161 INFO L87 Difference]: Start difference. First operand 35 states and 70 transitions. Second operand 3 states. [2020-06-22 04:11:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:11:30,219 INFO L93 Difference]: Finished difference Result 60 states and 125 transitions. [2020-06-22 04:11:30,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:11:30,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-06-22 04:11:30,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:11:30,220 INFO L225 Difference]: With dead ends: 60 [2020-06-22 04:11:30,220 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 04:11:30,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 04:11:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 04:11:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-06-22 04:11:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 04:11:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 66 transitions. [2020-06-22 04:11:30,226 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 66 transitions. Word has length 15 [2020-06-22 04:11:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:11:30,226 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 66 transitions. [2020-06-22 04:11:30,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 04:11:30,226 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 66 transitions. [2020-06-22 04:11:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-06-22 04:11:30,227 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:30,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:11:30,227 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:30,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:30,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1615887654, now seen corresponding path program 1 times [2020-06-22 04:11:30,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:30,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:30,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:30,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:11:30,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:11:30,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 04:11:30,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 04:11:30,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 04:11:30,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 04:11:30,302 INFO L87 Difference]: Start difference. First operand 35 states and 66 transitions. Second operand 7 states. [2020-06-22 04:11:30,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:11:30,480 INFO L93 Difference]: Finished difference Result 65 states and 123 transitions. [2020-06-22 04:11:30,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 04:11:30,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-06-22 04:11:30,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:11:30,482 INFO L225 Difference]: With dead ends: 65 [2020-06-22 04:11:30,482 INFO L226 Difference]: Without dead ends: 37 [2020-06-22 04:11:30,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-06-22 04:11:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-06-22 04:11:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-06-22 04:11:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 04:11:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 67 transitions. [2020-06-22 04:11:30,488 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 67 transitions. Word has length 16 [2020-06-22 04:11:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:11:30,488 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 67 transitions. [2020-06-22 04:11:30,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 04:11:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 67 transitions. [2020-06-22 04:11:30,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 04:11:30,489 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:30,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:11:30,489 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:30,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:30,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1417732906, now seen corresponding path program 1 times [2020-06-22 04:11:30,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:30,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:30,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:30,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:30,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 04:11:30,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:11:30,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 04:11:30,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 04:11:30,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 04:11:30,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 04:11:30,596 INFO L87 Difference]: Start difference. First operand 36 states and 67 transitions. Second operand 8 states. [2020-06-22 04:11:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:11:31,172 INFO L93 Difference]: Finished difference Result 141 states and 262 transitions. [2020-06-22 04:11:31,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-06-22 04:11:31,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-06-22 04:11:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:11:31,174 INFO L225 Difference]: With dead ends: 141 [2020-06-22 04:11:31,174 INFO L226 Difference]: Without dead ends: 101 [2020-06-22 04:11:31,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-06-22 04:11:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-06-22 04:11:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 37. [2020-06-22 04:11:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 04:11:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 68 transitions. [2020-06-22 04:11:31,181 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 68 transitions. Word has length 17 [2020-06-22 04:11:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:11:31,181 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 68 transitions. [2020-06-22 04:11:31,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 04:11:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 68 transitions. [2020-06-22 04:11:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 04:11:31,182 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:11:31,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:11:31,183 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:11:31,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:11:31,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1369682581, now seen corresponding path program 1 times [2020-06-22 04:11:31,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:11:31,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:11:31,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:31,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:31,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:11:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:11:31,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:11:31,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/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 04:11:31,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:11:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:11:31,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 30 conjunts are in the unsatisfiable core [2020-06-22 04:11:31,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:11:31,501 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 11 treesize of output 7 [2020-06-22 04:11:31,501 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:11:31,514 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:11:31,515 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:11:31,515 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2020-06-22 04:11:31,546 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:11:31,546 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-06-22 04:11:31,547 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:11:31,554 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:11:31,554 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:11:31,554 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2020-06-22 04:11:31,594 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 22 treesize of output 21 [2020-06-22 04:11:31,595 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:11:31,603 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:11:31,605 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 04:11:31,605 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2020-06-22 04:11:31,660 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2020-06-22 04:11:31,661 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:11:31,666 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:11:31,667 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:11:31,667 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2020-06-22 04:11:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 04:11:31,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 04:11:31,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2020-06-22 04:11:31,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-06-22 04:11:31,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-06-22 04:11:31,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-06-22 04:11:31,719 INFO L87 Difference]: Start difference. First operand 37 states and 68 transitions. Second operand 14 states. [2020-06-22 04:11:34,222 WARN L188 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 46 [2020-06-22 04:11:40,053 WARN L188 SmtUtils]: Spent 5.81 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2020-06-22 04:11:41,749 WARN L188 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 48 [2020-06-22 04:11:44,242 WARN L188 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2020-06-22 04:11:46,952 WARN L188 SmtUtils]: Spent 2.68 s on a formula simplification that was a NOOP. DAG size: 55 [2020-06-22 04:11:53,059 WARN L188 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2020-06-22 04:11:58,273 WARN L188 SmtUtils]: Spent 5.04 s on a formula simplification that was a NOOP. DAG size: 59 [2020-06-22 04:12:06,628 WARN L188 SmtUtils]: Spent 8.32 s on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2020-06-22 04:12:12,105 WARN L188 SmtUtils]: Spent 5.36 s on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2020-06-22 04:12:19,955 WARN L188 SmtUtils]: Spent 7.83 s on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-06-22 04:12:25,010 WARN L188 SmtUtils]: Spent 4.82 s on a formula simplification that was a NOOP. DAG size: 51 [2020-06-22 04:12:26,652 WARN L188 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 51 [2020-06-22 04:12:32,302 WARN L188 SmtUtils]: Spent 5.63 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2020-06-22 04:12:35,196 WARN L188 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2020-06-22 04:12:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:12:36,315 INFO L93 Difference]: Finished difference Result 231 states and 433 transitions. [2020-06-22 04:12:36,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-06-22 04:12:36,316 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2020-06-22 04:12:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:12:36,317 INFO L225 Difference]: With dead ends: 231 [2020-06-22 04:12:36,317 INFO L226 Difference]: Without dead ends: 204 [2020-06-22 04:12:36,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 63.9s TimeCoverageRelationStatistics Valid=825, Invalid=2367, Unknown=0, NotChecked=0, Total=3192 [2020-06-22 04:12:36,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-06-22 04:12:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 45. [2020-06-22 04:12:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 04:12:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 76 transitions. [2020-06-22 04:12:36,328 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 76 transitions. Word has length 17 [2020-06-22 04:12:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:12:36,329 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 76 transitions. [2020-06-22 04:12:36,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-06-22 04:12:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 76 transitions. [2020-06-22 04:12:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 04:12:36,329 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:12:36,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:12:36,330 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:12:36,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:12:36,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1117830253, now seen corresponding path program 1 times [2020-06-22 04:12:36,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:12:36,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:12:36,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:36,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:12:36,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:12:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:12:36,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:12:36,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/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 04:12:36,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:12:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:12:36,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 04:12:36,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:12:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:12:36,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 04:12:36,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-06-22 04:12:36,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 04:12:36,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 04:12:36,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 04:12:36,457 INFO L87 Difference]: Start difference. First operand 45 states and 76 transitions. Second operand 7 states. [2020-06-22 04:12:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:12:36,599 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2020-06-22 04:12:36,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 04:12:36,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-06-22 04:12:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:12:36,600 INFO L225 Difference]: With dead ends: 49 [2020-06-22 04:12:36,600 INFO L226 Difference]: Without dead ends: 43 [2020-06-22 04:12:36,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-06-22 04:12:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-06-22 04:12:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2020-06-22 04:12:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-06-22 04:12:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 66 transitions. [2020-06-22 04:12:36,607 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 66 transitions. Word has length 17 [2020-06-22 04:12:36,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:12:36,608 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 66 transitions. [2020-06-22 04:12:36,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 04:12:36,608 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 66 transitions. [2020-06-22 04:12:36,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 04:12:36,608 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:12:36,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:12:36,609 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:12:36,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:12:36,609 INFO L82 PathProgramCache]: Analyzing trace with hash 292940193, now seen corresponding path program 1 times [2020-06-22 04:12:36,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:12:36,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:12:36,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:36,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:12:36,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:12:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:12:36,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:12:36,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 04:12:36,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 04:12:36,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 04:12:36,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 04:12:36,667 INFO L87 Difference]: Start difference. First operand 38 states and 66 transitions. Second operand 7 states. [2020-06-22 04:12:36,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:12:36,915 INFO L93 Difference]: Finished difference Result 104 states and 208 transitions. [2020-06-22 04:12:36,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 04:12:36,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-06-22 04:12:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:12:36,916 INFO L225 Difference]: With dead ends: 104 [2020-06-22 04:12:36,916 INFO L226 Difference]: Without dead ends: 81 [2020-06-22 04:12:36,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-06-22 04:12:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-06-22 04:12:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2020-06-22 04:12:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-06-22 04:12:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 120 transitions. [2020-06-22 04:12:36,927 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 120 transitions. Word has length 18 [2020-06-22 04:12:36,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:12:36,927 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 120 transitions. [2020-06-22 04:12:36,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 04:12:36,927 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 120 transitions. [2020-06-22 04:12:36,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 04:12:36,928 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:12:36,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:12:36,928 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:12:36,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:12:36,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2067947555, now seen corresponding path program 1 times [2020-06-22 04:12:36,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:12:36,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:12:36,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:36,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:12:36,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:12:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:12:36,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:12:36,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/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 04:12:36,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:12:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:12:37,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 04:12:37,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:12:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:12:37,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 04:12:37,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-06-22 04:12:37,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 04:12:37,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 04:12:37,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 04:12:37,058 INFO L87 Difference]: Start difference. First operand 59 states and 120 transitions. Second operand 7 states. [2020-06-22 04:12:37,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:12:37,203 INFO L93 Difference]: Finished difference Result 96 states and 204 transitions. [2020-06-22 04:12:37,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 04:12:37,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-06-22 04:12:37,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:12:37,204 INFO L225 Difference]: With dead ends: 96 [2020-06-22 04:12:37,204 INFO L226 Difference]: Without dead ends: 94 [2020-06-22 04:12:37,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-06-22 04:12:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-06-22 04:12:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 59. [2020-06-22 04:12:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-06-22 04:12:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 117 transitions. [2020-06-22 04:12:37,213 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 117 transitions. Word has length 18 [2020-06-22 04:12:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:12:37,214 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 117 transitions. [2020-06-22 04:12:37,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 04:12:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 117 transitions. [2020-06-22 04:12:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 04:12:37,215 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:12:37,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:12:37,215 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:12:37,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:12:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2067947556, now seen corresponding path program 1 times [2020-06-22 04:12:37,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:12:37,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:12:37,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:37,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:12:37,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:12:37,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:12:37,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:12:37,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-06-22 04:12:37,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 04:12:37,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 04:12:37,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-06-22 04:12:37,338 INFO L87 Difference]: Start difference. First operand 59 states and 117 transitions. Second operand 9 states. [2020-06-22 04:12:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:12:37,672 INFO L93 Difference]: Finished difference Result 152 states and 315 transitions. [2020-06-22 04:12:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 04:12:37,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-06-22 04:12:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:12:37,673 INFO L225 Difference]: With dead ends: 152 [2020-06-22 04:12:37,674 INFO L226 Difference]: Without dead ends: 99 [2020-06-22 04:12:37,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-06-22 04:12:37,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-06-22 04:12:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 52. [2020-06-22 04:12:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-06-22 04:12:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 107 transitions. [2020-06-22 04:12:37,681 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 107 transitions. Word has length 18 [2020-06-22 04:12:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:12:37,681 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 107 transitions. [2020-06-22 04:12:37,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 04:12:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 107 transitions. [2020-06-22 04:12:37,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 04:12:37,682 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:12:37,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:12:37,682 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:12:37,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:12:37,683 INFO L82 PathProgramCache]: Analyzing trace with hash -702199092, now seen corresponding path program 1 times [2020-06-22 04:12:37,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:12:37,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:12:37,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:37,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:12:37,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:12:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:12:37,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:12:37,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 04:12:37,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 04:12:37,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 04:12:37,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 04:12:37,776 INFO L87 Difference]: Start difference. First operand 52 states and 107 transitions. Second operand 5 states. [2020-06-22 04:12:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:12:37,955 INFO L93 Difference]: Finished difference Result 113 states and 236 transitions. [2020-06-22 04:12:37,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 04:12:37,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-06-22 04:12:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:12:37,978 INFO L225 Difference]: With dead ends: 113 [2020-06-22 04:12:37,978 INFO L226 Difference]: Without dead ends: 72 [2020-06-22 04:12:37,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 04:12:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-06-22 04:12:37,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2020-06-22 04:12:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-06-22 04:12:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 127 transitions. [2020-06-22 04:12:37,988 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 127 transitions. Word has length 18 [2020-06-22 04:12:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:12:37,989 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 127 transitions. [2020-06-22 04:12:37,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 04:12:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 127 transitions. [2020-06-22 04:12:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 04:12:37,990 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:12:37,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:12:37,990 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:12:37,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:12:37,990 INFO L82 PathProgramCache]: Analyzing trace with hash -702407629, now seen corresponding path program 1 times [2020-06-22 04:12:37,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:12:37,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:12:37,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:37,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:12:37,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:12:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:12:38,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:12:38,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/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 04:12:38,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:12:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:12:38,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 28 conjunts are in the unsatisfiable core [2020-06-22 04:12:38,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:12:38,296 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 04:12:38,296 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:12:38,307 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:12:38,308 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 04:12:38,308 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-06-22 04:12:38,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 04:12:38,353 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2020-06-22 04:12:38,353 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:12:38,375 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:12:38,376 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 04:12:38,376 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:38 [2020-06-22 04:12:38,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 04:12:38,423 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 27 treesize of output 26 [2020-06-22 04:12:38,424 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:12:38,443 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:12:38,445 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 04:12:38,445 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:49, output treesize:45 [2020-06-22 04:12:38,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 04:12:38,522 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:12:38,523 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 30 treesize of output 21 [2020-06-22 04:12:38,526 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 04:12:38,543 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:12:38,547 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:12:38,547 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:52, output treesize:31 [2020-06-22 04:12:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:12:38,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:12:38,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-06-22 04:12:38,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 04:12:38,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 04:12:38,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2020-06-22 04:12:38,689 INFO L87 Difference]: Start difference. First operand 58 states and 127 transitions. Second operand 18 states. [2020-06-22 04:12:39,927 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2020-06-22 04:12:40,062 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2020-06-22 04:12:40,278 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2020-06-22 04:12:40,423 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2020-06-22 04:12:40,643 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2020-06-22 04:12:40,790 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2020-06-22 04:12:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:12:41,728 INFO L93 Difference]: Finished difference Result 357 states and 837 transitions. [2020-06-22 04:12:41,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-06-22 04:12:41,729 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2020-06-22 04:12:41,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:12:41,731 INFO L225 Difference]: With dead ends: 357 [2020-06-22 04:12:41,732 INFO L226 Difference]: Without dead ends: 355 [2020-06-22 04:12:41,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=394, Invalid=1246, Unknown=0, NotChecked=0, Total=1640 [2020-06-22 04:12:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2020-06-22 04:12:41,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 102. [2020-06-22 04:12:41,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-06-22 04:12:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 236 transitions. [2020-06-22 04:12:41,750 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 236 transitions. Word has length 18 [2020-06-22 04:12:41,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:12:41,751 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 236 transitions. [2020-06-22 04:12:41,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 04:12:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 236 transitions. [2020-06-22 04:12:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 04:12:41,752 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:12:41,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:12:41,752 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:12:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:12:41,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1212941806, now seen corresponding path program 1 times [2020-06-22 04:12:41,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:12:41,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:12:41,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:41,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:12:41,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:12:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:12:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:12:42,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:12:42,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/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 04:12:42,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:12:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:12:42,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjunts are in the unsatisfiable core [2020-06-22 04:12:42,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:12:42,131 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 04:12:42,132 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:12:42,142 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:12:42,143 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 04:12:42,143 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2020-06-22 04:12:42,178 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:12:42,179 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-06-22 04:12:42,179 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:12:42,196 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:12:42,200 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 16 [2020-06-22 04:12:42,201 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 04:12:42,212 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:12:42,212 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 04:12:42,213 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:33 [2020-06-22 04:12:42,249 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 27 treesize of output 26 [2020-06-22 04:12:42,249 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:12:42,264 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:12:42,265 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 04:12:42,265 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2020-06-22 04:12:42,312 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:12:42,312 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 30 treesize of output 21 [2020-06-22 04:12:42,313 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 04:12:42,325 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:12:42,328 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 04:12:42,328 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:27 [2020-06-22 04:12:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:12:42,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:12:42,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2020-06-22 04:12:42,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 04:12:42,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 04:12:42,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-06-22 04:12:42,421 INFO L87 Difference]: Start difference. First operand 102 states and 236 transitions. Second operand 17 states. [2020-06-22 04:12:47,875 WARN L188 SmtUtils]: Spent 5.22 s on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-06-22 04:12:49,416 WARN L188 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2020-06-22 04:12:59,575 WARN L188 SmtUtils]: Spent 10.11 s on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-06-22 04:13:00,727 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2020-06-22 04:13:05,161 WARN L188 SmtUtils]: Spent 4.41 s on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2020-06-22 04:13:05,756 WARN L188 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2020-06-22 04:13:11,637 WARN L188 SmtUtils]: Spent 5.85 s on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2020-06-22 04:13:21,758 WARN L188 SmtUtils]: Spent 10.03 s on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2020-06-22 04:13:28,135 WARN L188 SmtUtils]: Spent 6.33 s on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2020-06-22 04:13:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:13:28,406 INFO L93 Difference]: Finished difference Result 176 states and 405 transitions. [2020-06-22 04:13:28,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-06-22 04:13:28,407 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2020-06-22 04:13:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:13:28,408 INFO L225 Difference]: With dead ends: 176 [2020-06-22 04:13:28,408 INFO L226 Difference]: Without dead ends: 175 [2020-06-22 04:13:28,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 45.9s TimeCoverageRelationStatistics Valid=265, Invalid=605, Unknown=0, NotChecked=0, Total=870 [2020-06-22 04:13:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-06-22 04:13:28,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 98. [2020-06-22 04:13:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-06-22 04:13:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 230 transitions. [2020-06-22 04:13:28,425 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 230 transitions. Word has length 18 [2020-06-22 04:13:28,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:13:28,425 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 230 transitions. [2020-06-22 04:13:28,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 04:13:28,425 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 230 transitions. [2020-06-22 04:13:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-06-22 04:13:28,426 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:13:28,426 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:13:28,426 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:13:28,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:13:28,426 INFO L82 PathProgramCache]: Analyzing trace with hash -61592915, now seen corresponding path program 1 times [2020-06-22 04:13:28,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:13:28,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:13:28,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:28,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:13:28,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:13:28,613 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 04:13:28,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:13:28,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/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 04:13:28,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:13:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:13:28,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjunts are in the unsatisfiable core [2020-06-22 04:13:28,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:13:28,667 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 04:13:28,668 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:28,672 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:28,673 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:28,673 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 04:13:28,691 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 04:13:28,692 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:28,694 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:28,695 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:28,695 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 04:13:28,742 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:28,743 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 19 treesize of output 19 [2020-06-22 04:13:28,744 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 04:13:28,752 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:28,752 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:28,752 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-06-22 04:13:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 04:13:28,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:13:28,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-06-22 04:13:28,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-06-22 04:13:28,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-06-22 04:13:28,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-06-22 04:13:28,819 INFO L87 Difference]: Start difference. First operand 98 states and 230 transitions. Second operand 13 states. [2020-06-22 04:13:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:13:29,354 INFO L93 Difference]: Finished difference Result 110 states and 247 transitions. [2020-06-22 04:13:29,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-06-22 04:13:29,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2020-06-22 04:13:29,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:13:29,356 INFO L225 Difference]: With dead ends: 110 [2020-06-22 04:13:29,356 INFO L226 Difference]: Without dead ends: 109 [2020-06-22 04:13:29,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2020-06-22 04:13:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-06-22 04:13:29,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 57. [2020-06-22 04:13:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-06-22 04:13:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 124 transitions. [2020-06-22 04:13:29,367 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 124 transitions. Word has length 23 [2020-06-22 04:13:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:13:29,367 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 124 transitions. [2020-06-22 04:13:29,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-06-22 04:13:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 124 transitions. [2020-06-22 04:13:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-06-22 04:13:29,368 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:13:29,368 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:13:29,368 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:13:29,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:13:29,369 INFO L82 PathProgramCache]: Analyzing trace with hash 84394376, now seen corresponding path program 2 times [2020-06-22 04:13:29,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:13:29,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:13:29,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:29,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:13:29,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:13:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:13:29,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:13:29,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/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 04:13:29,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 04:13:29,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 04:13:29,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:13:29,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 30 conjunts are in the unsatisfiable core [2020-06-22 04:13:29,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:13:29,747 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 04:13:29,747 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:29,753 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:29,753 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:29,753 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-06-22 04:13:29,778 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 04:13:29,778 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:29,786 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:29,787 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 04:13:29,787 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2020-06-22 04:13:29,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 04:13:29,826 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 21 [2020-06-22 04:13:29,827 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:29,837 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:29,838 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 04:13:29,838 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2020-06-22 04:13:29,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 04:13:29,876 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 04:13:29,877 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:29,887 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:29,888 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 04:13:29,888 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2020-06-22 04:13:29,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 04:13:29,954 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:29,955 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 04:13:29,956 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 04:13:29,969 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:29,971 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:29,971 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:27 [2020-06-22 04:13:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 04:13:30,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:13:30,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2020-06-22 04:13:30,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-06-22 04:13:30,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-06-22 04:13:30,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2020-06-22 04:13:30,100 INFO L87 Difference]: Start difference. First operand 57 states and 124 transitions. Second operand 19 states. [2020-06-22 04:13:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:13:38,688 INFO L93 Difference]: Finished difference Result 315 states and 705 transitions. [2020-06-22 04:13:38,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-06-22 04:13:38,688 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2020-06-22 04:13:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:13:38,690 INFO L225 Difference]: With dead ends: 315 [2020-06-22 04:13:38,691 INFO L226 Difference]: Without dead ends: 314 [2020-06-22 04:13:38,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=550, Invalid=2206, Unknown=0, NotChecked=0, Total=2756 [2020-06-22 04:13:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-06-22 04:13:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 139. [2020-06-22 04:13:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-06-22 04:13:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 306 transitions. [2020-06-22 04:13:38,718 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 306 transitions. Word has length 28 [2020-06-22 04:13:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:13:38,718 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 306 transitions. [2020-06-22 04:13:38,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-06-22 04:13:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 306 transitions. [2020-06-22 04:13:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-06-22 04:13:38,719 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:13:38,719 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:13:38,719 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:13:38,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:13:38,720 INFO L82 PathProgramCache]: Analyzing trace with hash 115414183, now seen corresponding path program 2 times [2020-06-22 04:13:38,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:13:38,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:13:38,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:38,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:13:38,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:13:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 04:13:39,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:13:39,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:13:39,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 04:13:39,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 04:13:39,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 04:13:39,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 34 conjunts are in the unsatisfiable core [2020-06-22 04:13:39,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:13:39,073 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 04:13:39,074 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:39,077 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:39,078 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:39,078 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 04:13:39,098 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 04:13:39,098 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:39,105 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:39,106 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 04:13:39,106 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-06-22 04:13:39,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 04:13:39,142 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 21 [2020-06-22 04:13:39,142 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:39,155 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:39,162 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:39,162 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-06-22 04:13:39,162 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:39,171 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:39,171 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 04:13:39,171 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2020-06-22 04:13:39,204 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 04:13:39,204 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:39,215 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:39,215 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 04:13:39,216 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-06-22 04:13:39,284 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:39,285 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 04:13:39,286 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 04:13:39,298 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:39,300 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:39,300 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:24 [2020-06-22 04:13:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 04:13:39,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:13:39,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2020-06-22 04:13:39,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 04:13:39,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 04:13:39,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2020-06-22 04:13:39,394 INFO L87 Difference]: Start difference. First operand 139 states and 306 transitions. Second operand 18 states. [2020-06-22 04:13:39,800 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2020-06-22 04:13:40,278 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2020-06-22 04:13:40,410 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-06-22 04:13:40,550 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2020-06-22 04:13:40,821 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2020-06-22 04:13:40,981 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2020-06-22 04:13:41,119 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2020-06-22 04:13:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:13:41,548 INFO L93 Difference]: Finished difference Result 218 states and 478 transitions. [2020-06-22 04:13:41,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-06-22 04:13:41,549 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2020-06-22 04:13:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:13:41,550 INFO L225 Difference]: With dead ends: 218 [2020-06-22 04:13:41,550 INFO L226 Difference]: Without dead ends: 217 [2020-06-22 04:13:41,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=338, Invalid=852, Unknown=0, NotChecked=0, Total=1190 [2020-06-22 04:13:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-06-22 04:13:41,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 71. [2020-06-22 04:13:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-06-22 04:13:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 154 transitions. [2020-06-22 04:13:41,567 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 154 transitions. Word has length 28 [2020-06-22 04:13:41,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:13:41,567 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 154 transitions. [2020-06-22 04:13:41,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 04:13:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 154 transitions. [2020-06-22 04:13:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-06-22 04:13:41,568 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:13:41,568 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:13:41,568 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:13:41,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:13:41,569 INFO L82 PathProgramCache]: Analyzing trace with hash -823421225, now seen corresponding path program 1 times [2020-06-22 04:13:41,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:13:41,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:13:41,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:41,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:13:41,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:13:41,639 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 04:13:41,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:13:41,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:13:41,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:13:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:13:41,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 23 conjunts are in the unsatisfiable core [2020-06-22 04:13:41,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:13:41,688 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 04:13:41,689 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:41,690 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:41,691 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 04:13:41,691 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2020-06-22 04:13:41,787 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:41,787 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 27 treesize of output 23 [2020-06-22 04:13:41,788 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:41,792 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:41,793 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 04:13:41,793 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:5 [2020-06-22 04:13:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 04:13:41,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:13:41,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-06-22 04:13:41,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-06-22 04:13:41,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-06-22 04:13:41,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-06-22 04:13:41,826 INFO L87 Difference]: Start difference. First operand 71 states and 154 transitions. Second operand 13 states. [2020-06-22 04:13:42,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:13:42,253 INFO L93 Difference]: Finished difference Result 258 states and 551 transitions. [2020-06-22 04:13:42,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 04:13:42,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2020-06-22 04:13:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:13:42,255 INFO L225 Difference]: With dead ends: 258 [2020-06-22 04:13:42,255 INFO L226 Difference]: Without dead ends: 221 [2020-06-22 04:13:42,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2020-06-22 04:13:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-06-22 04:13:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 146. [2020-06-22 04:13:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-06-22 04:13:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 314 transitions. [2020-06-22 04:13:42,294 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 314 transitions. Word has length 38 [2020-06-22 04:13:42,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:13:42,295 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 314 transitions. [2020-06-22 04:13:42,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-06-22 04:13:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 314 transitions. [2020-06-22 04:13:42,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-06-22 04:13:42,296 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:13:42,296 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:13:42,296 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:13:42,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:13:42,296 INFO L82 PathProgramCache]: Analyzing trace with hash -201531443, now seen corresponding path program 1 times [2020-06-22 04:13:42,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:13:42,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:13:42,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:42,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:13:42,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:13:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-06-22 04:13:42,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:13:42,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 04:13:42,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 04:13:42,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 04:13:42,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 04:13:42,347 INFO L87 Difference]: Start difference. First operand 146 states and 314 transitions. Second operand 7 states. [2020-06-22 04:13:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:13:42,568 INFO L93 Difference]: Finished difference Result 277 states and 549 transitions. [2020-06-22 04:13:42,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 04:13:42,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-06-22 04:13:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:13:42,569 INFO L225 Difference]: With dead ends: 277 [2020-06-22 04:13:42,569 INFO L226 Difference]: Without dead ends: 178 [2020-06-22 04:13:42,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-06-22 04:13:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-06-22 04:13:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 146. [2020-06-22 04:13:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-06-22 04:13:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 306 transitions. [2020-06-22 04:13:42,609 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 306 transitions. Word has length 38 [2020-06-22 04:13:42,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:13:42,609 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 306 transitions. [2020-06-22 04:13:42,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 04:13:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 306 transitions. [2020-06-22 04:13:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-06-22 04:13:42,610 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:13:42,610 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:13:42,610 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:13:42,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:13:42,610 INFO L82 PathProgramCache]: Analyzing trace with hash -599039541, now seen corresponding path program 1 times [2020-06-22 04:13:42,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:13:42,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:13:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:42,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:13:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:13:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 04:13:42,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:13:42,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:13:42,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:13:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:13:42,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjunts are in the unsatisfiable core [2020-06-22 04:13:42,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:13:42,984 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 04:13:42,984 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:42,989 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:42,990 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:42,990 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-06-22 04:13:42,996 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 04:13:42,996 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:43,001 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:43,001 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:43,001 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-06-22 04:13:43,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 04:13:43,009 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 20 [2020-06-22 04:13:43,010 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:43,020 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:43,021 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 04:13:43,021 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:28 [2020-06-22 04:13:43,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 04:13:43,058 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 04:13:43,058 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:43,069 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:43,070 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 04:13:43,070 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-06-22 04:13:43,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 04:13:43,138 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:43,139 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 04:13:43,140 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 04:13:43,153 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:43,153 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:43,153 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:25 [2020-06-22 04:13:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-06-22 04:13:43,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:13:43,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 20 [2020-06-22 04:13:43,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-06-22 04:13:43,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-06-22 04:13:43,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2020-06-22 04:13:43,277 INFO L87 Difference]: Start difference. First operand 146 states and 306 transitions. Second operand 21 states. [2020-06-22 04:13:44,220 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2020-06-22 04:13:44,466 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2020-06-22 04:13:44,607 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2020-06-22 04:13:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:13:46,358 INFO L93 Difference]: Finished difference Result 745 states and 1524 transitions. [2020-06-22 04:13:46,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-06-22 04:13:46,358 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2020-06-22 04:13:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:13:46,361 INFO L225 Difference]: With dead ends: 745 [2020-06-22 04:13:46,361 INFO L226 Difference]: Without dead ends: 530 [2020-06-22 04:13:46,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=510, Invalid=1746, Unknown=0, NotChecked=0, Total=2256 [2020-06-22 04:13:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-06-22 04:13:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 226. [2020-06-22 04:13:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-06-22 04:13:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 477 transitions. [2020-06-22 04:13:46,427 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 477 transitions. Word has length 38 [2020-06-22 04:13:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:13:46,427 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 477 transitions. [2020-06-22 04:13:46,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-06-22 04:13:46,427 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 477 transitions. [2020-06-22 04:13:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-06-22 04:13:46,428 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 04:13:46,428 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:13:46,428 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION]=== [2020-06-22 04:13:46,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:13:46,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1351260714, now seen corresponding path program 1 times [2020-06-22 04:13:46,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:13:46,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:13:46,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:46,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:13:46,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:13:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:13:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 04:13:46,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 04:13:46,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 04:13:46,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:13:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:13:46,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 35 conjunts are in the unsatisfiable core [2020-06-22 04:13:46,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:13:46,787 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 04:13:46,788 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:46,791 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:46,792 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:46,792 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 04:13:46,795 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 04:13:46,796 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:46,800 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:46,800 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:46,800 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-06-22 04:13:46,809 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:46,809 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2020-06-22 04:13:46,810 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:46,816 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:46,818 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 20 [2020-06-22 04:13:46,819 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:46,824 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:46,824 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:46,824 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-06-22 04:13:46,853 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 04:13:46,853 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 04:13:46,860 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:46,860 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 04:13:46,860 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-06-22 04:13:46,914 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:46,915 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 04:13:46,916 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 04:13:46,924 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 04:13:46,924 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 04:13:46,924 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2020-06-22 04:13:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-06-22 04:13:47,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 04:13:47,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 19 [2020-06-22 04:13:47,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-06-22 04:13:47,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-06-22 04:13:47,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2020-06-22 04:13:47,036 INFO L87 Difference]: Start difference. First operand 226 states and 477 transitions. Second operand 20 states. [2020-06-22 04:13:47,662 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2020-06-22 04:13:47,909 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2020-06-22 04:13:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:13:48,624 INFO L93 Difference]: Finished difference Result 334 states and 688 transitions. [2020-06-22 04:13:48,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-06-22 04:13:48,625 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2020-06-22 04:13:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 04:13:48,625 INFO L225 Difference]: With dead ends: 334 [2020-06-22 04:13:48,625 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 04:13:48,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2020-06-22 04:13:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 04:13:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 04:13:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 04:13:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 04:13:48,627 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-06-22 04:13:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 04:13:48,627 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:13:48,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-06-22 04:13:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 04:13:48,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 04:13:48,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 04:13:48,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:48,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:48,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:48,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:48,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:48,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:52,316 WARN L188 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 579 DAG size of output: 531 [2020-06-22 04:13:52,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:52,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:52,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:52,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:52,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:52,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:52,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:52,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:52,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:53,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:53,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 04:13:53,831 WARN L188 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 461 DAG size of output: 413 [2020-06-22 04:14:31,037 WARN L188 SmtUtils]: Spent 37.19 s on a formula simplification. DAG size of input: 527 DAG size of output: 130 [2020-06-22 04:14:31,428 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 38 [2020-06-22 04:14:44,173 WARN L188 SmtUtils]: Spent 12.74 s on a formula simplification. DAG size of input: 407 DAG size of output: 123 [2020-06-22 04:14:44,176 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2020-06-22 04:14:44,176 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 36) no Hoare annotation was computed. [2020-06-22 04:14:44,177 INFO L444 ceAbstractionStarter]: At program point L29-4(lines 29 36) the Hoare annotation is: (let ((.cse24 (select |#length| |ULTIMATE.start_main_#t~ret10.base|)) (.cse21 (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (.cse26 (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base)) (.cse25 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base)) (.cse23 (select |#memory_int| |ULTIMATE.start_main_#t~ret10.base|)) (.cse22 (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base))) (let ((.cse6 (= 0 (select .cse22 ULTIMATE.start_cstrpbrk_~sc1~0.offset))) (.cse12 (= 0 (select .cse23 |ULTIMATE.start_main_#t~ret10.offset|))) (.cse0 (or (= 0 (select .cse26 ULTIMATE.start_cstrpbrk_~s2.offset)) (<= 2 .cse25))) (.cse19 (= (select .cse26 (+ .cse25 (- 1))) 0)) (.cse1 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret10.base|))) (.cse2 (= ULTIMATE.start_cstrpbrk_~s2.offset 0)) (.cse4 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse5 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse8 (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)) (.cse9 (<= 1 .cse25)) (.cse10 (<= 1 .cse21)) (.cse11 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse14 (<= 1 .cse24)) (.cse15 (= (select |#valid| ULTIMATE.start_cstrpbrk_~sc1~0.base) 1)) (.cse20 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int) (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (- 1)))) (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base ULTIMATE.start_cstrpbrk_~sc1~0.base))))) (.cse3 (= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset)) (.cse13 (= 0 |ULTIMATE.start_main_#t~ret10.offset|)) (.cse7 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse16 (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret10.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~length~0 Int) (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int) (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base Int)) (and (= (select (select |#memory_int| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~length~0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (- 1))) 0) (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base ULTIMATE.start_cstrpbrk_~sc1~0.base)))) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ |ULTIMATE.start_main_#t~ret10.base| 1) 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (and (let ((.cse17 (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base))) (and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 2) .cse17) (and (<= 1 ULTIMATE.start_cstrpbrk_~sc1~0.offset) (let ((.cse18 (and .cse0 (and (not (= ULTIMATE.start_cstrpbrk_~c~0 0)) .cse1 .cse9 .cse4 .cse11 (= (select |#valid| ULTIMATE.start_cstrpbrk_~s~0.base) 1) .cse14 .cse15 .cse8) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) .cse17)))) (or (and .cse2 (<= 1 ULTIMATE.start_cstrpbrk_~s~0.offset) .cse18) (and (= 0 ULTIMATE.start_cstrpbrk_~s~0.offset) .cse2 .cse18)))) .cse19 (= (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) (+ .cse17 (- 1))) 0))) .cse20 .cse5 .cse13 .cse7 .cse16) (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) .cse21) (= (select .cse22 (+ .cse21 (- 1))) 0) (= (select .cse23 (+ .cse24 (- 1))) 0)) (and (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 (- 1)))) (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 0) (<= 0 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21))) (and .cse19 (and .cse1 .cse2 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15)) .cse20 .cse3 .cse13 (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 Int)) (and (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 0) (= (select (select |#memory_int| |ULTIMATE.start_main_#t~ret10.base|) (+ (select |#length| |ULTIMATE.start_main_#t~ret10.base|) v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 (- 1))) 0) (<= 0 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21))) .cse7 .cse16)))) [2020-06-22 04:14:44,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 04:14:44,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 04:14:44,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 04:14:44,177 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2020-06-22 04:14:44,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-06-22 04:14:44,177 INFO L448 ceAbstractionStarter]: For program point L32-2(line 32) no Hoare annotation was computed. [2020-06-22 04:14:44,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 04:14:44,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 04:14:44,178 INFO L448 ceAbstractionStarter]: For program point L32-3(line 32) no Hoare annotation was computed. [2020-06-22 04:14:44,178 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 04:14:44,178 INFO L448 ceAbstractionStarter]: For program point L32-4(line 32) no Hoare annotation was computed. [2020-06-22 04:14:44,178 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 04:14:44,178 INFO L448 ceAbstractionStarter]: For program point L32-6(lines 32 33) no Hoare annotation was computed. [2020-06-22 04:14:44,178 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 34) no Hoare annotation was computed. [2020-06-22 04:14:44,179 INFO L444 ceAbstractionStarter]: At program point L32-8(lines 32 33) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) ULTIMATE.start_cstrpbrk_~sc1~0.offset)) (.cse34 (select |#memory_int| ULTIMATE.start_cstrpbrk_~s2.base)) (.cse35 (select |#length| ULTIMATE.start_cstrpbrk_~s2.base))) (let ((.cse20 (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base)) (.cse21 (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (.cse22 (or (= 0 (select .cse34 ULTIMATE.start_cstrpbrk_~s2.offset)) (<= 2 .cse35))) (.cse23 (not (= ULTIMATE.start_cstrpbrk_~c~0 0))) (.cse24 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret10.base|))) (.cse30 (<= 1 .cse35)) (.cse25 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse31 (= 1 (select |#valid| ULTIMATE.start_cstrpbrk_~s2.base))) (.cse26 (= (select |#valid| ULTIMATE.start_cstrpbrk_~s~0.base) 1)) (.cse27 (not (= 0 .cse0))) (.cse32 (<= 1 (select |#length| |ULTIMATE.start_main_#t~ret10.base|))) (.cse33 (= (select |#valid| ULTIMATE.start_cstrpbrk_~sc1~0.base) 1)) (.cse28 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse29 (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1))) (let ((.cse3 (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (.cse1 (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 (- 1)))) (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 0) (<= 0 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21)))) (.cse2 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int) (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (- 1)))) (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base ULTIMATE.start_cstrpbrk_~sc1~0.base))))) (.cse9 (and .cse22 (and .cse23 .cse24 .cse30 .cse25 .cse31 .cse26 .cse27 .cse32 .cse33 .cse28 .cse29))) (.cse12 (<= 1 ULTIMATE.start_cstrpbrk_~s~0.offset)) (.cse7 (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) .cse21)) (.cse5 (= (select .cse34 (+ .cse35 (- 1))) 0)) (.cse11 (= 0 ULTIMATE.start_cstrpbrk_~sc1~0.offset)) (.cse16 (= 0 ULTIMATE.start_cstrpbrk_~s~0.offset)) (.cse14 (<= 1 ULTIMATE.start_cstrpbrk_~sc1~0.offset)) (.cse10 (= ULTIMATE.start_cstrpbrk_~s2.offset 0)) (.cse17 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (<= 1 .cse21) .cse31 .cse32 .cse33 (or (= 0 (select .cse20 ULTIMATE.start_cstrpbrk_~s~0.offset)) (<= 2 .cse21)))) (.cse13 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse6 (= 0 |ULTIMATE.start_main_#t~ret10.offset|)) (.cse8 (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret10.base|))) (.cse15 (= (select .cse20 (+ .cse21 (- 1))) 0)) (.cse4 (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 Int)) (and (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 0) (= (select (select |#memory_int| |ULTIMATE.start_main_#t~ret10.base|) (+ (select |#length| |ULTIMATE.start_main_#t~ret10.base|) v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 (- 1))) 0) (<= 0 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21))))) (or (and (<= (+ .cse0 1) 0) (<= (+ ULTIMATE.start_cstrpbrk_~c~0 1) 0) (and .cse1 .cse2 (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 2) .cse3) .cse4 (or (and .cse5 .cse6 .cse7 .cse8 (or (and .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse9 .cse10 .cse12 .cse13)) .cse15) (and (or (and .cse16 .cse10 .cse11 .cse17 .cse13) (and .cse16 .cse14 .cse10 .cse17 .cse13)) .cse5 .cse6 .cse8 .cse15)))) (and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) .cse3) (and .cse1 .cse2 (let ((.cse18 (<= 1 ULTIMATE.start_cstrpbrk_~c~0)) (.cse19 (<= 1 .cse0))) (or (and (or (and .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse19) (and .cse14 .cse9 .cse18 .cse10 .cse12 .cse13 .cse19)) .cse5 .cse6 .cse7 .cse8 .cse15) (and .cse5 (or (and .cse16 .cse18 .cse10 .cse11 .cse17 .cse13 .cse19) (and .cse16 .cse14 .cse18 .cse10 .cse17 .cse13 .cse19)) .cse6 .cse8 .cse15))) .cse4)))))) [2020-06-22 04:14:44,179 INFO L448 ceAbstractionStarter]: For program point L32-9(lines 32 33) no Hoare annotation was computed. [2020-06-22 04:14:44,179 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 04:14:44,179 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 34) no Hoare annotation was computed. [2020-06-22 04:14:44,179 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 04:14:44,179 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 04:14:44,179 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 04:14:44,179 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 04:14:44,179 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)) [2020-06-22 04:14:44,180 INFO L444 ceAbstractionStarter]: At program point L16-2(line 16) the Hoare annotation is: (let ((.cse3 (select |#length| |ULTIMATE.start_main_#t~ret10.base|))) (let ((.cse2 (select |#memory_int| |ULTIMATE.start_main_#t~ret10.base|)) (.cse4 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret10.base|))) (.cse5 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse6 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse7 (= 0 |ULTIMATE.start_main_#t~ret10.offset|)) (.cse8 (<= 1 .cse3)) (.cse9 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse10 (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1))) (let ((.cse0 (and (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret10.base|)))) (.cse1 (= 0 (select .cse2 |ULTIMATE.start_main_#t~ret10.offset|)))) (or (and .cse0 .cse1) (and .cse0 (= (select .cse2 (+ .cse3 (- 1))) 0)) (and .cse4 .cse5 .cse6 .cse1 .cse7 .cse8 (<= (+ |ULTIMATE.start_main_#t~ret10.base| 1) 0) .cse9 .cse10))))) [2020-06-22 04:14:44,180 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-06-22 04:14:44,180 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 14) no Hoare annotation was computed. [2020-06-22 04:14:44,180 INFO L448 ceAbstractionStarter]: For program point L12-3(lines 12 14) no Hoare annotation was computed. [2020-06-22 04:14:44,180 INFO L448 ceAbstractionStarter]: For program point L12-5(lines 12 14) no Hoare annotation was computed. [2020-06-22 04:14:44,180 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 04:14:44,188 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,199 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,200 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:44,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,201 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,202 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,204 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:44,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,213 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,214 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,215 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,218 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,220 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,221 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,222 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,223 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,224 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,225 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,226 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,227 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,228 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,229 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,230 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,231 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,233 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,233 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,233 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,233 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,235 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,235 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,235 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,235 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,236 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,236 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,236 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,236 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,237 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,238 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:44,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,250 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,250 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:44,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,270 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,270 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,270 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,270 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,271 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,271 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,271 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,271 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,272 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,272 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,272 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,272 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,272 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,273 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,273 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,273 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,273 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,274 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,274 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,274 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,274 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,275 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,275 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,275 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,275 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,276 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,276 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,276 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,276 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 04:14:44,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:44,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:44,289 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,290 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,291 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,291 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:44,291 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,291 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,291 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,292 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,292 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,293 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,293 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,294 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,294 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,294 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,294 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,294 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,295 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,295 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,295 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,295 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,298 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,298 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,298 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,298 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,299 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,299 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,299 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,299 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,300 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,302 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,304 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 04:14:44,306 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:44,306 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,306 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,307 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:44,307 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,307 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,307 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:44,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:44,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:44,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,312 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,312 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,312 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,312 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,312 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,313 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,313 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,313 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,313 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,313 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,314 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,314 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,314 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,314 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:44,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:44,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:14:44 BasicIcfg [2020-06-22 04:14:44,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 04:14:44,325 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 04:14:44,325 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 04:14:44,328 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 04:14:44,329 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:14:44,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 04:11:26" (1/5) ... [2020-06-22 04:14:44,330 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73f4d2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:14:44, skipping insertion in model container [2020-06-22 04:14:44,330 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:14:44,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 04:11:26" (2/5) ... [2020-06-22 04:14:44,330 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73f4d2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 04:14:44, skipping insertion in model container [2020-06-22 04:14:44,331 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:14:44,331 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 04:11:27" (3/5) ... [2020-06-22 04:14:44,331 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73f4d2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:14:44, skipping insertion in model container [2020-06-22 04:14:44,331 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:14:44,331 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 04:11:27" (4/5) ... [2020-06-22 04:14:44,331 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73f4d2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:14:44, skipping insertion in model container [2020-06-22 04:14:44,331 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 04:14:44,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 04:14:44" (5/5) ... [2020-06-22 04:14:44,333 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 04:14:44,354 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 04:14:44,354 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 04:14:44,354 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 04:14:44,354 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 04:14:44,354 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 04:14:44,354 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 04:14:44,355 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 04:14:44,355 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 04:14:44,355 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 04:14:44,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-06-22 04:14:44,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 04:14:44,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:14:44,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:14:44,368 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:44,368 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:44,368 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 04:14:44,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-06-22 04:14:44,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 04:14:44,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:14:44,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:14:44,370 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:44,370 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:44,375 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue [212] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_4|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 15#L12true [140] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 11#L12-2true [163] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 4#L16true [214] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret10.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret10.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset, ULTIMATE.start_main_#t~ret10.base] 27#L12-3true [126] L12-3-->L12-5: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 1) (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_13 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_13} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 24#L12-5true [169] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 17#L16-2true [216] L16-2-->L29-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret10.base_7|) (= |v_ULTIMATE.start_main_#t~ret11.base_5| |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret10.offset_7|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret11.base_5|))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|} OutVars{ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_4|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_4|, 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_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_10|, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_7|, ULTIMATE.start_cstrpbrk_#t~post8.base=|v_ULTIMATE.start_cstrpbrk_#t~post8.base_4|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_6|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post8.offset=|v_ULTIMATE.start_cstrpbrk_#t~post8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, 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_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrpbrk_#t~short7, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_#t~post8.base, ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post8.offset] 18#L29-4true [2020-06-22 04:14:44,376 INFO L796 eck$LassoCheckResult]: Loop: 18#L29-4true [110] L29-4-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4 1) (select |v_#length_9| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 6#L29-1true [178] L29-1-->L31: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~s~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (< |v_ULTIMATE.start_cstrpbrk_#t~mem3_6| 0)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_~s~0.offset] 28#L31true [218] L31-->L32-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (= (select (select |v_#memory_int_18| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) v_ULTIMATE.start_cstrpbrk_~c~0_8) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_23| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_27| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_~c~0] 31#L32-8true [137] L32-8-->L32-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_4 1) (select |v_#length_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_4)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_4) (= |v_ULTIMATE.start_cstrpbrk_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrpbrk_~s~0.base_4) v_ULTIMATE.start_cstrpbrk_~s~0.offset_4)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~s~0.base_4))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4, #valid=|v_#valid_15|} OutVars{#valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem5] 10#L32-1true [192] L32-1-->L32-2: Formula: (and (< |v_ULTIMATE.start_cstrpbrk_#t~mem5_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short7_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short7] 26#L32-2true [125] L32-2-->L32-6: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short7_5|) InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_5|} OutVars{ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_5|} AuxVars[] AssignedVars[] 20#L32-6true [114] L32-6-->L32-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short7_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_4|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_4|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_#t~short7] 30#L32-9true [222] L32-9-->L29-4: Formula: (and (= (select |v_#valid_28| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) 1) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= (select (select |v_#memory_int_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_24| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_24|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_6|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_24|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base] 18#L29-4true [2020-06-22 04:14:44,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:44,377 INFO L82 PathProgramCache]: Analyzing trace with hash 785179265, now seen corresponding path program 1 times [2020-06-22 04:14:44,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:44,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:44,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:14:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:44,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2063540381, now seen corresponding path program 1 times [2020-06-22 04:14:44,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:44,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:44,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:44,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:14:44,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:44,416 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 04:14:44,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:14:44,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 04:14:44,417 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:14:44,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:14:44,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:14:44,419 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2020-06-22 04:14:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:14:44,515 INFO L93 Difference]: Finished difference Result 33 states and 64 transitions. [2020-06-22 04:14:44,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:14:44,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 64 transitions. [2020-06-22 04:14:44,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 04:14:44,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 19 states and 36 transitions. [2020-06-22 04:14:44,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 04:14:44,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-06-22 04:14:44,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 36 transitions. [2020-06-22 04:14:44,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:14:44,522 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 36 transitions. [2020-06-22 04:14:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 36 transitions. [2020-06-22 04:14:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 04:14:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 04:14:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2020-06-22 04:14:44,525 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 36 transitions. [2020-06-22 04:14:44,525 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 36 transitions. [2020-06-22 04:14:44,525 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 04:14:44,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 36 transitions. [2020-06-22 04:14:44,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 04:14:44,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:14:44,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:14:44,526 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:44,526 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:44,527 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY [212] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_4|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 89#L12 [140] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 87#L12-2 [163] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 75#L16 [214] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret10.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret10.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset, ULTIMATE.start_main_#t~ret10.base] 76#L12-3 [126] L12-3-->L12-5: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 1) (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_13 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_13} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 81#L12-5 [169] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 82#L16-2 [216] L16-2-->L29-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret10.base_7|) (= |v_ULTIMATE.start_main_#t~ret11.base_5| |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret10.offset_7|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret11.base_5|))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|} OutVars{ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_4|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_4|, 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_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_10|, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_7|, ULTIMATE.start_cstrpbrk_#t~post8.base=|v_ULTIMATE.start_cstrpbrk_#t~post8.base_4|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_6|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post8.offset=|v_ULTIMATE.start_cstrpbrk_#t~post8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, 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_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrpbrk_#t~short7, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_#t~post8.base, ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post8.offset] 91#L29-4 [2020-06-22 04:14:44,528 INFO L796 eck$LassoCheckResult]: Loop: 91#L29-4 [110] L29-4-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4 1) (select |v_#length_9| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 79#L29-1 [178] L29-1-->L31: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~s~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (< |v_ULTIMATE.start_cstrpbrk_#t~mem3_6| 0)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_~s~0.offset] 80#L31 [218] L31-->L32-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (= (select (select |v_#memory_int_18| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) v_ULTIMATE.start_cstrpbrk_~c~0_8) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_23| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_27| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_~c~0] 74#L32-8 [137] L32-8-->L32-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_4 1) (select |v_#length_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_4)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_4) (= |v_ULTIMATE.start_cstrpbrk_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrpbrk_~s~0.base_4) v_ULTIMATE.start_cstrpbrk_~s~0.offset_4)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~s~0.base_4))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4, #valid=|v_#valid_15|} OutVars{#valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem5] 85#L32-1 [193] L32-1-->L32-2: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem5_3| 0) (not |v_ULTIMATE.start_cstrpbrk_#t~short7_2|)) InVars {ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short7] 86#L32-2 [125] L32-2-->L32-6: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short7_5|) InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_5|} OutVars{ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_5|} AuxVars[] AssignedVars[] 78#L32-6 [114] L32-6-->L32-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short7_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_4|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_4|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_#t~short7] 90#L32-9 [222] L32-9-->L29-4: Formula: (and (= (select |v_#valid_28| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) 1) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= (select (select |v_#memory_int_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_24| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_24|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_6|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_24|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base] 91#L29-4 [2020-06-22 04:14:44,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:44,528 INFO L82 PathProgramCache]: Analyzing trace with hash 785179265, now seen corresponding path program 2 times [2020-06-22 04:14:44,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:44,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:44,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:44,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:14:44,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:44,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:44,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2063570172, now seen corresponding path program 1 times [2020-06-22 04:14:44,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:44,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:44,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:44,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:14:44,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:44,588 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 04:14:44,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:14:44,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 04:14:44,589 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:14:44,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 04:14:44,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 04:14:44,590 INFO L87 Difference]: Start difference. First operand 19 states and 36 transitions. cyclomatic complexity: 18 Second operand 7 states. [2020-06-22 04:14:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:14:44,769 INFO L93 Difference]: Finished difference Result 27 states and 53 transitions. [2020-06-22 04:14:44,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 04:14:44,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 53 transitions. [2020-06-22 04:14:44,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 04:14:44,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 26 states and 52 transitions. [2020-06-22 04:14:44,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-06-22 04:14:44,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-06-22 04:14:44,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 52 transitions. [2020-06-22 04:14:44,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:14:44,771 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 52 transitions. [2020-06-22 04:14:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 52 transitions. [2020-06-22 04:14:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2020-06-22 04:14:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 04:14:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 46 transitions. [2020-06-22 04:14:44,773 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 46 transitions. [2020-06-22 04:14:44,773 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 46 transitions. [2020-06-22 04:14:44,773 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 04:14:44,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 46 transitions. [2020-06-22 04:14:44,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 04:14:44,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:14:44,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:14:44,774 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:44,774 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:44,775 INFO L794 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY [212] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_4|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 155#L12 [140] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 153#L12-2 [163] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 141#L16 [214] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret10.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret10.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset, ULTIMATE.start_main_#t~ret10.base] 142#L12-3 [126] L12-3-->L12-5: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 1) (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_13 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_13} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 146#L12-5 [169] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 147#L16-2 [216] L16-2-->L29-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret10.base_7|) (= |v_ULTIMATE.start_main_#t~ret11.base_5| |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret10.offset_7|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret11.base_5|))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|} OutVars{ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_4|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_4|, 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_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_10|, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_7|, ULTIMATE.start_cstrpbrk_#t~post8.base=|v_ULTIMATE.start_cstrpbrk_#t~post8.base_4|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_6|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post8.offset=|v_ULTIMATE.start_cstrpbrk_#t~post8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, 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_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrpbrk_#t~short7, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_#t~post8.base, ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post8.offset] 157#L29-4 [2020-06-22 04:14:44,776 INFO L796 eck$LassoCheckResult]: Loop: 157#L29-4 [110] L29-4-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4 1) (select |v_#length_9| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 143#L29-1 [178] L29-1-->L31: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~s~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (< |v_ULTIMATE.start_cstrpbrk_#t~mem3_6| 0)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_~s~0.offset] 144#L31 [218] L31-->L32-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (= (select (select |v_#memory_int_18| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) v_ULTIMATE.start_cstrpbrk_~c~0_8) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_23| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_27| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_~c~0] 140#L32-8 [137] L32-8-->L32-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_4 1) (select |v_#length_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_4)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_4) (= |v_ULTIMATE.start_cstrpbrk_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrpbrk_~s~0.base_4) v_ULTIMATE.start_cstrpbrk_~s~0.offset_4)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~s~0.base_4))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4, #valid=|v_#valid_15|} OutVars{#valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem5] 151#L32-1 [192] L32-1-->L32-2: Formula: (and (< |v_ULTIMATE.start_cstrpbrk_#t~mem5_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short7_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short7] 149#L32-2 [124] L32-2-->L32-3: Formula: |v_ULTIMATE.start_cstrpbrk_#t~short7_3| InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_3|} AuxVars[] AssignedVars[] 150#L32-3 [121] L32-3-->L32-4: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem6_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_15| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_cstrpbrk_~s~0.base_7))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_15|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_2|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_15|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem6] 159#L32-4 [208] L32-4-->L32-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrpbrk_~c~0_4 256))) (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem6_3| .cse0) (not |v_ULTIMATE.start_cstrpbrk_#t~short7_4|) (<= .cse0 127))) InVars {ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_3|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_4} OutVars{ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_3|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_4, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short7] 158#L32-6 [114] L32-6-->L32-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short7_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_4|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_4|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_#t~short7] 156#L32-9 [222] L32-9-->L29-4: Formula: (and (= (select |v_#valid_28| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) 1) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= (select (select |v_#memory_int_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_24| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_24|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_6|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_24|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base] 157#L29-4 [2020-06-22 04:14:44,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:44,776 INFO L82 PathProgramCache]: Analyzing trace with hash 785179265, now seen corresponding path program 3 times [2020-06-22 04:14:44,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:44,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:44,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:44,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:14:44,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:44,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:44,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1213309293, now seen corresponding path program 1 times [2020-06-22 04:14:44,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:44,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:44,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:44,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:14:44,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:44,837 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 04:14:44,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:14:44,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 04:14:44,837 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:14:44,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 04:14:44,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 04:14:44,838 INFO L87 Difference]: Start difference. First operand 21 states and 46 transitions. cyclomatic complexity: 26 Second operand 5 states. [2020-06-22 04:14:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:14:44,994 INFO L93 Difference]: Finished difference Result 31 states and 66 transitions. [2020-06-22 04:14:44,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 04:14:44,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 66 transitions. [2020-06-22 04:14:44,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2020-06-22 04:14:44,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 66 transitions. [2020-06-22 04:14:44,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-06-22 04:14:44,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-06-22 04:14:44,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 66 transitions. [2020-06-22 04:14:44,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:14:44,997 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 66 transitions. [2020-06-22 04:14:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 66 transitions. [2020-06-22 04:14:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2020-06-22 04:14:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 04:14:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 56 transitions. [2020-06-22 04:14:44,998 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 56 transitions. [2020-06-22 04:14:44,998 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 56 transitions. [2020-06-22 04:14:44,998 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 04:14:44,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 56 transitions. [2020-06-22 04:14:44,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-06-22 04:14:44,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:14:44,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:14:45,000 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:45,000 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:45,000 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY [212] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_4|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 223#L12 [140] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 221#L12-2 [163] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 207#L16 [214] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret10.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret10.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset, ULTIMATE.start_main_#t~ret10.base] 208#L12-3 [126] L12-3-->L12-5: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 1) (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_13 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_13} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 213#L12-5 [169] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 214#L16-2 [216] L16-2-->L29-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret10.base_7|) (= |v_ULTIMATE.start_main_#t~ret11.base_5| |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret10.offset_7|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret11.base_5|))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|} OutVars{ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_4|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_4|, 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_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_10|, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_7|, ULTIMATE.start_cstrpbrk_#t~post8.base=|v_ULTIMATE.start_cstrpbrk_#t~post8.base_4|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_6|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post8.offset=|v_ULTIMATE.start_cstrpbrk_#t~post8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, 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_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrpbrk_#t~short7, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_#t~post8.base, ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post8.offset] 225#L29-4 [2020-06-22 04:14:45,001 INFO L796 eck$LassoCheckResult]: Loop: 225#L29-4 [110] L29-4-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4 1) (select |v_#length_9| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 211#L29-1 [178] L29-1-->L31: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~s~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (< |v_ULTIMATE.start_cstrpbrk_#t~mem3_6| 0)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_~s~0.offset] 212#L31 [218] L31-->L32-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (= (select (select |v_#memory_int_18| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) v_ULTIMATE.start_cstrpbrk_~c~0_8) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_23| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_27| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_~c~0] 206#L32-8 [137] L32-8-->L32-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_4 1) (select |v_#length_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_4)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_4) (= |v_ULTIMATE.start_cstrpbrk_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrpbrk_~s~0.base_4) v_ULTIMATE.start_cstrpbrk_~s~0.offset_4)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~s~0.base_4))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4, #valid=|v_#valid_15|} OutVars{#valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem5] 218#L32-1 [194] L32-1-->L32-2: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem5_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short7_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short7] 217#L32-2 [124] L32-2-->L32-3: Formula: |v_ULTIMATE.start_cstrpbrk_#t~short7_3| InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_3|} AuxVars[] AssignedVars[] 215#L32-3 [121] L32-3-->L32-4: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem6_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_15| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_cstrpbrk_~s~0.base_7))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_15|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_2|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_15|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem6] 216#L32-4 [208] L32-4-->L32-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrpbrk_~c~0_4 256))) (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem6_3| .cse0) (not |v_ULTIMATE.start_cstrpbrk_#t~short7_4|) (<= .cse0 127))) InVars {ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_3|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_4} OutVars{ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_3|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_4, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short7] 210#L32-6 [114] L32-6-->L32-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short7_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_4|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_4|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_#t~short7] 224#L32-9 [222] L32-9-->L29-4: Formula: (and (= (select |v_#valid_28| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) 1) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= (select (select |v_#memory_int_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_24| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_24|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_6|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_24|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base] 225#L29-4 [2020-06-22 04:14:45,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash 785179265, now seen corresponding path program 4 times [2020-06-22 04:14:45,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:45,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:14:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:45,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1156050991, now seen corresponding path program 1 times [2020-06-22 04:14:45,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:45,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:45,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:14:45,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:45,068 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 04:14:45,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:14:45,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 04:14:45,069 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:14:45,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 04:14:45,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 04:14:45,069 INFO L87 Difference]: Start difference. First operand 24 states and 56 transitions. cyclomatic complexity: 33 Second operand 7 states. [2020-06-22 04:14:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:14:45,285 INFO L93 Difference]: Finished difference Result 48 states and 109 transitions. [2020-06-22 04:14:45,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 04:14:45,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 109 transitions. [2020-06-22 04:14:45,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2020-06-22 04:14:45,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 108 transitions. [2020-06-22 04:14:45,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2020-06-22 04:14:45,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2020-06-22 04:14:45,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 108 transitions. [2020-06-22 04:14:45,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:14:45,289 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 108 transitions. [2020-06-22 04:14:45,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 108 transitions. [2020-06-22 04:14:45,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2020-06-22 04:14:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 04:14:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 87 transitions. [2020-06-22 04:14:45,290 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 87 transitions. [2020-06-22 04:14:45,290 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 87 transitions. [2020-06-22 04:14:45,290 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 04:14:45,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 87 transitions. [2020-06-22 04:14:45,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-06-22 04:14:45,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:14:45,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:14:45,292 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:45,292 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:45,293 INFO L794 eck$LassoCheckResult]: Stem: 311#ULTIMATE.startENTRY [212] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_4|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 312#L12 [140] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 310#L12-2 [163] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 297#L16 [214] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret10.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret10.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset, ULTIMATE.start_main_#t~ret10.base] 298#L12-3 [126] L12-3-->L12-5: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 1) (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_13 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_13} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 303#L12-5 [169] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 304#L16-2 [216] L16-2-->L29-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret10.base_7|) (= |v_ULTIMATE.start_main_#t~ret11.base_5| |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret10.offset_7|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret11.base_5|))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|} OutVars{ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_4|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_4|, 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_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_10|, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_7|, ULTIMATE.start_cstrpbrk_#t~post8.base=|v_ULTIMATE.start_cstrpbrk_#t~post8.base_4|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_6|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post8.offset=|v_ULTIMATE.start_cstrpbrk_#t~post8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, 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_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrpbrk_#t~short7, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_#t~post8.base, ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post8.offset] 314#L29-4 [2020-06-22 04:14:45,293 INFO L796 eck$LassoCheckResult]: Loop: 314#L29-4 [110] L29-4-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4 1) (select |v_#length_9| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 300#L29-1 [178] L29-1-->L31: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~s~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (< |v_ULTIMATE.start_cstrpbrk_#t~mem3_6| 0)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_~s~0.offset] 301#L31 [218] L31-->L32-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (= (select (select |v_#memory_int_18| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) v_ULTIMATE.start_cstrpbrk_~c~0_8) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_23| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_27| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_~c~0] 296#L32-8 [137] L32-8-->L32-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_4 1) (select |v_#length_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_4)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_4) (= |v_ULTIMATE.start_cstrpbrk_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrpbrk_~s~0.base_4) v_ULTIMATE.start_cstrpbrk_~s~0.offset_4)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~s~0.base_4))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4, #valid=|v_#valid_15|} OutVars{#valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem5] 307#L32-1 [192] L32-1-->L32-2: Formula: (and (< |v_ULTIMATE.start_cstrpbrk_#t~mem5_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short7_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short7] 308#L32-2 [124] L32-2-->L32-3: Formula: |v_ULTIMATE.start_cstrpbrk_#t~short7_3| InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_3|} AuxVars[] AssignedVars[] 327#L32-3 [121] L32-3-->L32-4: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem6_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_15| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_cstrpbrk_~s~0.base_7))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_15|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_2|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_15|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem6] 326#L32-4 [201] L32-4-->L32-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrpbrk_~c~0_4 256))) (and (not |v_ULTIMATE.start_cstrpbrk_#t~short7_4|) (> .cse0 127) (= |v_ULTIMATE.start_cstrpbrk_#t~mem6_3| (+ .cse0 (- 256))))) InVars {ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_3|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_4} OutVars{ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_3|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_4, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short7] 317#L32-6 [114] L32-6-->L32-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short7_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_4|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_4|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_#t~short7] 313#L32-9 [222] L32-9-->L29-4: Formula: (and (= (select |v_#valid_28| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) 1) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= (select (select |v_#memory_int_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_24| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_24|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_6|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_24|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base] 314#L29-4 [2020-06-22 04:14:45,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:45,293 INFO L82 PathProgramCache]: Analyzing trace with hash 785179265, now seen corresponding path program 5 times [2020-06-22 04:14:45,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:45,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:45,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:14:45,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:45,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1213316020, now seen corresponding path program 1 times [2020-06-22 04:14:45,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:45,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:45,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:14:45,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:45,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:45,314 INFO L82 PathProgramCache]: Analyzing trace with hash 799147724, now seen corresponding path program 1 times [2020-06-22 04:14:45,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:45,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:45,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:14:45,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:45,374 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 04:14:45,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:14:45,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 04:14:45,490 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-06-22 04:14:45,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 04:14:45,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 04:14:45,524 INFO L87 Difference]: Start difference. First operand 36 states and 87 transitions. cyclomatic complexity: 52 Second operand 7 states. [2020-06-22 04:14:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:14:45,783 INFO L93 Difference]: Finished difference Result 89 states and 223 transitions. [2020-06-22 04:14:45,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 04:14:45,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 223 transitions. [2020-06-22 04:14:45,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 78 [2020-06-22 04:14:45,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 89 states and 223 transitions. [2020-06-22 04:14:45,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2020-06-22 04:14:45,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2020-06-22 04:14:45,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 223 transitions. [2020-06-22 04:14:45,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:14:45,788 INFO L706 BuchiCegarLoop]: Abstraction has 89 states and 223 transitions. [2020-06-22 04:14:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 223 transitions. [2020-06-22 04:14:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2020-06-22 04:14:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-06-22 04:14:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 170 transitions. [2020-06-22 04:14:45,790 INFO L729 BuchiCegarLoop]: Abstraction has 71 states and 170 transitions. [2020-06-22 04:14:45,791 INFO L609 BuchiCegarLoop]: Abstraction has 71 states and 170 transitions. [2020-06-22 04:14:45,791 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 04:14:45,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 170 transitions. [2020-06-22 04:14:45,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2020-06-22 04:14:45,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:14:45,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:14:45,792 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:45,792 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:45,793 INFO L794 eck$LassoCheckResult]: Stem: 459#ULTIMATE.startENTRY [212] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_4|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 460#L12 [140] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 458#L12-2 [163] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 442#L16 [214] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret10.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret10.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset, ULTIMATE.start_main_#t~ret10.base] 443#L12-3 [144] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 449#L12-5 [169] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 450#L16-2 [216] L16-2-->L29-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret10.base_7|) (= |v_ULTIMATE.start_main_#t~ret11.base_5| |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret10.offset_7|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret11.base_5|))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|} OutVars{ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_4|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_4|, 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_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_10|, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_7|, ULTIMATE.start_cstrpbrk_#t~post8.base=|v_ULTIMATE.start_cstrpbrk_#t~post8.base_4|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_6|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post8.offset=|v_ULTIMATE.start_cstrpbrk_#t~post8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, 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_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrpbrk_#t~short7, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_#t~post8.base, ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post8.offset] 465#L29-4 [2020-06-22 04:14:45,794 INFO L796 eck$LassoCheckResult]: Loop: 465#L29-4 [110] L29-4-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4 1) (select |v_#length_9| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 466#L29-1 [178] L29-1-->L31: Formula: (and (= v_ULTIMATE.start_cstrpbrk_~s~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3) (< |v_ULTIMATE.start_cstrpbrk_#t~mem3_6| 0)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_~s~0.offset] 480#L31 [218] L31-->L32-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (= (select (select |v_#memory_int_18| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) v_ULTIMATE.start_cstrpbrk_~c~0_8) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_23| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_27| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_~c~0] 483#L32-8 [137] L32-8-->L32-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_4 1) (select |v_#length_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_4)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_4) (= |v_ULTIMATE.start_cstrpbrk_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrpbrk_~s~0.base_4) v_ULTIMATE.start_cstrpbrk_~s~0.offset_4)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~s~0.base_4))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4, #valid=|v_#valid_15|} OutVars{#valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem5] 496#L32-1 [192] L32-1-->L32-2: Formula: (and (< |v_ULTIMATE.start_cstrpbrk_#t~mem5_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short7_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short7] 495#L32-2 [124] L32-2-->L32-3: Formula: |v_ULTIMATE.start_cstrpbrk_#t~short7_3| InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_3|} AuxVars[] AssignedVars[] 491#L32-3 [121] L32-3-->L32-4: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem6_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_15| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_cstrpbrk_~s~0.base_7))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_15|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_2|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_15|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem6] 488#L32-4 [201] L32-4-->L32-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrpbrk_~c~0_4 256))) (and (not |v_ULTIMATE.start_cstrpbrk_#t~short7_4|) (> .cse0 127) (= |v_ULTIMATE.start_cstrpbrk_#t~mem6_3| (+ .cse0 (- 256))))) InVars {ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_3|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_4} OutVars{ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_3|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_4, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short7] 482#L32-6 [114] L32-6-->L32-9: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short7_7|) InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_7|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_4|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_4|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_#t~short7] 481#L32-9 [222] L32-9-->L29-4: Formula: (and (= (select |v_#valid_28| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) 1) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) (= (select (select |v_#memory_int_19| v_ULTIMATE.start_cstrpbrk_~s~0.base_16) v_ULTIMATE.start_cstrpbrk_~s~0.offset_13) v_ULTIMATE.start_cstrpbrk_~c~0_10) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18 v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_13 1) (select |v_#length_24| v_ULTIMATE.start_cstrpbrk_~s~0.base_16)) (= v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15 (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16 1))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_16, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_18, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_24|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} OutVars{ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_6|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_10|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_15, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_6|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_17, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_10, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_16, #length=|v_#length_24|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_13} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post2.base, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base] 465#L29-4 [2020-06-22 04:14:45,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:45,794 INFO L82 PathProgramCache]: Analyzing trace with hash 785196563, now seen corresponding path program 1 times [2020-06-22 04:14:45,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:45,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:14:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:45,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:45,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1213316020, now seen corresponding path program 2 times [2020-06-22 04:14:45,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:45,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:45,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:14:45,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:45,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:45,813 INFO L82 PathProgramCache]: Analyzing trace with hash -187139106, now seen corresponding path program 1 times [2020-06-22 04:14:45,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:45,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:45,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:14:45,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:45,945 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-06-22 04:14:46,372 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2020-06-22 04:14:46,513 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-06-22 04:14:46,525 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:14:46,527 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:14:46,527 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:14:46,527 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:14:46,527 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:14:46,527 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:14:46,527 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:14:46,527 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:14:46,528 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 04:14:46,528 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:14:46,528 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:14:46,545 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 04:14:46,553 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 04:14:46,555 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 04:14:46,558 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 04:14:46,560 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 04:14:46,562 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 04:14:46,565 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 04:14:46,567 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 04:14:46,571 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 04:14:46,573 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 04:14:46,575 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 04:14:46,577 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 04:14:46,579 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 04:14:46,582 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 04:14:46,584 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 04:14:46,586 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 04:14:46,588 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 04:14:46,590 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 04:14:46,890 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-06-22 04:14:47,013 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2020-06-22 04:14:47,014 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 04:14:47,525 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:14:47,532 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:14:47,534 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 04:14:47,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,541 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 04:14:47,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,543 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 04:14:47,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,545 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 04:14:47,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,547 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 04:14:47,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,549 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 04:14:47,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:47,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:47,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,555 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 04:14:47,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,557 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 04:14:47,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,559 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 04:14:47,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,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 04:14:47,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,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 04:14:47,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,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 04:14:47,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,567 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 04:14:47,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:47,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:47,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,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 04:14:47,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,573 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 04:14:47,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,575 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 04:14:47,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,577 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 04:14:47,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,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 04:14:47,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,584 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 04:14:47,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:47,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:47,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,589 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 04:14:47,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:47,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:47,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,594 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 04:14:47,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:47,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:47,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,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 04:14:47,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:47,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:47,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,609 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 04:14:47,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:47,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:47,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,612 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 04:14:47,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:47,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:47,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:47,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,615 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 04:14:47,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:47,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:47,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,622 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 04:14:47,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:47,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:47,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,631 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 04:14:47,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:47,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:47,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:47,641 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 04:14:47,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:47,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:47,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:47,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:47,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:47,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:47,655 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:14:47,669 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 04:14:47,669 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 04:14:47,671 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:14:47,672 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 04:14:47,673 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:14:47,673 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~ret10.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2020-06-22 04:14:47,694 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2020-06-22 04:14:47,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:47,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:14:47,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:14:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:47,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:14:47,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:14:47,779 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 04:14:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:47,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:14:47,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:14:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:47,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:14:47,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:14:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:47,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:14:47,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:14:47,910 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 04:14:47,913 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-06-22 04:14:47,914 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 71 states and 170 transitions. cyclomatic complexity: 101 Second operand 3 states. [2020-06-22 04:14:48,056 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 71 states and 170 transitions. cyclomatic complexity: 101. Second operand 3 states. Result 133 states and 328 transitions. Complement of second has 4 states. [2020-06-22 04:14:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 04:14:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 04:14:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-06-22 04:14:48,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 7 letters. Loop has 10 letters. [2020-06-22 04:14:48,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:14:48,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 17 letters. Loop has 10 letters. [2020-06-22 04:14:48,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:14:48,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 7 letters. Loop has 20 letters. [2020-06-22 04:14:48,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:14:48,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 328 transitions. [2020-06-22 04:14:48,069 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 48 [2020-06-22 04:14:48,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 131 states and 324 transitions. [2020-06-22 04:14:48,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2020-06-22 04:14:48,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2020-06-22 04:14:48,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 324 transitions. [2020-06-22 04:14:48,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:14:48,072 INFO L706 BuchiCegarLoop]: Abstraction has 131 states and 324 transitions. [2020-06-22 04:14:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 324 transitions. [2020-06-22 04:14:48,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2020-06-22 04:14:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-06-22 04:14:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 212 transitions. [2020-06-22 04:14:48,075 INFO L729 BuchiCegarLoop]: Abstraction has 89 states and 212 transitions. [2020-06-22 04:14:48,075 INFO L609 BuchiCegarLoop]: Abstraction has 89 states and 212 transitions. [2020-06-22 04:14:48,075 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 04:14:48,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 212 transitions. [2020-06-22 04:14:48,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 04:14:48,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:14:48,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:14:48,076 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:48,076 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 04:14:48,077 INFO L794 eck$LassoCheckResult]: Stem: 864#ULTIMATE.startENTRY [212] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_4|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 865#L12 [140] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 863#L12-2 [163] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 838#L16 [214] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret10.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret10.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset, ULTIMATE.start_main_#t~ret10.base] 839#L12-3 [144] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 848#L12-5 [169] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 849#L16-2 [216] L16-2-->L29-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret10.base_7|) (= |v_ULTIMATE.start_main_#t~ret11.base_5| |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret10.offset_7|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret11.base_5|))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|} OutVars{ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_4|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_4|, 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_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_10|, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_7|, ULTIMATE.start_cstrpbrk_#t~post8.base=|v_ULTIMATE.start_cstrpbrk_#t~post8.base_4|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_6|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post8.offset=|v_ULTIMATE.start_cstrpbrk_#t~post8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, 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_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrpbrk_#t~short7, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_#t~post8.base, ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post8.offset] 869#L29-4 [110] L29-4-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4 1) (select |v_#length_9| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 871#L29-1 [179] L29-1-->L31: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem3_6| 0) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_~s~0.offset] 861#L31 [218] L31-->L32-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (= (select (select |v_#memory_int_18| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) v_ULTIMATE.start_cstrpbrk_~c~0_8) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_23| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_27| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_~c~0] 835#L32-8 [2020-06-22 04:14:48,078 INFO L796 eck$LassoCheckResult]: Loop: 835#L32-8 [137] L32-8-->L32-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_4 1) (select |v_#length_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_4)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_4) (= |v_ULTIMATE.start_cstrpbrk_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrpbrk_~s~0.base_4) v_ULTIMATE.start_cstrpbrk_~s~0.offset_4)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~s~0.base_4))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4, #valid=|v_#valid_15|} OutVars{#valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem5] 868#L32-1 [193] L32-1-->L32-2: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem5_3| 0) (not |v_ULTIMATE.start_cstrpbrk_#t~short7_2|)) InVars {ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short7] 858#L32-2 [125] L32-2-->L32-6: Formula: (not |v_ULTIMATE.start_cstrpbrk_#t~short7_5|) InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_5|} OutVars{ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_5|} AuxVars[] AssignedVars[] 834#L32-6 [115] L32-6-->L32-8: Formula: (and |v_ULTIMATE.start_cstrpbrk_#t~short7_9| (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_8 (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_9 1)) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_11 v_ULTIMATE.start_cstrpbrk_~s~0.base_10)) InVars {ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_9, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_9|} OutVars{ULTIMATE.start_cstrpbrk_#t~post8.base=|v_ULTIMATE.start_cstrpbrk_#t~post8.base_2|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_5|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_5|, ULTIMATE.start_cstrpbrk_#t~post8.offset=|v_ULTIMATE.start_cstrpbrk_#t~post8.offset_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post8.base, ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_#t~post8.offset, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#t~short7] 835#L32-8 [2020-06-22 04:14:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:48,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1399025794, now seen corresponding path program 1 times [2020-06-22 04:14:48,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:48,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:48,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:14:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:48,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:48,096 INFO L82 PathProgramCache]: Analyzing trace with hash 5194351, now seen corresponding path program 1 times [2020-06-22 04:14:48,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:48,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:48,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:48,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:14:48,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:48,113 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 04:14:48,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 04:14:48,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 04:14:48,114 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 04:14:48,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 04:14:48,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 04:14:48,114 INFO L87 Difference]: Start difference. First operand 89 states and 212 transitions. cyclomatic complexity: 126 Second operand 3 states. [2020-06-22 04:14:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 04:14:48,162 INFO L93 Difference]: Finished difference Result 68 states and 126 transitions. [2020-06-22 04:14:48,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 04:14:48,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 126 transitions. [2020-06-22 04:14:48,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 04:14:48,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 44 states and 94 transitions. [2020-06-22 04:14:48,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 04:14:48,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-06-22 04:14:48,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 94 transitions. [2020-06-22 04:14:48,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 04:14:48,168 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 94 transitions. [2020-06-22 04:14:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 94 transitions. [2020-06-22 04:14:48,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-06-22 04:14:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 04:14:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 84 transitions. [2020-06-22 04:14:48,170 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 84 transitions. [2020-06-22 04:14:48,170 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 84 transitions. [2020-06-22 04:14:48,170 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 04:14:48,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 84 transitions. [2020-06-22 04:14:48,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 04:14:48,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 04:14:48,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 04:14:48,171 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 04:14:48,171 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 04:14:48,172 INFO L794 eck$LassoCheckResult]: Stem: 1021#ULTIMATE.startENTRY [212] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_4|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 1022#L12 [140] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 1020#L12-2 [163] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 1001#L16 [214] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret10.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 |v_ULTIMATE.start_main_#t~ret10.base_6|) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset, ULTIMATE.start_main_#t~ret10.base] 1002#L12-3 [144] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 1010#L12-5 [169] L12-5-->L16-2: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 1011#L16-2 [216] L16-2-->L29-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13 v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| v_ULTIMATE.start_cstrpbrk_~s1.base_3) (= v_ULTIMATE.start_cstrpbrk_~s1.offset_3 |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|) (<= 1 .cse0) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= v_ULTIMATE.start_cstrpbrk_~s2.offset_4 |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2| v_ULTIMATE.start_cstrpbrk_~s2.base_4) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret11.offset_5|) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.base_2| |v_ULTIMATE.start_main_#t~ret10.base_7|) (= |v_ULTIMATE.start_main_#t~ret11.base_5| |v_ULTIMATE.start_cstrpbrk_#in~s2.base_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2| |v_ULTIMATE.start_main_#t~ret10.offset_7|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret11.base_5|))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|} OutVars{ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_11, ULTIMATE.start_cstrpbrk_#t~post2.offset=|v_ULTIMATE.start_cstrpbrk_#t~post2.offset_4|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_12, ULTIMATE.start_cstrpbrk_#t~post2.base=|v_ULTIMATE.start_cstrpbrk_#t~post2.base_4|, 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_3, ULTIMATE.start_cstrpbrk_#in~s1.base=|v_ULTIMATE.start_cstrpbrk_#in~s1.base_2|, ULTIMATE.start_cstrpbrk_#in~s1.offset=|v_ULTIMATE.start_cstrpbrk_#in~s1.offset_2|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_13, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_10|, ULTIMATE.start_cstrpbrk_#res.offset=|v_ULTIMATE.start_cstrpbrk_#res.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrpbrk_#t~mem9=|v_ULTIMATE.start_cstrpbrk_#t~mem9_7|, ULTIMATE.start_cstrpbrk_#t~post8.base=|v_ULTIMATE.start_cstrpbrk_#t~post8.base_4|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_6|, ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_4, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_5|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_7|, ULTIMATE.start_cstrpbrk_#in~s2.offset=|v_ULTIMATE.start_cstrpbrk_#in~s2.offset_2|, ULTIMATE.start_cstrpbrk_#res.base=|v_ULTIMATE.start_cstrpbrk_#res.base_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_4, ULTIMATE.start_cstrpbrk_~s1.base=v_ULTIMATE.start_cstrpbrk_~s1.base_3, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_7, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_15, ULTIMATE.start_cstrpbrk_#t~post8.offset=|v_ULTIMATE.start_cstrpbrk_#t~post8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start_cstrpbrk_~sc1~0.offset, ULTIMATE.start_cstrpbrk_#t~post2.offset, ULTIMATE.start_cstrpbrk_~s~0.offset, 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_#in~s1.offset, ULTIMATE.start_cstrpbrk_~sc1~0.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrpbrk_#t~short7, ULTIMATE.start_cstrpbrk_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrpbrk_#t~mem9, ULTIMATE.start_cstrpbrk_#t~post8.base, ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_~s2.offset, ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_#in~s2.offset, ULTIMATE.start_cstrpbrk_#res.base, ULTIMATE.start_cstrpbrk_~s2.base, ULTIMATE.start_cstrpbrk_~s1.base, #memory_int, ULTIMATE.start_cstrpbrk_~c~0, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~post8.offset] 1025#L29-4 [110] L29-4-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4 1) (select |v_#length_9| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4)) (= |v_ULTIMATE.start_cstrpbrk_#t~mem3_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_4, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_4, #length=|v_#length_9|, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem3] 1005#L29-1 [179] L29-1-->L31: Formula: (and (> |v_ULTIMATE.start_cstrpbrk_#t~mem3_6| 0) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_3 v_ULTIMATE.start_cstrpbrk_~s2.base_3) (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_3 v_ULTIMATE.start_cstrpbrk_~s2.offset_3)) InVars {ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_6|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3} OutVars{ULTIMATE.start_cstrpbrk_~s2.offset=v_ULTIMATE.start_cstrpbrk_~s2.offset_3, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_3, ULTIMATE.start_cstrpbrk_#t~mem3=|v_ULTIMATE.start_cstrpbrk_#t~mem3_5|, ULTIMATE.start_cstrpbrk_~s2.base=v_ULTIMATE.start_cstrpbrk_~s2.base_3, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_#t~mem3, ULTIMATE.start_cstrpbrk_~s~0.offset] 1006#L31 [218] L31-->L32-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) (= (select (select |v_#memory_int_18| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14) v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12) v_ULTIMATE.start_cstrpbrk_~c~0_8) (<= (+ v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12 1) (select |v_#length_23| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14)) (= 1 (select |v_#valid_27| v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14))) InVars {ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} OutVars{ULTIMATE.start_cstrpbrk_~sc1~0.offset=v_ULTIMATE.start_cstrpbrk_~sc1~0.offset_12, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_cstrpbrk_#t~mem4=|v_ULTIMATE.start_cstrpbrk_#t~mem4_6|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_8, ULTIMATE.start_cstrpbrk_~sc1~0.base=v_ULTIMATE.start_cstrpbrk_~sc1~0.base_14, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem4, ULTIMATE.start_cstrpbrk_~c~0] 998#L32-8 [2020-06-22 04:14:48,173 INFO L796 eck$LassoCheckResult]: Loop: 998#L32-8 [137] L32-8-->L32-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_4 1) (select |v_#length_13| v_ULTIMATE.start_cstrpbrk_~s~0.base_4)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_4) (= |v_ULTIMATE.start_cstrpbrk_#t~mem5_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrpbrk_~s~0.base_4) v_ULTIMATE.start_cstrpbrk_~s~0.offset_4)) (= 1 (select |v_#valid_15| v_ULTIMATE.start_cstrpbrk_~s~0.base_4))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4, #valid=|v_#valid_15|} OutVars{#valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_4, #length=|v_#length_13|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem5] 1017#L32-1 [192] L32-1-->L32-2: Formula: (and (< |v_ULTIMATE.start_cstrpbrk_#t~mem5_3| 0) |v_ULTIMATE.start_cstrpbrk_#t~short7_2|) InVars {ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_3|, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short7] 1015#L32-2 [124] L32-2-->L32-3: Formula: |v_ULTIMATE.start_cstrpbrk_#t~short7_3| InVars {ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_3|} OutVars{ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_3|} AuxVars[] AssignedVars[] 1012#L32-3 [121] L32-3-->L32-4: Formula: (and (= |v_ULTIMATE.start_cstrpbrk_#t~mem6_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_cstrpbrk_~s~0.base_7) v_ULTIMATE.start_cstrpbrk_~s~0.offset_6)) (<= 0 v_ULTIMATE.start_cstrpbrk_~s~0.offset_6) (<= (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_6 1) (select |v_#length_15| v_ULTIMATE.start_cstrpbrk_~s~0.base_7)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_cstrpbrk_~s~0.base_7))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_15|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6, #valid=|v_#valid_17|} OutVars{#valid=|v_#valid_17|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_2|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_7, #length=|v_#length_15|, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_6} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~mem6] 1003#L32-4 [210] L32-4-->L32-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrpbrk_~c~0_4 256))) (and |v_ULTIMATE.start_cstrpbrk_#t~short7_4| (< |v_ULTIMATE.start_cstrpbrk_#t~mem6_3| .cse0) (> |v_ULTIMATE.start_cstrpbrk_#t~mem6_3| (+ .cse0 (- 256))))) InVars {ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_3|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_4} OutVars{ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_3|, ULTIMATE.start_cstrpbrk_~c~0=v_ULTIMATE.start_cstrpbrk_~c~0_4, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~short7] 997#L32-6 [115] L32-6-->L32-8: Formula: (and |v_ULTIMATE.start_cstrpbrk_#t~short7_9| (= v_ULTIMATE.start_cstrpbrk_~s~0.offset_8 (+ v_ULTIMATE.start_cstrpbrk_~s~0.offset_9 1)) (= v_ULTIMATE.start_cstrpbrk_~s~0.base_11 v_ULTIMATE.start_cstrpbrk_~s~0.base_10)) InVars {ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_11, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_9, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_9|} OutVars{ULTIMATE.start_cstrpbrk_#t~post8.base=|v_ULTIMATE.start_cstrpbrk_#t~post8.base_2|, ULTIMATE.start_cstrpbrk_#t~mem6=|v_ULTIMATE.start_cstrpbrk_#t~mem6_5|, ULTIMATE.start_cstrpbrk_#t~mem5=|v_ULTIMATE.start_cstrpbrk_#t~mem5_5|, ULTIMATE.start_cstrpbrk_#t~post8.offset=|v_ULTIMATE.start_cstrpbrk_#t~post8.offset_2|, ULTIMATE.start_cstrpbrk_~s~0.base=v_ULTIMATE.start_cstrpbrk_~s~0.base_10, ULTIMATE.start_cstrpbrk_~s~0.offset=v_ULTIMATE.start_cstrpbrk_~s~0.offset_8, ULTIMATE.start_cstrpbrk_#t~short7=|v_ULTIMATE.start_cstrpbrk_#t~short7_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrpbrk_#t~post8.base, ULTIMATE.start_cstrpbrk_#t~mem6, ULTIMATE.start_cstrpbrk_#t~mem5, ULTIMATE.start_cstrpbrk_#t~post8.offset, ULTIMATE.start_cstrpbrk_~s~0.base, ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_cstrpbrk_#t~short7] 998#L32-8 [2020-06-22 04:14:48,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:48,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1399025794, now seen corresponding path program 2 times [2020-06-22 04:14:48,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:48,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:48,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:48,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:14:48,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:48,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:48,245 INFO L82 PathProgramCache]: Analyzing trace with hash 695863094, now seen corresponding path program 1 times [2020-06-22 04:14:48,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:48,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:48,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:48,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 04:14:48,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:48,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:48,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2004004105, now seen corresponding path program 1 times [2020-06-22 04:14:48,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 04:14:48,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 04:14:48,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:48,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 04:14:48,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 04:14:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 04:14:48,841 WARN L188 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2020-06-22 04:14:48,984 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-06-22 04:14:48,986 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 04:14:48,986 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 04:14:48,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 04:14:48,986 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 04:14:48,986 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 04:14:48,986 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 04:14:48,986 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 04:14:48,986 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 04:14:48,986 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso [2020-06-22 04:14:48,987 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 04:14:48,987 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 04:14:48,989 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 04:14:48,991 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 04:14:48,992 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 04:14:48,994 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 04:14:48,996 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 04:14:48,997 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 04:14:48,999 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 04:14:49,000 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 04:14:49,002 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 04:14:49,003 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 04:14:49,004 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 04:14:49,006 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 04:14:49,007 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 04:14:49,009 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 04:14:49,011 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 04:14:49,012 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 04:14:49,305 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2020-06-22 04:14:49,357 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 04:14:49,358 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 04:14:49,360 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 04:14:49,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 04:14:49,733 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 04:14:49,734 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 04:14:49,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:49,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:49,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:49,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,737 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 04:14:49,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:49,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:49,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:49,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,738 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 04:14:49,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:49,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:49,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,741 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 04:14:49,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:49,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:49,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:49,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,743 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 04:14:49,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:49,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:49,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:49,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,745 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 04:14:49,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:49,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:49,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:49,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,746 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 04:14:49,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:49,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:49,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:49,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,748 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 04:14:49,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:49,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:49,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:49,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,750 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 04:14:49,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:49,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:49,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:49,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,752 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 04:14:49,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:49,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:49,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:49,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,753 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 04:14:49,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:49,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:49,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:49,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,755 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 04:14:49,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:49,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:49,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:49,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,757 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 04:14:49,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:49,758 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:49,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,759 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 04:14:49,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:49,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:49,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:49,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,761 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 04:14:49,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 04:14:49,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 04:14:49,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 04:14:49,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 04:14:49,763 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 04:14:49,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 04:14:49,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 04:14:49,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 04:14:49,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 04:14:49,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 04:14:49,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 04:14:49,784 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 04:14:49,795 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 04:14:49,795 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 04:14:49,795 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 04:14:49,796 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 04:14:49,796 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 04:14:49,796 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_2, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_2 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2020-06-22 04:14:49,833 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2020-06-22 04:14:49,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:49,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 04:14:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:49,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 04:14:49,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:14:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:49,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:14:49,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:14:49,952 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 04:14:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 04:14:50,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 04:14:50,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 04:14:50,070 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 04:14:50,070 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 4 loop predicates [2020-06-22 04:14:50,070 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 40 states and 84 transitions. cyclomatic complexity: 46 Second operand 6 states. [2020-06-22 04:14:50,266 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 40 states and 84 transitions. cyclomatic complexity: 46. Second operand 6 states. Result 69 states and 152 transitions. Complement of second has 7 states. [2020-06-22 04:14:50,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 04:14:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 04:14:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-06-22 04:14:50,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 10 letters. Loop has 6 letters. [2020-06-22 04:14:50,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:14:50,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 16 letters. Loop has 6 letters. [2020-06-22 04:14:50,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:14:50,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 10 letters. Loop has 12 letters. [2020-06-22 04:14:50,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 04:14:50,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 152 transitions. [2020-06-22 04:14:50,272 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:14:50,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2020-06-22 04:14:50,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 04:14:50,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 04:14:50,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 04:14:50,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 04:14:50,273 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:14:50,273 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:14:50,273 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 04:14:50,273 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 04:14:50,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 04:14:50,273 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 04:14:50,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 04:14:50,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 04:14:50 BasicIcfg [2020-06-22 04:14:50,279 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 04:14:50,280 INFO L168 Benchmark]: Toolchain (without parser) took 204007.60 ms. Allocated memory was 649.6 MB in the beginning and 1.2 GB in the end (delta: 588.8 MB). Free memory was 565.2 MB in the beginning and 685.8 MB in the end (delta: -120.5 MB). Peak memory consumption was 468.3 MB. Max. memory is 50.3 GB. [2020-06-22 04:14:50,280 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 04:14:50,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.00 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 565.2 MB in the beginning and 649.3 MB in the end (delta: -84.1 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-22 04:14:50,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.29 ms. Allocated memory is still 685.2 MB. Free memory was 649.3 MB in the beginning and 647.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 04:14:50,283 INFO L168 Benchmark]: Boogie Preprocessor took 27.87 ms. Allocated memory is still 685.2 MB. Free memory was 647.1 MB in the beginning and 645.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 04:14:50,283 INFO L168 Benchmark]: RCFGBuilder took 426.10 ms. Allocated memory is still 685.2 MB. Free memory was 645.0 MB in the beginning and 620.7 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. [2020-06-22 04:14:50,283 INFO L168 Benchmark]: BlockEncodingV2 took 148.87 ms. Allocated memory is still 685.2 MB. Free memory was 620.7 MB in the beginning and 608.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. [2020-06-22 04:14:50,283 INFO L168 Benchmark]: TraceAbstraction took 197097.28 ms. Allocated memory was 685.2 MB in the beginning and 1.2 GB in the end (delta: 545.8 MB). Free memory was 607.7 MB in the beginning and 1.0 GB in the end (delta: -409.6 MB). Peak memory consumption was 729.7 MB. Max. memory is 50.3 GB. [2020-06-22 04:14:50,284 INFO L168 Benchmark]: BuchiAutomizer took 5954.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.3 MB). Free memory was 1.0 GB in the beginning and 685.8 MB in the end (delta: 331.5 MB). Peak memory consumption was 338.8 MB. Max. memory is 50.3 GB. [2020-06-22 04:14:50,286 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 44 locations, 51 edges - StatisticsResult: Encoded RCFG 31 locations, 64 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 304.00 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 565.2 MB in the beginning and 649.3 MB in the end (delta: -84.1 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.29 ms. Allocated memory is still 685.2 MB. Free memory was 649.3 MB in the beginning and 647.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 27.87 ms. Allocated memory is still 685.2 MB. Free memory was 647.1 MB in the beginning and 645.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 426.10 ms. Allocated memory is still 685.2 MB. Free memory was 645.0 MB in the beginning and 620.7 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 148.87 ms. Allocated memory is still 685.2 MB. Free memory was 620.7 MB in the beginning and 608.8 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 50.3 GB. * TraceAbstraction took 197097.28 ms. Allocated memory was 685.2 MB in the beginning and 1.2 GB in the end (delta: 545.8 MB). Free memory was 607.7 MB in the beginning and 1.0 GB in the end (delta: -409.6 MB). Peak memory consumption was 729.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5954.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.3 MB). Free memory was 1.0 GB in the beginning and 685.8 MB in the end (delta: 331.5 MB). Peak memory consumption was 338.8 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[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #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 #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 #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 #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 #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 #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 #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 #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 #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 - 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 #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 #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 #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 #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 #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 #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 #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 #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 #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 #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 - 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 #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 #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 #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 #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 #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 #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 #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 #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 #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 - 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 #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 #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 #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 #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 #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 #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 - 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: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 34]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2020-06-22 04:14:50,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,301 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((1 <= length && nondetString == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1 - InvariantResult [Line: 32]: Loop Invariant [2020-06-22 04:14:50,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:50,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:50,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,306 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,308 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,309 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,310 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,311 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,312 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,312 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,312 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,312 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,312 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,313 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,313 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,313 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,313 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,314 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,314 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,314 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,314 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,314 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,315 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,317 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,318 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,319 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,320 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,321 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,324 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,325 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,326 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:50,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:50,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,340 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,341 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,347 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,348 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,349 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,350 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,351 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((unknown-#memory_int-unknown[sc1][sc1] + 1 <= 0 && c + 1 <= 0) && ((((\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 : int :: (0 == unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 + -1] && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 <= 0) && 0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1] && !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == sc1))) && sc1 + 2 <= unknown-#length-unknown[sc1]) && (\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 : int :: (v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 <= 0 && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 + -1] == 0) && 0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21)) && ((((((unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0 && 0 == __VERIFIER_nondet_String()) && s + 1 <= unknown-#length-unknown[s]) && !(nondetString == __VERIFIER_nondet_String())) && (((((((0 == unknown-#memory_int-unknown[s2][s2] || 2 <= unknown-#length-unknown[s2]) && (((((((((!(c == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length) && 1 == \valid[s2]) && \valid[s] == 1) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && \valid[sc1] == 1) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && s2 == 0) && 0 == sc1) && 1 <= s) && nondetString == 0) || ((((1 <= sc1 && (0 == unknown-#memory_int-unknown[s2][s2] || 2 <= unknown-#length-unknown[s2]) && (((((((((!(c == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length) && 1 == \valid[s2]) && \valid[s] == 1) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && \valid[sc1] == 1) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && s2 == 0) && 1 <= s) && nondetString == 0))) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0) || (((((((((0 == s && s2 == 0) && 0 == sc1) && (((((((((((((0 == unknown-#memory_int-unknown[s2][s2] || 2 <= unknown-#length-unknown[s2]) && !(c == 0)) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= length) && \valid[s] == 1) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s2]) && 1 <= unknown-#length-unknown[s]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && \valid[sc1] == 1) && (0 == unknown-#memory_int-unknown[s][s] || 2 <= unknown-#length-unknown[s])) && nondetString == 0) || ((((0 == s && 1 <= sc1) && s2 == 0) && (((((((((((((0 == unknown-#memory_int-unknown[s2][s2] || 2 <= unknown-#length-unknown[s2]) && !(c == 0)) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= length) && \valid[s] == 1) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s2]) && 1 <= unknown-#length-unknown[s]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && \valid[sc1] == 1) && (0 == unknown-#memory_int-unknown[s][s] || 2 <= unknown-#length-unknown[s])) && nondetString == 0)) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && 0 == __VERIFIER_nondet_String()) && !(nondetString == __VERIFIER_nondet_String())) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0))) || (sc1 + 1 <= unknown-#length-unknown[sc1] && (((\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 : int :: (0 == unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 + -1] && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 <= 0) && 0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1] && !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == sc1))) && (((((((((((((((0 == unknown-#memory_int-unknown[s2][s2] || 2 <= unknown-#length-unknown[s2]) && (((((((((!(c == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length) && 1 == \valid[s2]) && \valid[s] == 1) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && \valid[sc1] == 1) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= c) && s2 == 0) && 0 == sc1) && 1 <= s) && nondetString == 0) && 1 <= unknown-#memory_int-unknown[sc1][sc1]) || ((((((1 <= sc1 && (0 == unknown-#memory_int-unknown[s2][s2] || 2 <= unknown-#length-unknown[s2]) && (((((((((!(c == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length) && 1 == \valid[s2]) && \valid[s] == 1) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && \valid[sc1] == 1) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= c) && s2 == 0) && 1 <= s) && nondetString == 0) && 1 <= unknown-#memory_int-unknown[sc1][sc1])) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && 0 == __VERIFIER_nondet_String()) && s + 1 <= unknown-#length-unknown[s]) && !(nondetString == __VERIFIER_nondet_String())) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0) || ((((unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0 && (((((((0 == s && 1 <= c) && s2 == 0) && 0 == sc1) && (((((((((((((0 == unknown-#memory_int-unknown[s2][s2] || 2 <= unknown-#length-unknown[s2]) && !(c == 0)) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= length) && \valid[s] == 1) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s2]) && 1 <= unknown-#length-unknown[s]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && \valid[sc1] == 1) && (0 == unknown-#memory_int-unknown[s][s] || 2 <= unknown-#length-unknown[s])) && nondetString == 0) && 1 <= unknown-#memory_int-unknown[sc1][sc1]) || ((((((0 == s && 1 <= sc1) && 1 <= c) && s2 == 0) && (((((((((((((0 == unknown-#memory_int-unknown[s2][s2] || 2 <= unknown-#length-unknown[s2]) && !(c == 0)) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= length) && \valid[s] == 1) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s2]) && 1 <= unknown-#length-unknown[s]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && \valid[sc1] == 1) && (0 == unknown-#memory_int-unknown[s][s] || 2 <= unknown-#length-unknown[s])) && nondetString == 0) && 1 <= unknown-#memory_int-unknown[sc1][sc1]))) && 0 == __VERIFIER_nondet_String()) && !(nondetString == __VERIFIER_nondet_String())) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0))) && (\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 : int :: (v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 <= 0 && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 + -1] == 0) && 0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21)) - InvariantResult [Line: 16]: Loop Invariant [2020-06-22 04:14:50,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((1 == \valid[__VERIFIER_nondet_String()] && 1 <= length) && nondetString == 0) && 0 == __VERIFIER_nondet_String()) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && !(nondetString == __VERIFIER_nondet_String())) && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][__VERIFIER_nondet_String()]) || ((((((((1 == \valid[__VERIFIER_nondet_String()] && 1 <= length) && nondetString == 0) && 0 == __VERIFIER_nondet_String()) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && !(nondetString == __VERIFIER_nondet_String())) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1] == 0)) || ((((((((1 == \valid[__VERIFIER_nondet_String()] && 1 <= length) && nondetString == 0) && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][__VERIFIER_nondet_String()]) && 0 == __VERIFIER_nondet_String()) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && __VERIFIER_nondet_String() + 1 <= 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) - InvariantResult [Line: 29]: Loop Invariant [2020-06-22 04:14:50,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 04:14:50,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:50,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:50,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:50,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,362 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,363 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] [2020-06-22 04:14:50,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:50,372 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:50,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 04:14:50,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 04:14:50,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21,QUANTIFIED] [2020-06-22 04:14:50,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,382 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 04:14:50,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 04:14:50,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((0 == unknown-#memory_int-unknown[s2][s2] || 2 <= unknown-#length-unknown[s2]) && 1 == \valid[__VERIFIER_nondet_String()]) && s2 == 0) && 0 == sc1) && 1 <= length) && nondetString == 0) && 0 == unknown-#memory_int-unknown[sc1][sc1]) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~length~0 : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~length~0 + ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + -1] == 0 && !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == sc1))) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s2]) && 1 <= unknown-#length-unknown[sc1]) && 1 == \valid[s2]) && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][__VERIFIER_nondet_String()]) && 0 == __VERIFIER_nondet_String()) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && \valid[sc1] == 1) && !(nondetString == __VERIFIER_nondet_String())) || (((((((((((((((1 == \valid[__VERIFIER_nondet_String()] && s2 == 0) && 0 == sc1) && 1 <= length) && nondetString == 0) && 0 == unknown-#memory_int-unknown[sc1][sc1]) && __VERIFIER_nondet_String() + 1 <= 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s2]) && 1 <= unknown-#length-unknown[sc1]) && 1 == \valid[s2]) && 0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][__VERIFIER_nondet_String()]) && 0 == __VERIFIER_nondet_String()) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && \valid[sc1] == 1)) || (((((((((((s + 2 <= unknown-#length-unknown[s] && 1 <= sc1 && (((s2 == 0 && 1 <= s) && ((0 == unknown-#memory_int-unknown[s2][s2] || 2 <= unknown-#length-unknown[s2]) && (((((((!(c == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length) && 1 == \valid[s2]) && \valid[s] == 1) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && \valid[sc1] == 1) && \valid[nondetString] == 1) && s + 1 <= unknown-#length-unknown[s]) || ((0 == s && s2 == 0) && ((0 == unknown-#memory_int-unknown[s2][s2] || 2 <= unknown-#length-unknown[s2]) && (((((((!(c == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && 1 <= length) && 1 == \valid[s2]) && \valid[s] == 1) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && \valid[sc1] == 1) && \valid[nondetString] == 1) && s + 1 <= unknown-#length-unknown[s]))) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] == 0) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1] && !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == sc1))) && nondetString == 0) && 0 == __VERIFIER_nondet_String()) && unknown-#length-unknown[nondetString] == length) && !(nondetString == __VERIFIER_nondet_String())) && sc1 + 1 <= unknown-#length-unknown[sc1]) && unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] == 0) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1] == 0)) || ((((((((\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 : int :: (0 == unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 + -1] && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 <= 0) && 0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0 && ((((((((1 == \valid[__VERIFIER_nondet_String()] && s2 == 0) && 1 <= length) && nondetString == 0) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s2]) && 1 <= unknown-#length-unknown[sc1]) && 1 == \valid[s2]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && \valid[sc1] == 1) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1] && !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == sc1))) && 0 == sc1) && 0 == __VERIFIER_nondet_String()) && (\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 : int :: (v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 <= 0 && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21 + -1] == 0) && 0 <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_21)) && unknown-#length-unknown[nondetString] == length) && !(nondetString == __VERIFIER_nondet_String())) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 14 error locations. SAFE Result, 196.8s OverallTime, 28 OverallIterations, 3 TraceHistogramMax, 134.1s AutomataDifference, 0.0s DeadEndRemovalTime, 55.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 273 SDtfs, 7830 SDslu, 2944 SDs, 0 SdLazy, 7303 SolverSat, 867 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 723 GetRequests, 272 SyntacticMatches, 6 SemanticMatches, 445 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 122.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=27, 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.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 1662 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 105 NumberOfFragments, 1762 HoareAnnotationTreeSize, 4 FomulaSimplifications, 15150054564 FormulaSimplificationTreeSizeReduction, 5.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 427700853 FormulaSimplificationTreeSizeReductionInter, 50.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 783 NumberOfCodeBlocks, 783 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 744 ConstructedInterpolants, 104 QuantifiedInterpolants, 260486 SizeOfPredicates, 105 NumberOfNonLiveVariables, 1737 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 39 InterpolantComputations, 20 PerfectInterpolantSequences, 132/312 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (6 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[__VERIFIER_nondet_String()] + -1 * sc1 and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[malloc(length * sizeof(char))] + -1 * s and consists of 6 locations. 6 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.7s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 87 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 89 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 104 SDtfs, 571 SDslu, 428 SDs, 0 SdLazy, 963 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI5 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital222 mio100 ax100 hnf100 lsp97 ukn74 mio100 lsp30 div120 bol100 ite100 ukn100 eq164 hnf85 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 04:11:22.831 ----------------------------------------------- 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/sandbox2/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/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 04:14:50.615 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check