YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:24:25,551 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:24:25,553 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:24:25,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:24:25,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:24:25,566 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:24:25,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:24:25,569 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:24:25,570 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:24:25,571 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:24:25,572 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:24:25,572 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:24:25,573 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:24:25,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:24:25,575 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:24:25,575 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:24:25,576 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:24:25,578 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:24:25,580 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:24:25,581 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:24:25,582 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:24:25,583 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:24:25,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:24:25,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:24:25,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:24:25,586 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:24:25,587 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:24:25,587 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:24:25,588 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:24:25,589 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:24:25,589 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:24:25,590 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:24:25,591 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:24:25,591 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:24:25,591 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:24:25,592 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:24:25,592 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:24:25,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:24:25,593 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:24:25,594 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:24:25,607 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:24:25,608 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:24:25,609 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:24:25,609 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:24:25,609 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:24:25,609 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:24:25,610 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:24:25,610 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:24:25,610 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:24:25,610 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:24:25,610 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:24:25,610 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:24:25,611 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:24:25,611 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:24:25,611 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:24:25,611 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:24:25,611 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:24:25,612 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:24:25,612 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:24:25,612 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:24:25,612 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:24:25,612 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:24:25,612 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:24:25,613 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:24:25,613 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:24:25,613 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:24:25,613 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:24:25,613 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:24:25,614 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:24:25,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:24:25,651 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:24:25,655 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:24:25,656 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:24:25,656 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:24:25,657 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:24:25,749 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/fc799c43b37d416dacaa7da161f5aaf0/FLAGb8e231a99 [2020-06-22 10:24:26,091 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:24:26,092 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:24:26,092 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:24:26,099 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/fc799c43b37d416dacaa7da161f5aaf0/FLAGb8e231a99 [2020-06-22 10:24:26,496 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/fc799c43b37d416dacaa7da161f5aaf0 [2020-06-22 10:24:26,507 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:24:26,509 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:24:26,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:24:26,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:24:26,514 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:24:26,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6469ab52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26, skipping insertion in model container [2020-06-22 10:24:26,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:24:26,543 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:24:26,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:24:26,772 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:24:26,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:24:26,808 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:24:26,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26 WrapperNode [2020-06-22 10:24:26,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:24:26,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:24:26,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:24:26,810 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:24:26,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:24:26,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:24:26,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:24:26,852 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:24:26,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... [2020-06-22 10:24:26,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:24:26,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:24:26,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:24:26,879 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:24:26,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:24:26,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:24:26,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:24:26,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:24:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:24:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:24:26,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:24:27,230 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:24:27,230 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:24:27,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:24:27 BoogieIcfgContainer [2020-06-22 10:24:27,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:24:27,232 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:24:27,233 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:24:27,235 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:24:27,236 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:24:27" (1/1) ... [2020-06-22 10:24:27,257 INFO L313 BlockEncoder]: Initial Icfg 40 locations, 46 edges [2020-06-22 10:24:27,258 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:24:27,259 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:24:27,259 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:24:27,260 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:24:27,261 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:24:27,262 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:24:27,262 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:24:27,288 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:24:27,318 INFO L200 BlockEncoder]: SBE split 19 edges [2020-06-22 10:24:27,323 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:24:27,325 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:24:27,356 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 10:24:27,359 INFO L70 RemoveSinkStates]: Removed 6 edges and 3 locations by removing sink states [2020-06-22 10:24:27,360 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:24:27,361 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:24:27,361 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:24:27,362 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:24:27,362 INFO L313 BlockEncoder]: Encoded RCFG 30 locations, 53 edges [2020-06-22 10:24:27,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:24:27 BasicIcfg [2020-06-22 10:24:27,363 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:24:27,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:24:27,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:24:27,367 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:24:27,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:24:26" (1/4) ... [2020-06-22 10:24:27,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b180f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:24:27, skipping insertion in model container [2020-06-22 10:24:27,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (2/4) ... [2020-06-22 10:24:27,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b180f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:24:27, skipping insertion in model container [2020-06-22 10:24:27,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:24:27" (3/4) ... [2020-06-22 10:24:27,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b180f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:24:27, skipping insertion in model container [2020-06-22 10:24:27,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:24:27" (4/4) ... [2020-06-22 10:24:27,371 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:24:27,381 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:24:27,389 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-06-22 10:24:27,406 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-06-22 10:24:27,434 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:24:27,435 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:24:27,435 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:24:27,435 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:24:27,435 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:24:27,435 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:24:27,436 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:24:27,436 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:24:27,436 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:24:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-06-22 10:24:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:24:27,457 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:27,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:24:27,458 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:27,463 INFO L82 PathProgramCache]: Analyzing trace with hash 200436536, now seen corresponding path program 1 times [2020-06-22 10:24:27,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:27,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:27,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:27,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:27,642 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 10:24:27,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:27,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:27,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:27,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:27,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:27,666 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-06-22 10:24:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:27,810 INFO L93 Difference]: Finished difference Result 30 states and 53 transitions. [2020-06-22 10:24:27,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:27,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:24:27,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:27,825 INFO L225 Difference]: With dead ends: 30 [2020-06-22 10:24:27,826 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 10:24:27,829 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 10:24:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 10:24:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 10:24:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:24:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 51 transitions. [2020-06-22 10:24:27,868 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 51 transitions. Word has length 5 [2020-06-22 10:24:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:27,869 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 51 transitions. [2020-06-22 10:24:27,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 51 transitions. [2020-06-22 10:24:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:24:27,870 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:27,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:24:27,870 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:27,871 INFO L82 PathProgramCache]: Analyzing trace with hash 200436538, now seen corresponding path program 1 times [2020-06-22 10:24:27,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:27,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:27,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:27,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:27,926 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 10:24:27,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:27,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:27,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:27,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:27,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:27,929 INFO L87 Difference]: Start difference. First operand 29 states and 51 transitions. Second operand 3 states. [2020-06-22 10:24:28,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,007 INFO L93 Difference]: Finished difference Result 30 states and 51 transitions. [2020-06-22 10:24:28,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:28,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 10:24:28,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,009 INFO L225 Difference]: With dead ends: 30 [2020-06-22 10:24:28,009 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 10:24:28,010 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 10:24:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 10:24:28,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 10:24:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:24:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 50 transitions. [2020-06-22 10:24:28,015 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 50 transitions. Word has length 5 [2020-06-22 10:24:28,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,015 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 50 transitions. [2020-06-22 10:24:28,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:28,016 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 50 transitions. [2020-06-22 10:24:28,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 10:24:28,016 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 10:24:28,016 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,017 INFO L82 PathProgramCache]: Analyzing trace with hash 200436539, now seen corresponding path program 1 times [2020-06-22 10:24:28,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,049 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 10:24:28,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:28,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:28,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:24:28,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:28,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:28,051 INFO L87 Difference]: Start difference. First operand 29 states and 50 transitions. Second operand 4 states. [2020-06-22 10:24:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,141 INFO L93 Difference]: Finished difference Result 29 states and 50 transitions. [2020-06-22 10:24:28,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:24:28,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 10:24:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,144 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:24:28,144 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 10:24:28,144 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 10:24:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 10:24:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 10:24:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:24:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 49 transitions. [2020-06-22 10:24:28,148 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 49 transitions. Word has length 5 [2020-06-22 10:24:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,149 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 49 transitions. [2020-06-22 10:24:28,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:24:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 49 transitions. [2020-06-22 10:24:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:24:28,149 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:24:28,150 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1918564540, now seen corresponding path program 1 times [2020-06-22 10:24:28,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,177 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 10:24:28,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:28,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:28,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:28,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:28,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,179 INFO L87 Difference]: Start difference. First operand 28 states and 49 transitions. Second operand 3 states. [2020-06-22 10:24:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,240 INFO L93 Difference]: Finished difference Result 28 states and 49 transitions. [2020-06-22 10:24:28,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:28,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:24:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,241 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:24:28,241 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 10:24:28,242 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 10:24:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 10:24:28,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 10:24:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:24:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2020-06-22 10:24:28,246 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 6 [2020-06-22 10:24:28,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,246 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. [2020-06-22 10:24:28,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. [2020-06-22 10:24:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:24:28,247 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:24:28,247 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1918564542, now seen corresponding path program 1 times [2020-06-22 10:24:28,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,288 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 10:24:28,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:28,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:24:28,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:24:28,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:24:28,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:24:28,290 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand 3 states. [2020-06-22 10:24:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,373 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. [2020-06-22 10:24:28,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:24:28,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 10:24:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,374 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:24:28,374 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 10:24:28,375 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 10:24:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 10:24:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 10:24:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:24:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2020-06-22 10:24:28,379 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 6 [2020-06-22 10:24:28,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,379 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2020-06-22 10:24:28,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:24:28,380 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2020-06-22 10:24:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 10:24:28,380 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 10:24:28,380 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1918564543, now seen corresponding path program 1 times [2020-06-22 10:24:28,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,414 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 10:24:28,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:28,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:28,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:24:28,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:28,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:28,416 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand 4 states. [2020-06-22 10:24:28,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,480 INFO L93 Difference]: Finished difference Result 27 states and 46 transitions. [2020-06-22 10:24:28,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:24:28,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 10:24:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,481 INFO L225 Difference]: With dead ends: 27 [2020-06-22 10:24:28,482 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 10:24:28,482 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 10:24:28,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 10:24:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 10:24:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:24:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2020-06-22 10:24:28,486 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 6 [2020-06-22 10:24:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,486 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2020-06-22 10:24:28,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:24:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2020-06-22 10:24:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:24:28,487 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:28,487 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1199589599, now seen corresponding path program 1 times [2020-06-22 10:24:28,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,525 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 10:24:28,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:28,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:28,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:24:28,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:28,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:28,527 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 4 states. [2020-06-22 10:24:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,612 INFO L93 Difference]: Finished difference Result 26 states and 45 transitions. [2020-06-22 10:24:28,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:24:28,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-06-22 10:24:28,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,613 INFO L225 Difference]: With dead ends: 26 [2020-06-22 10:24:28,613 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 10:24:28,614 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 10:24:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 10:24:28,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 10:24:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:24:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. [2020-06-22 10:24:28,619 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 41 transitions. Word has length 8 [2020-06-22 10:24:28,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,619 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 41 transitions. [2020-06-22 10:24:28,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:24:28,620 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2020-06-22 10:24:28,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:24:28,620 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:28,620 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1199589601, now seen corresponding path program 1 times [2020-06-22 10:24:28,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,664 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 10:24:28,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:28,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:28,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:24:28,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:28,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:28,665 INFO L87 Difference]: Start difference. First operand 24 states and 41 transitions. Second operand 4 states. [2020-06-22 10:24:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,771 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2020-06-22 10:24:28,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:24:28,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-06-22 10:24:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,773 INFO L225 Difference]: With dead ends: 37 [2020-06-22 10:24:28,773 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 10:24:28,773 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 10:24:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 10:24:28,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2020-06-22 10:24:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:24:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 53 transitions. [2020-06-22 10:24:28,779 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 53 transitions. Word has length 8 [2020-06-22 10:24:28,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,779 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 53 transitions. [2020-06-22 10:24:28,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:24:28,779 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 53 transitions. [2020-06-22 10:24:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 10:24:28,780 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:28,780 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1199589602, now seen corresponding path program 1 times [2020-06-22 10:24:28,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:28,851 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 10:24:28,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:28,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:24:28,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:24:28,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:24:28,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:24:28,853 INFO L87 Difference]: Start difference. First operand 28 states and 53 transitions. Second operand 6 states. [2020-06-22 10:24:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:28,979 INFO L93 Difference]: Finished difference Result 35 states and 57 transitions. [2020-06-22 10:24:28,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:24:28,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-06-22 10:24:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:28,981 INFO L225 Difference]: With dead ends: 35 [2020-06-22 10:24:28,981 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 10:24:28,981 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 10:24:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 10:24:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2020-06-22 10:24:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:24:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. [2020-06-22 10:24:28,986 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 8 [2020-06-22 10:24:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:28,986 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 51 transitions. [2020-06-22 10:24:28,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:24:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. [2020-06-22 10:24:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 10:24:28,987 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:28,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:28,987 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:28,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1467427036, now seen corresponding path program 1 times [2020-06-22 10:24:28,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:28,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:28,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:28,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:29,020 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 10:24:29,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:29,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:29,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:24:29,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:29,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:29,022 INFO L87 Difference]: Start difference. First operand 28 states and 51 transitions. Second operand 4 states. [2020-06-22 10:24:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:29,095 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2020-06-22 10:24:29,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:24:29,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-06-22 10:24:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:29,097 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:24:29,097 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 10:24:29,097 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 10:24:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 10:24:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 10:24:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:24:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 47 transitions. [2020-06-22 10:24:29,101 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 47 transitions. Word has length 9 [2020-06-22 10:24:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:29,101 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 47 transitions. [2020-06-22 10:24:29,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:24:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 47 transitions. [2020-06-22 10:24:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 10:24:29,102 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:29,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,102 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1467427034, now seen corresponding path program 1 times [2020-06-22 10:24:29,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:29,166 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 10:24:29,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:29,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:24:29,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:24:29,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:24:29,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:24:29,168 INFO L87 Difference]: Start difference. First operand 27 states and 47 transitions. Second operand 6 states. [2020-06-22 10:24:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:29,311 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. [2020-06-22 10:24:29,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:24:29,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-06-22 10:24:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:29,334 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:24:29,334 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 10:24:29,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:24:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 10:24:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 10:24:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:24:29,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. [2020-06-22 10:24:29,338 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 9 [2020-06-22 10:24:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:29,339 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 45 transitions. [2020-06-22 10:24:29,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:24:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 45 transitions. [2020-06-22 10:24:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:24:29,339 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:29,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,340 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1448187237, now seen corresponding path program 1 times [2020-06-22 10:24:29,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:29,369 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 10:24:29,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:29,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:29,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:24:29,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:29,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:29,371 INFO L87 Difference]: Start difference. First operand 27 states and 45 transitions. Second operand 4 states. [2020-06-22 10:24:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:29,439 INFO L93 Difference]: Finished difference Result 27 states and 45 transitions. [2020-06-22 10:24:29,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:24:29,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-06-22 10:24:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:29,440 INFO L225 Difference]: With dead ends: 27 [2020-06-22 10:24:29,440 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 10:24:29,440 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 10:24:29,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 10:24:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 10:24:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:24:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. [2020-06-22 10:24:29,444 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 43 transitions. Word has length 11 [2020-06-22 10:24:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:29,444 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 43 transitions. [2020-06-22 10:24:29,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:24:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 43 transitions. [2020-06-22 10:24:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:24:29,445 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:29,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,445 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:29,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1448187235, now seen corresponding path program 1 times [2020-06-22 10:24:29,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:29,490 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 10:24:29,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:29,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:29,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:24:29,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:29,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:29,492 INFO L87 Difference]: Start difference. First operand 26 states and 43 transitions. Second operand 4 states. [2020-06-22 10:24:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:29,556 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. [2020-06-22 10:24:29,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:24:29,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-06-22 10:24:29,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:29,557 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:24:29,557 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 10:24:29,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:29,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 10:24:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 10:24:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:24:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 41 transitions. [2020-06-22 10:24:29,560 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 41 transitions. Word has length 11 [2020-06-22 10:24:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:29,561 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 41 transitions. [2020-06-22 10:24:29,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:24:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. [2020-06-22 10:24:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 10:24:29,561 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:29,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,562 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:29,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1448187234, now seen corresponding path program 1 times [2020-06-22 10:24:29,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:29,605 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 10:24:29,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:29,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:24:29,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:24:29,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:24:29,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:24:29,606 INFO L87 Difference]: Start difference. First operand 26 states and 41 transitions. Second operand 5 states. [2020-06-22 10:24:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:29,704 INFO L93 Difference]: Finished difference Result 31 states and 47 transitions. [2020-06-22 10:24:29,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:24:29,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-06-22 10:24:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:29,705 INFO L225 Difference]: With dead ends: 31 [2020-06-22 10:24:29,705 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 10:24:29,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:24:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 10:24:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-06-22 10:24:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 10:24:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2020-06-22 10:24:29,709 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 11 [2020-06-22 10:24:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:29,709 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 42 transitions. [2020-06-22 10:24:29,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:24:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. [2020-06-22 10:24:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 10:24:29,710 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:29,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,710 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:29,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1944059446, now seen corresponding path program 1 times [2020-06-22 10:24:29,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:29,740 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 10:24:29,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:29,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:29,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:24:29,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:29,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:29,741 INFO L87 Difference]: Start difference. First operand 27 states and 42 transitions. Second operand 4 states. [2020-06-22 10:24:29,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:29,807 INFO L93 Difference]: Finished difference Result 27 states and 42 transitions. [2020-06-22 10:24:29,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:24:29,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-06-22 10:24:29,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:29,808 INFO L225 Difference]: With dead ends: 27 [2020-06-22 10:24:29,808 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 10:24:29,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 10:24:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 10:24:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 10:24:29,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:24:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2020-06-22 10:24:29,812 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 40 transitions. Word has length 12 [2020-06-22 10:24:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:29,812 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 40 transitions. [2020-06-22 10:24:29,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:24:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 40 transitions. [2020-06-22 10:24:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 10:24:29,813 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:29,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:29,813 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:29,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:29,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1944059444, now seen corresponding path program 1 times [2020-06-22 10:24:29,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:29,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:29,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:29,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:29,881 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 10:24:29,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:29,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 10:24:29,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 10:24:29,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 10:24:29,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:24:29,882 INFO L87 Difference]: Start difference. First operand 26 states and 40 transitions. Second operand 7 states. [2020-06-22 10:24:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:30,003 INFO L93 Difference]: Finished difference Result 27 states and 40 transitions. [2020-06-22 10:24:30,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:24:30,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-06-22 10:24:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:30,004 INFO L225 Difference]: With dead ends: 27 [2020-06-22 10:24:30,004 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 10:24:30,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-06-22 10:24:30,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 10:24:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 10:24:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:24:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2020-06-22 10:24:30,008 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 39 transitions. Word has length 12 [2020-06-22 10:24:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:30,008 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 39 transitions. [2020-06-22 10:24:30,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 10:24:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 39 transitions. [2020-06-22 10:24:30,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 10:24:30,009 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:30,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:30,009 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:30,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:30,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1944059443, now seen corresponding path program 1 times [2020-06-22 10:24:30,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:30,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:30,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:30,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:30,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:30,081 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 10:24:30,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:30,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 10:24:30,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 10:24:30,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 10:24:30,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:24:30,082 INFO L87 Difference]: Start difference. First operand 26 states and 39 transitions. Second operand 8 states. [2020-06-22 10:24:30,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:30,259 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2020-06-22 10:24:30,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 10:24:30,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-06-22 10:24:30,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:30,260 INFO L225 Difference]: With dead ends: 33 [2020-06-22 10:24:30,260 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 10:24:30,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-06-22 10:24:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 10:24:30,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-06-22 10:24:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 10:24:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2020-06-22 10:24:30,264 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 12 [2020-06-22 10:24:30,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:30,264 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2020-06-22 10:24:30,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 10:24:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2020-06-22 10:24:30,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 10:24:30,265 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:30,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:30,265 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash -55512069, now seen corresponding path program 1 times [2020-06-22 10:24:30,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:30,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:30,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:30,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:30,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:30,292 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 10:24:30,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:30,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:30,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:24:30,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:30,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:30,293 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand 4 states. [2020-06-22 10:24:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:30,365 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-06-22 10:24:30,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:24:30,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-06-22 10:24:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:30,366 INFO L225 Difference]: With dead ends: 26 [2020-06-22 10:24:30,367 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 10:24:30,367 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 10:24:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 10:24:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-06-22 10:24:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:24:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2020-06-22 10:24:30,370 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2020-06-22 10:24:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:30,370 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2020-06-22 10:24:30,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:24:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2020-06-22 10:24:30,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 10:24:30,371 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:30,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:30,371 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:30,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:30,371 INFO L82 PathProgramCache]: Analyzing trace with hash -55512068, now seen corresponding path program 1 times [2020-06-22 10:24:30,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:30,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:30,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:30,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:30,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:30,574 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 10:24:30,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:24:30,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:24:30,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:30,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 10:24:30,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:30,681 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:24:30,682 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:30,692 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:30,693 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:24:30,693 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-06-22 10:24:30,721 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 10:24:30,721 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:30,730 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:30,731 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 10:24:30,732 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2020-06-22 10:24:30,779 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 10:24:30,780 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:30,798 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:30,799 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 10:24:30,800 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:42, output treesize:38 [2020-06-22 10:24:30,900 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:30,901 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2020-06-22 10:24:30,904 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:24:30,919 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:30,924 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:24:30,925 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:50, output treesize:23 [2020-06-22 10:24:30,971 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 10:24:30,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:24:30,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-06-22 10:24:30,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-06-22 10:24:30,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-06-22 10:24:31,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-06-22 10:24:31,000 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 14 states. [2020-06-22 10:24:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:31,626 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2020-06-22 10:24:31,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 10:24:31,627 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-06-22 10:24:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:31,627 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:24:31,627 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 10:24:31,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2020-06-22 10:24:31,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 10:24:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 10:24:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:24:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2020-06-22 10:24:31,632 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2020-06-22 10:24:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:31,632 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2020-06-22 10:24:31,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-06-22 10:24:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2020-06-22 10:24:31,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-06-22 10:24:31,633 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:31,633 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:31,633 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:31,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1720873140, now seen corresponding path program 1 times [2020-06-22 10:24:31,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:31,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:31,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:31,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:31,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:31,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:24:31,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:24:31,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:31,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 36 conjunts are in the unsatisfiable core [2020-06-22 10:24:31,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:31,955 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 10:24:31,955 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:31,965 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:31,966 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 10:24:31,966 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 10:24:32,156 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:32,157 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 48 [2020-06-22 10:24:32,167 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:24:32,220 INFO L497 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2020-06-22 10:24:32,226 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 10:24:32,227 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:23 [2020-06-22 10:24:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:32,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:24:32,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-06-22 10:24:32,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-06-22 10:24:32,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-06-22 10:24:32,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-06-22 10:24:32,300 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 16 states. [2020-06-22 10:24:32,854 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2020-06-22 10:24:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:33,264 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2020-06-22 10:24:33,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-06-22 10:24:33,264 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2020-06-22 10:24:33,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:33,265 INFO L225 Difference]: With dead ends: 31 [2020-06-22 10:24:33,265 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 10:24:33,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2020-06-22 10:24:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 10:24:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-06-22 10:24:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:24:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2020-06-22 10:24:33,271 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 16 [2020-06-22 10:24:33,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:33,271 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-06-22 10:24:33,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-06-22 10:24:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2020-06-22 10:24:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-06-22 10:24:33,272 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:33,272 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:33,272 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:33,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1720873139, now seen corresponding path program 1 times [2020-06-22 10:24:33,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:33,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:33,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:33,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:33,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:33,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:24:33,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:24:33,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:33,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:24:33,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:33,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:24:33,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 10:24:33,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 10:24:33,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 10:24:33,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:24:33,403 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 8 states. [2020-06-22 10:24:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:33,515 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2020-06-22 10:24:33,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:24:33,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-06-22 10:24:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:33,516 INFO L225 Difference]: With dead ends: 30 [2020-06-22 10:24:33,516 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 10:24:33,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-06-22 10:24:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 10:24:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 10:24:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 10:24:33,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-06-22 10:24:33,520 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 16 [2020-06-22 10:24:33,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:33,521 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-06-22 10:24:33,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 10:24:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-06-22 10:24:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 10:24:33,522 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:33,522 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:33,522 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:33,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:33,522 INFO L82 PathProgramCache]: Analyzing trace with hash -196759228, now seen corresponding path program 1 times [2020-06-22 10:24:33,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:33,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:33,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:33,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:33,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:24:33,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:33,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:33,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:24:33,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:33,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:33,550 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2020-06-22 10:24:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:33,607 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2020-06-22 10:24:33,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:24:33,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-06-22 10:24:33,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:33,610 INFO L225 Difference]: With dead ends: 29 [2020-06-22 10:24:33,610 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 10:24:33,610 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 10:24:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 10:24:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 10:24:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 10:24:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2020-06-22 10:24:33,614 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 18 [2020-06-22 10:24:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:33,614 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2020-06-22 10:24:33,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:24:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2020-06-22 10:24:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-06-22 10:24:33,615 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:33,615 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:33,615 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:33,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:33,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1804496921, now seen corresponding path program 1 times [2020-06-22 10:24:33,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:33,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:33,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:33,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:33,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:24:33,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:33,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:24:33,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:24:33,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:24:33,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:24:33,663 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 6 states. [2020-06-22 10:24:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:33,767 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2020-06-22 10:24:33,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:24:33,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-06-22 10:24:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:33,768 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:24:33,768 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 10:24:33,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-06-22 10:24:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 10:24:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 10:24:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 10:24:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-06-22 10:24:33,772 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 19 [2020-06-22 10:24:33,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:33,772 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-06-22 10:24:33,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:24:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-06-22 10:24:33,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-06-22 10:24:33,773 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:33,773 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:33,773 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:33,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:33,774 INFO L82 PathProgramCache]: Analyzing trace with hash 123238306, now seen corresponding path program 2 times [2020-06-22 10:24:33,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:33,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:33,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:33,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:33,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:34,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:24:34,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:24:34,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:24:34,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 10:24:34,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 10:24:34,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 33 conjunts are in the unsatisfiable core [2020-06-22 10:24:34,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:34,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 10:24:34,102 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 10:24:34,102 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:34,114 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:34,121 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 10:24:34,121 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:34,131 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:34,132 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:24:34,132 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-06-22 10:24:34,170 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 10:24:34,170 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:34,192 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:34,192 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 10:24:34,193 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2020-06-22 10:24:34,230 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 10:24:34,230 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:34,240 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:34,241 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 10:24:34,241 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-06-22 10:24:34,390 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:34,391 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 10:24:34,392 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 10:24:34,445 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:34,448 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 10:24:34,448 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2020-06-22 10:24:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:24:34,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:24:34,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2020-06-22 10:24:34,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 10:24:34,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 10:24:34,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-06-22 10:24:34,523 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 17 states. [2020-06-22 10:24:34,969 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2020-06-22 10:24:35,115 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2020-06-22 10:24:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:35,834 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2020-06-22 10:24:35,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-06-22 10:24:35,834 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2020-06-22 10:24:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:35,835 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:24:35,835 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 10:24:35,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2020-06-22 10:24:35,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 10:24:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2020-06-22 10:24:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-06-22 10:24:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2020-06-22 10:24:35,839 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 22 [2020-06-22 10:24:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:35,840 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2020-06-22 10:24:35,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 10:24:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2020-06-22 10:24:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-06-22 10:24:35,840 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:35,840 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:35,841 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:35,841 INFO L82 PathProgramCache]: Analyzing trace with hash -474578842, now seen corresponding path program 2 times [2020-06-22 10:24:35,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:35,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:35,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:35,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:24:35,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:36,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:24:36,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:24:36,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:24:36,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 10:24:36,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 10:24:36,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 46 conjunts are in the unsatisfiable core [2020-06-22 10:24:36,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:36,313 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:36,313 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 10:24:36,313 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:36,332 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 10:24:36,333 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:24:36,333 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-06-22 10:24:36,366 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 10:24:36,366 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:36,373 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:36,374 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 10:24:36,374 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-06-22 10:24:36,602 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:36,603 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 52 [2020-06-22 10:24:36,611 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-06-22 10:24:36,655 INFO L497 ElimStorePlain]: treesize reduction 61, result has 43.0 percent of original size [2020-06-22 10:24:36,659 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 10:24:36,660 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:23 [2020-06-22 10:24:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 10:24:36,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:24:36,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2020-06-22 10:24:36,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-06-22 10:24:36,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-06-22 10:24:36,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2020-06-22 10:24:36,728 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 20 states. [2020-06-22 10:24:38,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:38,310 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2020-06-22 10:24:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-06-22 10:24:38,310 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2020-06-22 10:24:38,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:38,311 INFO L225 Difference]: With dead ends: 36 [2020-06-22 10:24:38,311 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 10:24:38,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=254, Invalid=1228, Unknown=0, NotChecked=0, Total=1482 [2020-06-22 10:24:38,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 10:24:38,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2020-06-22 10:24:38,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:24:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2020-06-22 10:24:38,317 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 23 [2020-06-22 10:24:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:38,318 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2020-06-22 10:24:38,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-06-22 10:24:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2020-06-22 10:24:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-06-22 10:24:38,318 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:24:38,319 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:38,319 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:24:38,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:38,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2137451123, now seen corresponding path program 1 times [2020-06-22 10:24:38,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:38,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:38,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:38,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:24:38,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:38,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:24:38,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:24:38,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:38,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 59 conjunts are in the unsatisfiable core [2020-06-22 10:24:38,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:38,758 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:38,758 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 10:24:38,758 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:38,773 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 10:24:38,773 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:24:38,774 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-06-22 10:24:38,803 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 10:24:38,804 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:24:38,806 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:38,806 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:24:38,806 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 10:24:38,941 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:24:38,942 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2020-06-22 10:24:38,950 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-06-22 10:24:38,988 INFO L497 ElimStorePlain]: treesize reduction 58, result has 39.6 percent of original size [2020-06-22 10:24:38,990 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-06-22 10:24:38,990 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:35 [2020-06-22 10:24:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-06-22 10:24:39,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:24:39,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2020-06-22 10:24:39,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-06-22 10:24:39,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-06-22 10:24:39,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2020-06-22 10:24:39,070 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 20 states. [2020-06-22 10:24:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:39,870 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2020-06-22 10:24:39,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-06-22 10:24:39,870 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2020-06-22 10:24:39,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:24:39,871 INFO L225 Difference]: With dead ends: 31 [2020-06-22 10:24:39,871 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:24:39,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2020-06-22 10:24:39,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:24:39,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:24:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:24:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:24:39,872 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2020-06-22 10:24:39,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:24:39,873 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:24:39,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-06-22 10:24:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:24:39,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:24:39,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:24:39,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:24:39,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:24:39,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 10:24:45,384 WARN L188 SmtUtils]: Spent 5.46 s on a formula simplification. DAG size of input: 114 DAG size of output: 86 [2020-06-22 10:24:45,387 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 29) no Hoare annotation was computed. [2020-06-22 10:24:45,401 INFO L448 ceAbstractionStarter]: For program point L27-2(lines 24 38) no Hoare annotation was computed. [2020-06-22 10:24:45,401 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. [2020-06-22 10:24:45,402 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2020-06-22 10:24:45,402 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:24:45,402 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. [2020-06-22 10:24:45,402 INFO L448 ceAbstractionStarter]: For program point L17-2(line 17) no Hoare annotation was computed. [2020-06-22 10:24:45,402 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. [2020-06-22 10:24:45,402 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 20) no Hoare annotation was computed. [2020-06-22 10:24:45,402 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2020-06-22 10:24:45,402 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 20) no Hoare annotation was computed. [2020-06-22 10:24:45,402 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 35) no Hoare annotation was computed. [2020-06-22 10:24:45,403 INFO L444 ceAbstractionStarter]: At program point L15-4(lines 15 20) the Hoare annotation is: (let ((.cse0 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse1 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse3 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse5 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s2.base) (+ (select |#length| ULTIMATE.start_cstrncmp_~s2.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString2~0.offset)))) (.cse6 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse7 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncmp_~s1.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrncmp_~s1.base) (- 1))))))) (.cse8 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_main_~nondetString1~0.base) (- 1))))))) (.cse9 (= ULTIMATE.start_main_~length1~0 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (.cse10 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse11 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s2.base))) (.cse12 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrncmp_~s1.base)) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1))))))) (.cse2 (select |#length| ULTIMATE.start_cstrncmp_~s1.base)) (.cse4 (select |#valid| ULTIMATE.start_cstrncmp_~s1.base)) (.cse13 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse14 (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) (select |#length| ULTIMATE.start_cstrncmp_~s2.base))) (.cse15 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse16 (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length1~0) (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0) (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1))) 0))))) (or (and .cse0 .cse1 (<= 1 .cse2) .cse3 (= 1 .cse4) .cse5 .cse6 .cse7 (= 0 ULTIMATE.start_cstrncmp_~s2.offset) .cse8 .cse9 .cse10 .cse11 .cse12 (= 0 ULTIMATE.start_cstrncmp_~s1.offset) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 (<= 1 ULTIMATE.start_cstrncmp_~s2.offset) .cse3 (<= 1 ULTIMATE.start_cstrncmp_~s1.offset) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ ULTIMATE.start_cstrncmp_~s1.offset 1) .cse2) (= .cse4 1) .cse13 .cse14 .cse15 .cse16))) [2020-06-22 10:24:45,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:24:45,403 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 32) no Hoare annotation was computed. [2020-06-22 10:24:45,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:24:45,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:24:45,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:24:45,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:24:45,404 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:24:45,404 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:24:45,404 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:24:45,404 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:24:45,404 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 10:24:45,404 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 10:24:45,404 INFO L448 ceAbstractionStarter]: For program point L18-1(lines 18 19) no Hoare annotation was computed. [2020-06-22 10:24:45,404 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 10:24:45,404 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 16 17) no Hoare annotation was computed. [2020-06-22 10:24:45,405 INFO L448 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2020-06-22 10:24:45,405 INFO L448 ceAbstractionStarter]: For program point L35-1(line 35) no Hoare annotation was computed. [2020-06-22 10:24:45,405 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:24:45,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,415 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:45,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:45,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:45,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:45,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:45,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:45,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:45,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:45,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:45,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:45,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:45,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:45,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:45,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:45,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:45,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:45,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:45,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:45,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:45,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:45,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:45,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:45,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:45,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:45,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:45,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:45,453 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,454 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,454 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,454 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,454 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,455 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,455 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,455 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,455 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,456 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,456 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,456 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,456 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,459 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:45,460 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:45,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:24:45 BasicIcfg [2020-06-22 10:24:45,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:24:45,464 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:24:45,464 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:24:45,467 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:24:45,468 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:45,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:24:26" (1/5) ... [2020-06-22 10:24:45,468 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19252b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:24:45, skipping insertion in model container [2020-06-22 10:24:45,469 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:45,469 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:24:26" (2/5) ... [2020-06-22 10:24:45,469 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19252b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:24:45, skipping insertion in model container [2020-06-22 10:24:45,469 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:45,469 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:24:27" (3/5) ... [2020-06-22 10:24:45,469 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19252b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:24:45, skipping insertion in model container [2020-06-22 10:24:45,469 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:45,470 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:24:27" (4/5) ... [2020-06-22 10:24:45,470 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19252b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:24:45, skipping insertion in model container [2020-06-22 10:24:45,470 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:24:45,470 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:24:45" (5/5) ... [2020-06-22 10:24:45,471 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:24:45,493 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:24:45,493 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:24:45,493 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:24:45,493 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:24:45,493 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:24:45,494 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:24:45,494 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:24:45,494 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:24:45,494 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:24:45,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-06-22 10:24:45,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:24:45,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:45,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:45,507 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:45,507 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:45,507 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:24:45,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-06-22 10:24:45,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:24:45,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:45,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:45,509 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:45,509 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:45,515 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue [182] ULTIMATE.startENTRY-->L27: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 4#L27true [79] L27-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 13#L27-2true [91] L27-2-->L30-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 21#L30-1true [143] L30-1-->L35: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 31#L35true [116] L35-->L35-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 28#L35-1true [183] L35-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrncmp_~n_7 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~s2.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_11 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrncmp_~s1.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_main_#t~nondet13_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|))) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_8|, ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_7|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_7|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_7|, ULTIMATE.start_cstrncmp_#t~mem5=|v_ULTIMATE.start_cstrncmp_#t~mem5_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_11, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_8|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~pre4.offset=|v_ULTIMATE.start_cstrncmp_#t~pre4.offset_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_9, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_7|, ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_7|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_7, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~pre4.base=|v_ULTIMATE.start_cstrncmp_#t~pre4.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~mem5, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, ULTIMATE.start_cstrncmp_#t~pre4.offset, #memory_int, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~pre4.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 29#L13true [155] L13-->L15-4: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 26#L15-4true [2020-06-22 10:24:45,515 INFO L796 eck$LassoCheckResult]: Loop: 26#L15-4true [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 3#L16-1true [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 12#L16-2true [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 6#L18true [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 5#L18-1true [174] L18-1-->L15-1: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 32#L15-1true [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 30#L15-2true [180] L15-2-->L15-4: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 26#L15-4true [2020-06-22 10:24:45,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:45,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1885123510, now seen corresponding path program 1 times [2020-06-22 10:24:45,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:45,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:45,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:45,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:45,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:45,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:45,548 INFO L82 PathProgramCache]: Analyzing trace with hash 660213727, now seen corresponding path program 1 times [2020-06-22 10:24:45,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:45,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:45,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:45,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:45,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:45,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1025568906, now seen corresponding path program 1 times [2020-06-22 10:24:45,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:45,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:45,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:45,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:45,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:45,581 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 10:24:45,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:45,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:24:45,727 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2020-06-22 10:24:45,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:24:45,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:24:45,766 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2020-06-22 10:24:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:45,931 INFO L93 Difference]: Finished difference Result 49 states and 84 transitions. [2020-06-22 10:24:45,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:24:45,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 84 transitions. [2020-06-22 10:24:45,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:24:45,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 21 states and 30 transitions. [2020-06-22 10:24:45,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:24:45,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 10:24:45,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2020-06-22 10:24:45,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:24:45,939 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-06-22 10:24:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2020-06-22 10:24:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:24:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:24:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2020-06-22 10:24:45,941 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-06-22 10:24:45,941 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-06-22 10:24:45,941 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:24:45,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2020-06-22 10:24:45,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:24:45,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:45,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:45,943 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:45,943 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:45,944 INFO L794 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY [182] ULTIMATE.startENTRY-->L27: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 93#L27 [79] L27-->L27-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 94#L27-2 [91] L27-2-->L30-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 98#L30-1 [143] L30-1-->L35: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 99#L35 [116] L35-->L35-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 102#L35-1 [183] L35-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrncmp_~n_7 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~s2.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_11 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrncmp_~s1.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_main_#t~nondet13_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|))) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_8|, ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_7|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_7|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_7|, ULTIMATE.start_cstrncmp_#t~mem5=|v_ULTIMATE.start_cstrncmp_#t~mem5_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_11, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_8|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~pre4.offset=|v_ULTIMATE.start_cstrncmp_#t~pre4.offset_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_9, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_7|, ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_7|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_7, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~pre4.base=|v_ULTIMATE.start_cstrncmp_#t~pre4.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~mem5, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, ULTIMATE.start_cstrncmp_#t~pre4.offset, #memory_int, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~pre4.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 103#L13 [154] L13-->L15-4: Formula: (< v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 101#L15-4 [2020-06-22 10:24:45,944 INFO L796 eck$LassoCheckResult]: Loop: 101#L15-4 [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 91#L16-1 [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 92#L16-2 [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 97#L18 [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 95#L18-1 [174] L18-1-->L15-1: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 96#L15-1 [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 106#L15-2 [180] L15-2-->L15-4: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 101#L15-4 [2020-06-22 10:24:45,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:45,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1885123511, now seen corresponding path program 1 times [2020-06-22 10:24:45,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:45,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:45,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:45,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:45,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:45,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:45,960 INFO L82 PathProgramCache]: Analyzing trace with hash 660213727, now seen corresponding path program 2 times [2020-06-22 10:24:45,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:45,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:45,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:45,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:45,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:45,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:45,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1526588055, now seen corresponding path program 1 times [2020-06-22 10:24:45,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:45,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:45,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:45,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:24:45,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:46,120 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 10:24:46,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:46,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 10:24:46,226 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2020-06-22 10:24:46,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 10:24:46,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:24:46,257 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 10 Second operand 8 states. [2020-06-22 10:24:46,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:46,504 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2020-06-22 10:24:46,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 10:24:46,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 48 transitions. [2020-06-22 10:24:46,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:24:46,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 21 states and 29 transitions. [2020-06-22 10:24:46,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:24:46,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 10:24:46,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2020-06-22 10:24:46,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:24:46,508 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-06-22 10:24:46,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2020-06-22 10:24:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:24:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:24:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-06-22 10:24:46,510 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-06-22 10:24:46,510 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-06-22 10:24:46,510 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:24:46,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2020-06-22 10:24:46,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:24:46,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:46,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:46,511 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:46,512 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:46,512 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY [182] ULTIMATE.startENTRY-->L27: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 171#L27 [121] L27-->L27-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 172#L27-2 [91] L27-2-->L30-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 176#L30-1 [143] L30-1-->L35: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 177#L35 [116] L35-->L35-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 180#L35-1 [183] L35-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrncmp_~n_7 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~s2.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_11 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrncmp_~s1.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_main_#t~nondet13_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|))) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_8|, ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_7|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_7|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_7|, ULTIMATE.start_cstrncmp_#t~mem5=|v_ULTIMATE.start_cstrncmp_#t~mem5_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_11, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_8|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~pre4.offset=|v_ULTIMATE.start_cstrncmp_#t~pre4.offset_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_9, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_7|, ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_7|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_7, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~pre4.base=|v_ULTIMATE.start_cstrncmp_#t~pre4.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~mem5, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, ULTIMATE.start_cstrncmp_#t~pre4.offset, #memory_int, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~pre4.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 181#L13 [154] L13-->L15-4: Formula: (< v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 179#L15-4 [2020-06-22 10:24:46,513 INFO L796 eck$LassoCheckResult]: Loop: 179#L15-4 [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 169#L16-1 [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 170#L16-2 [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 175#L18 [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 173#L18-1 [174] L18-1-->L15-1: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 174#L15-1 [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 184#L15-2 [180] L15-2-->L15-4: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 179#L15-4 [2020-06-22 10:24:46,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:46,513 INFO L82 PathProgramCache]: Analyzing trace with hash -682699169, now seen corresponding path program 1 times [2020-06-22 10:24:46,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:46,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:46,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:46,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:46,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:46,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:46,528 INFO L82 PathProgramCache]: Analyzing trace with hash 660213727, now seen corresponding path program 3 times [2020-06-22 10:24:46,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:46,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:46,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:46,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:46,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:46,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2088563649, now seen corresponding path program 1 times [2020-06-22 10:24:46,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:46,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:46,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:24:46,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:46,680 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 10:24:46,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:24:46,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-06-22 10:24:46,836 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2020-06-22 10:24:46,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 10:24:46,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-06-22 10:24:46,870 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 9 Second operand 9 states. [2020-06-22 10:24:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:47,083 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-06-22 10:24:47,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 10:24:47,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 45 transitions. [2020-06-22 10:24:47,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:24:47,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 21 states and 28 transitions. [2020-06-22 10:24:47,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:24:47,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 10:24:47,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2020-06-22 10:24:47,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:24:47,086 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-06-22 10:24:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2020-06-22 10:24:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:24:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:24:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2020-06-22 10:24:47,087 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-06-22 10:24:47,087 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-06-22 10:24:47,088 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:24:47,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-06-22 10:24:47,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:24:47,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:47,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:47,089 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:47,089 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:47,090 INFO L794 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY [182] ULTIMATE.startENTRY-->L27: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 251#L27 [121] L27-->L27-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 252#L27-2 [122] L27-2-->L30-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 256#L30-1 [143] L30-1-->L35: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 257#L35 [116] L35-->L35-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 260#L35-1 [183] L35-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrncmp_~n_7 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~s2.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_11 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrncmp_~s1.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_main_#t~nondet13_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|))) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_8|, ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_7|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_7|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_7|, ULTIMATE.start_cstrncmp_#t~mem5=|v_ULTIMATE.start_cstrncmp_#t~mem5_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_11, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_8|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~pre4.offset=|v_ULTIMATE.start_cstrncmp_#t~pre4.offset_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_9, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_7|, ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_7|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_7, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~pre4.base=|v_ULTIMATE.start_cstrncmp_#t~pre4.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~mem5, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, ULTIMATE.start_cstrncmp_#t~pre4.offset, #memory_int, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~pre4.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 261#L13 [154] L13-->L15-4: Formula: (< v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 259#L15-4 [2020-06-22 10:24:47,090 INFO L796 eck$LassoCheckResult]: Loop: 259#L15-4 [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 249#L16-1 [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 250#L16-2 [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 255#L18 [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 253#L18-1 [174] L18-1-->L15-1: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 254#L15-1 [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 264#L15-2 [180] L15-2-->L15-4: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 259#L15-4 [2020-06-22 10:24:47,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:47,090 INFO L82 PathProgramCache]: Analyzing trace with hash -654070018, now seen corresponding path program 1 times [2020-06-22 10:24:47,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:47,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:47,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:47,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:47,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:47,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:47,103 INFO L82 PathProgramCache]: Analyzing trace with hash 660213727, now seen corresponding path program 4 times [2020-06-22 10:24:47,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:47,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:47,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:47,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:47,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:47,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:47,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1795160642, now seen corresponding path program 1 times [2020-06-22 10:24:47,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:47,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:47,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:47,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:24:47,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:47,266 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2020-06-22 10:24:47,532 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2020-06-22 10:24:47,638 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:24:47,639 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:24:47,640 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:24:47,640 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:24:47,640 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:24:47,640 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:24:47,640 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:24:47,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:24:47,640 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 10:24:47,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:24:47,641 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:24:47,656 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 10:24:47,661 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 10:24:47,663 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 10:24:47,665 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 10:24:47,666 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 10:24:47,668 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 10:24:47,670 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 10:24:47,672 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 10:24:47,917 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2020-06-22 10:24:48,033 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-06-22 10:24:48,034 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 10:24:48,035 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 10:24:48,037 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 10:24:48,039 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 10:24:48,040 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 10:24:48,042 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 10:24:48,043 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 10:24:48,053 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 10:24:48,054 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 10:24:48,056 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 10:24:48,058 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 10:24:48,060 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 10:24:48,062 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 10:24:48,471 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:24:48,477 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:24:48,479 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 10:24:48,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:48,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:48,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:48,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:48,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:48,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:48,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:48,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:48,486 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 10:24:48,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:48,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:48,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:48,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:48,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:48,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:48,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:48,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:48,489 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 10:24:48,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:48,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:48,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:48,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:48,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:48,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:48,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:48,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:48,491 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 10:24:48,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:48,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:48,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:48,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:48,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:48,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:48,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:48,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:48,494 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 10:24:48,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:48,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:48,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:48,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:48,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:48,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:48,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:48,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:48,496 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 10:24:48,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:48,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:48,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:48,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:48,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:48,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:48,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:48,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:48,498 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 10:24:48,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:48,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:48,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:48,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:48,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:48,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:48,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:48,504 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 10:24:48,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:48,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:48,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:48,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:48,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:48,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:48,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:48,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:48,508 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 10:24:48,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:48,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:48,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:48,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:48,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:48,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:48,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:48,522 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 10:24:48,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:48,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:48,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:48,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:48,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:48,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:48,571 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:24:48,606 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 10:24:48,606 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:24:48,609 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:24:48,610 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:24:48,611 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:24:48,611 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrncmp_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrncmp_~s1.offset Supporting invariants [] [2020-06-22 10:24:48,659 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 10:24:48,670 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:48,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:48,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2020-06-22 10:24:48,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:48,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 10:24:48,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:48,829 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 10:24:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:49,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 10:24:49,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:49,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 10:24:49,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:49,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 10:24:49,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:49,333 INFO L98 LoopCannibalizer]: 11 predicates before loop cannibalization 15 predicates after loop cannibalization [2020-06-22 10:24:49,336 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 15 loop predicates [2020-06-22 10:24:49,337 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states and 28 transitions. cyclomatic complexity: 8 Second operand 7 states. [2020-06-22 10:24:49,920 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states and 28 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 39 states and 50 transitions. Complement of second has 17 states. [2020-06-22 10:24:49,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 4 non-accepting loop states 2 accepting loop states [2020-06-22 10:24:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-22 10:24:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2020-06-22 10:24:49,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 35 transitions. Stem has 7 letters. Loop has 7 letters. [2020-06-22 10:24:49,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:49,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 35 transitions. Stem has 14 letters. Loop has 7 letters. [2020-06-22 10:24:49,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:49,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 35 transitions. Stem has 7 letters. Loop has 14 letters. [2020-06-22 10:24:49,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:49,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2020-06-22 10:24:49,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:24:49,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 21 states and 27 transitions. [2020-06-22 10:24:49,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:24:49,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 10:24:49,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2020-06-22 10:24:49,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:24:49,933 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-06-22 10:24:49,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2020-06-22 10:24:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-06-22 10:24:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-06-22 10:24:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2020-06-22 10:24:49,934 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-06-22 10:24:49,935 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-06-22 10:24:49,935 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:24:49,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2020-06-22 10:24:49,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:24:49,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:49,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:49,936 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:49,936 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:49,937 INFO L794 eck$LassoCheckResult]: Stem: 559#ULTIMATE.startENTRY [182] ULTIMATE.startENTRY-->L27: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 552#L27 [121] L27-->L27-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 553#L27-2 [122] L27-2-->L30-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 557#L30-1 [143] L30-1-->L35: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 558#L35 [116] L35-->L35-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 561#L35-1 [183] L35-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrncmp_~n_7 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~s2.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_11 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrncmp_~s1.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_main_#t~nondet13_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|))) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_8|, ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_7|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_7|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_7|, ULTIMATE.start_cstrncmp_#t~mem5=|v_ULTIMATE.start_cstrncmp_#t~mem5_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_11, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_8|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~pre4.offset=|v_ULTIMATE.start_cstrncmp_#t~pre4.offset_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_9, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_7|, ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_7|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_7, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~pre4.base=|v_ULTIMATE.start_cstrncmp_#t~pre4.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~mem5, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, ULTIMATE.start_cstrncmp_#t~pre4.offset, #memory_int, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~pre4.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 562#L13 [155] L13-->L15-4: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 563#L15-4 [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 570#L16-1 [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 569#L16-2 [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 568#L18 [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 567#L18-1 [175] L18-1-->L15-1: Formula: (> |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 566#L15-1 [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 564#L15-2 [181] L15-2-->L15-4: Formula: (> |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 560#L15-4 [2020-06-22 10:24:49,937 INFO L796 eck$LassoCheckResult]: Loop: 560#L15-4 [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 550#L16-1 [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 551#L16-2 [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 556#L18 [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 554#L18-1 [174] L18-1-->L15-1: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 555#L15-1 [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 565#L15-2 [180] L15-2-->L15-4: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 560#L15-4 [2020-06-22 10:24:49,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:49,938 INFO L82 PathProgramCache]: Analyzing trace with hash -756995357, now seen corresponding path program 1 times [2020-06-22 10:24:49,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:49,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:49,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:49,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:49,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:49,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:49,963 INFO L82 PathProgramCache]: Analyzing trace with hash 660213727, now seen corresponding path program 5 times [2020-06-22 10:24:49,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:49,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:49,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:49,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:49,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:49,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash 729760445, now seen corresponding path program 1 times [2020-06-22 10:24:49,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:49,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:49,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:49,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:24:49,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:50,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:24:50,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:24:50,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:50,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:24:50,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:24:50,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:24:50,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-06-22 10:24:50,226 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2020-06-22 10:24:50,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:24:50,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:24:50,265 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-06-22 10:24:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:24:50,313 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2020-06-22 10:24:50,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:24:50,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2020-06-22 10:24:50,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:24:50,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 26 transitions. [2020-06-22 10:24:50,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-06-22 10:24:50,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-06-22 10:24:50,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2020-06-22 10:24:50,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:24:50,322 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-06-22 10:24:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2020-06-22 10:24:50,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2020-06-22 10:24:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 10:24:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-06-22 10:24:50,323 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-06-22 10:24:50,323 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-06-22 10:24:50,323 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:24:50,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2020-06-22 10:24:50,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 10:24:50,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:24:50,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:24:50,324 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:50,324 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:24:50,325 INFO L794 eck$LassoCheckResult]: Stem: 673#ULTIMATE.startENTRY [182] ULTIMATE.startENTRY-->L27: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_5|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_5|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_#t~malloc12.base, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0] 666#L27 [121] L27-->L27-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 667#L27-2 [122] L27-2-->L30-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 671#L30-1 [143] L30-1-->L35: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc12.offset_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc11.base_4|) 0) (= |v_ULTIMATE.start_main_#t~malloc12.offset_4| 0) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (< 0 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc12.base_4|) (< |v_ULTIMATE.start_main_#t~malloc12.base_4| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc12.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4|)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc12.base_4| 1) |v_#valid_6|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc12.base=|v_ULTIMATE.start_main_#t~malloc12.base_4|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, ULTIMATE.start_main_#t~malloc12.offset=|v_ULTIMATE.start_main_#t~malloc12.offset_4|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc12.offset, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_#t~malloc12.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset] 672#L35 [116] L35-->L35-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 675#L35-1 [183] L35-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrncmp_~n_7 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~s2.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_11 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= v_ULTIMATE.start_cstrncmp_~s1.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_main_#t~nondet13_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|))) InVars {ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_8|, ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_7|, ULTIMATE.start_cstrncmp_#t~mem6=|v_ULTIMATE.start_cstrncmp_#t~mem6_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_7|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_7|, ULTIMATE.start_cstrncmp_#t~mem5=|v_ULTIMATE.start_cstrncmp_#t~mem5_5|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_5|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_11, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_8|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~pre4.offset=|v_ULTIMATE.start_cstrncmp_#t~pre4.offset_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_9, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_7|, ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_7|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_7, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~pre4.base=|v_ULTIMATE.start_cstrncmp_#t~pre4.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem6, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~mem5, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, ULTIMATE.start_cstrncmp_#t~pre4.offset, #memory_int, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~pre4.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 676#L13 [155] L13-->L15-4: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 674#L15-4 [2020-06-22 10:24:50,325 INFO L796 eck$LassoCheckResult]: Loop: 674#L15-4 [185] L15-4-->L16-1: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= |v_ULTIMATE.start_cstrncmp_#t~mem2_8| (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrncmp_~s1.base_12) v_ULTIMATE.start_cstrncmp_~s1.offset_10)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_8 (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_8| 1)) (= v_ULTIMATE.start_cstrncmp_~s2.base_8 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_10) (= 1 (select |v_#valid_28| v_ULTIMATE.start_cstrncmp_~s1.base_12)) (= v_ULTIMATE.start_cstrncmp_~s2.base_9 |v_ULTIMATE.start_cstrncmp_#t~post1.base_9|)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_9|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_8, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_8, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_8|, #valid=|v_#valid_28|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_12, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_10} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset] 664#L16-1 [75] L16-1-->L16-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|)) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_2| (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|)) (= (select |v_#valid_15| |v_ULTIMATE.start_cstrncmp_#t~post1.base_3|) 1)) InVars {ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_3|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_2|, #valid=|v_#valid_15|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_3|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem3] 665#L16-2 [90] L16-2-->L18: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.base_9 |v_ULTIMATE.start_cstrncmp_#t~post7.base_2|) (= |v_ULTIMATE.start_cstrncmp_#t~mem3_6| |v_ULTIMATE.start_cstrncmp_#t~mem2_6|) (= |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_8) (= |v_ULTIMATE.start_cstrncmp_#t~post7.base_2| v_ULTIMATE.start_cstrncmp_~s1.base_10) (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_2| 1))) InVars {ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_#t~post1.base=|v_ULTIMATE.start_cstrncmp_#t~post1.base_7|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_#t~mem3=|v_ULTIMATE.start_cstrncmp_#t~mem3_5|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post1.offset=|v_ULTIMATE.start_cstrncmp_#t~post1.offset_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~mem3, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post1.offset, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_#t~post7.offset] 670#L18 [83] L18-->L18-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3| 1) (select |v_#length_16| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|)) (= (select |v_#valid_21| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) 1) (<= 0 |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) (= (select (select |v_#memory_int_9| |v_ULTIMATE.start_cstrncmp_#t~post7.base_3|) |v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|) |v_ULTIMATE.start_cstrncmp_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_2|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_3|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_16|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8] 668#L18-1 [174] L18-1-->L15-1: Formula: (< |v_ULTIMATE.start_cstrncmp_#t~mem8_6| 0) InVars {ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_6|} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_7|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#t~post7.offset] 669#L15-1 [119] L15-1-->L15-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cstrncmp_~n_6 (- 1)))) (and (= v_ULTIMATE.start_cstrncmp_~n_5 .cse0) (= |v_ULTIMATE.start_cstrncmp_#t~pre0_4| .cse0))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_4|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0, ULTIMATE.start_cstrncmp_~n] 677#L15-2 [181] L15-2-->L15-4: Formula: (> |v_ULTIMATE.start_cstrncmp_#t~pre0_2| 0) InVars {ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_2|} OutVars{ULTIMATE.start_cstrncmp_#t~pre0=|v_ULTIMATE.start_cstrncmp_#t~pre0_1|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~pre0] 674#L15-4 [2020-06-22 10:24:50,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:50,326 INFO L82 PathProgramCache]: Analyzing trace with hash -654070017, now seen corresponding path program 1 times [2020-06-22 10:24:50,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:50,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:50,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:50,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:50,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:50,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:50,338 INFO L82 PathProgramCache]: Analyzing trace with hash 660213728, now seen corresponding path program 1 times [2020-06-22 10:24:50,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:50,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:50,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:50,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:50,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:50,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash -756996318, now seen corresponding path program 1 times [2020-06-22 10:24:50,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:24:50,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:24:50,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:50,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:24:50,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:24:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:24:50,489 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2020-06-22 10:24:50,769 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2020-06-22 10:24:50,883 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-06-22 10:24:50,885 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:24:50,885 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:24:50,885 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:24:50,885 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:24:50,886 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:24:50,886 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:24:50,886 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:24:50,886 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:24:50,886 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 10:24:50,886 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:24:50,886 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:24:50,889 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 10:24:50,891 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 10:24:50,893 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 10:24:50,895 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 10:24:51,180 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2020-06-22 10:24:51,306 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-06-22 10:24:51,306 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 10:24:51,308 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 10:24:51,309 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 10:24:51,318 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 10:24:51,320 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 10:24:51,321 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 10:24:51,323 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 10:24:51,324 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 10:24:51,326 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 10:24:51,327 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 10:24:51,329 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 10:24:51,331 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 10:24:51,332 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 10:24:51,334 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 10:24:51,336 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 10:24:51,338 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 10:24:51,340 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 10:24:51,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:24:51,754 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:24:51,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 10:24:51,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:51,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:51,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:51,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:51,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:51,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:51,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:51,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:51,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 10:24:51,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:51,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:51,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:51,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:51,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:51,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:51,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:51,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 10:24:51,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:51,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:24:51,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:51,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:51,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:51,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:24:51,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:24:51,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:51,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 10:24:51,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:51,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:51,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:51,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:51,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:51,766 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:51,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:24:51,772 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 10:24:51,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:24:51,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:24:51,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:24:51,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:24:51,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:24:51,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:24:51,798 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:24:51,816 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 10:24:51,817 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 10:24:51,817 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:24:51,818 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:24:51,829 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:24:51,829 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncmp_~s2.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_2) = -1*ULTIMATE.start_cstrncmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_2 Supporting invariants [] [2020-06-22 10:24:51,879 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 10:24:51,882 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:51,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:24:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:51,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 10:24:51,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:51,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:24:51,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:51,992 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 10:24:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:52,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:24:52,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:24:52,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:24:52,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:24:52,122 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 10:24:52,122 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 8 loop predicates [2020-06-22 10:24:52,122 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-06-22 10:24:52,330 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 18 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 22 states and 27 transitions. Complement of second has 9 states. [2020-06-22 10:24:52,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 10:24:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 10:24:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2020-06-22 10:24:52,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 7 letters. Loop has 7 letters. [2020-06-22 10:24:52,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:52,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 14 letters. Loop has 7 letters. [2020-06-22 10:24:52,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:52,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 7 letters. Loop has 14 letters. [2020-06-22 10:24:52,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:24:52,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2020-06-22 10:24:52,336 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:24:52,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2020-06-22 10:24:52,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:24:52,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:24:52,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:24:52,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:24:52,337 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:24:52,337 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:24:52,337 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:24:52,337 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 10:24:52,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:24:52,338 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:24:52,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:24:52,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:24:52 BasicIcfg [2020-06-22 10:24:52,344 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:24:52,344 INFO L168 Benchmark]: Toolchain (without parser) took 25835.99 ms. Allocated memory was 649.6 MB in the beginning and 962.6 MB in the end (delta: 313.0 MB). Free memory was 558.8 MB in the beginning and 820.6 MB in the end (delta: -261.8 MB). Peak memory consumption was 51.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:52,345 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:24:52,345 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.27 ms. Allocated memory was 649.6 MB in the beginning and 680.0 MB in the end (delta: 30.4 MB). Free memory was 558.8 MB in the beginning and 642.8 MB in the end (delta: -84.0 MB). Peak memory consumption was 29.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:52,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.80 ms. Allocated memory is still 680.0 MB. Free memory was 642.8 MB in the beginning and 640.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:52,347 INFO L168 Benchmark]: Boogie Preprocessor took 26.28 ms. Allocated memory is still 680.0 MB. Free memory was 640.7 MB in the beginning and 639.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:52,347 INFO L168 Benchmark]: RCFGBuilder took 353.72 ms. Allocated memory is still 680.0 MB. Free memory was 639.6 MB in the beginning and 615.3 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:52,348 INFO L168 Benchmark]: BlockEncodingV2 took 130.27 ms. Allocated memory is still 680.0 MB. Free memory was 615.3 MB in the beginning and 605.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:52,348 INFO L168 Benchmark]: TraceAbstraction took 18099.44 ms. Allocated memory was 680.0 MB in the beginning and 909.1 MB in the end (delta: 229.1 MB). Free memory was 604.5 MB in the beginning and 572.6 MB in the end (delta: 31.9 MB). Peak memory consumption was 261.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:24:52,349 INFO L168 Benchmark]: BuchiAutomizer took 6879.83 ms. Allocated memory was 909.1 MB in the beginning and 962.6 MB in the end (delta: 53.5 MB). Free memory was 572.6 MB in the beginning and 820.6 MB in the end (delta: -248.0 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:24:52,354 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 40 locations, 46 edges - StatisticsResult: Encoded RCFG 30 locations, 53 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 299.27 ms. Allocated memory was 649.6 MB in the beginning and 680.0 MB in the end (delta: 30.4 MB). Free memory was 558.8 MB in the beginning and 642.8 MB in the end (delta: -84.0 MB). Peak memory consumption was 29.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.80 ms. Allocated memory is still 680.0 MB. Free memory was 642.8 MB in the beginning and 640.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.28 ms. Allocated memory is still 680.0 MB. Free memory was 640.7 MB in the beginning and 639.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 353.72 ms. Allocated memory is still 680.0 MB. Free memory was 639.6 MB in the beginning and 615.3 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 130.27 ms. Allocated memory is still 680.0 MB. Free memory was 615.3 MB in the beginning and 605.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * TraceAbstraction took 18099.44 ms. Allocated memory was 680.0 MB in the beginning and 909.1 MB in the end (delta: 229.1 MB). Free memory was 604.5 MB in the beginning and 572.6 MB in the end (delta: 31.9 MB). Peak memory consumption was 261.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 6879.83 ms. Allocated memory was 909.1 MB in the beginning and 962.6 MB in the end (delta: 53.5 MB). Free memory was 572.6 MB in the beginning and 820.6 MB in the end (delta: -248.0 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,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 #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 #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 #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 #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 #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 #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 * 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: 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: 36]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: 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: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 35]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: 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: 15]: Loop Invariant [2020-06-22 10:24:52,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:52,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:52,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:52,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:52,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:52,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:52,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:52,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:52,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:52,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:52,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:52,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:52,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:52,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:52,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:52,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:52,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:52,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:52,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-06-22 10:24:52,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:52,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:52,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 10:24:52,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 10:24:52,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:52,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:52,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length1~0,QUANTIFIED] [2020-06-22 10:24:52,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:24:52,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:24:52,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((((((((((((unknown-#length-unknown[nondetString2] == length2 && 1 <= length2) && 1 <= unknown-#length-unknown[s1]) && nondetString1 == 0) && 1 == \valid[s1]) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && 1 == \valid[nondetString2]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s1] + -1])) && 0 == s2) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[nondetString1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[nondetString1] + -1])) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && 1 == \valid[s2]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: !(ULTIMATE.start_main_~nondetString2~0.base == s1) && 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && 0 == s1) && 1 == \valid[nondetString1]) && s2 + 1 <= unknown-#length-unknown[s2]) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) || ((((((((((((((((((unknown-#length-unknown[nondetString2] == length2 && 1 <= length2) && 1 <= s2) && nondetString1 == 0) && 1 <= s1) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && 0 <= ULTIMATE.start_main_~nondetString2~0.offset)) && 1 == \valid[nondetString2]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s1] + -1])) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[nondetString1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[nondetString1] + -1])) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && 1 == \valid[s2]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: !(ULTIMATE.start_main_~nondetString2~0.base == s1) && 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && s1 + 1 <= unknown-#length-unknown[s1]) && \valid[s1] == 1) && 1 == \valid[nondetString1]) && s2 + 1 <= unknown-#length-unknown[s2]) && nondetString2 == 0) && (\exists ULTIMATE.start_main_~length1~0 : int :: (1 <= ULTIMATE.start_main_~length1~0 && nondetString1 + ULTIMATE.start_main_~length1~0 <= unknown-#length-unknown[nondetString1]) && unknown-#memory_int-unknown[nondetString1][nondetString1 + ULTIMATE.start_main_~length1~0 + -1] == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 14 error locations. SAFE Result, 17.9s OverallTime, 26 OverallIterations, 4 TraceHistogramMax, 7.3s AutomataDifference, 0.0s DeadEndRemovalTime, 5.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 154 SDtfs, 1565 SDslu, 1124 SDs, 0 SdLazy, 2629 SolverSat, 377 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 28 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 327 HoareAnnotationTreeSize, 1 FomulaSimplifications, 833 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 151 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 408 ConstructedInterpolants, 38 QuantifiedInterpolants, 81136 SizeOfPredicates, 82 NumberOfNonLiveVariables, 854 ConjunctsInSsa, 204 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 32/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length2 * sizeof(char))] + -1 * s1 and consists of 11 locations. One nondeterministic module has affine ranking function -1 * s2 + unknown-#length-unknown[alloca(length2 * sizeof(char))] and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. Construction of modules took 0.5s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 56 SDtfs, 233 SDslu, 483 SDs, 0 SdLazy, 775 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital224 mio100 ax100 hnf100 lsp89 ukn86 mio100 lsp45 div100 bol100 ite100 ukn100 eq192 hnf88 smp100 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 10:24:23.087 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:24:52.619 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check