YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:30:42,648 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:30:42,649 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:30:42,660 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:30:42,661 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:30:42,662 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:30:42,663 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:30:42,664 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:30:42,666 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:30:42,667 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:30:42,667 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:30:42,668 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:30:42,668 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:30:42,669 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:30:42,670 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:30:42,671 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:30:42,672 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:30:42,674 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:30:42,675 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:30:42,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:30:42,678 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:30:42,679 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:30:42,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:30:42,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:30:42,681 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:30:42,682 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:30:42,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:30:42,683 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:30:42,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:30:42,684 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:30:42,685 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:30:42,685 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:30:42,686 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:30:42,686 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:30:42,687 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:30:42,687 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:30:42,687 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:30:42,688 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:30:42,689 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:30:42,689 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:30:42,703 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:30:42,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:30:42,704 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:30:42,704 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:30:42,705 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:30:42,705 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:30:42,705 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:30:42,705 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:30:42,705 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:30:42,705 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:30:42,706 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:30:42,706 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:30:42,706 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:30:42,706 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:30:42,706 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:30:42,706 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:30:42,707 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:30:42,707 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:30:42,707 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:30:42,707 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:30:42,707 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:30:42,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:30:42,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:30:42,708 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:30:42,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:30:42,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:30:42,708 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:30:42,709 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:30:42,709 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:30:42,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:30:42,746 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:30:42,749 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:30:42,751 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:30:42,751 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:30:42,752 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:30:42,822 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/1498b481a7194def8c069422d31ff084/FLAGd664c8dce [2020-06-22 09:30:43,168 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:30:43,168 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:30:43,169 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:30:43,176 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/1498b481a7194def8c069422d31ff084/FLAGd664c8dce [2020-06-22 09:30:43,607 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/1498b481a7194def8c069422d31ff084 [2020-06-22 09:30:43,618 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:30:43,620 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:30:43,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:30:43,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:30:43,624 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:30:43,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331a28c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43, skipping insertion in model container [2020-06-22 09:30:43,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:30:43,655 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:30:43,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:30:43,884 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:30:43,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:30:43,919 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:30:43,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43 WrapperNode [2020-06-22 09:30:43,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:30:43,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:30:43,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:30:43,921 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:30:43,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:30:43,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:30:43,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:30:43,962 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:30:43,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... [2020-06-22 09:30:43,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:30:43,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:30:43,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:30:43,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:30:43,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:30:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:30:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:30:44,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:30:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:30:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:30:44,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:30:44,291 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:30:44,292 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 09:30:44,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:30:44 BoogieIcfgContainer [2020-06-22 09:30:44,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:30:44,294 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:30:44,294 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:30:44,296 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:30:44,297 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:30:44" (1/1) ... [2020-06-22 09:30:44,313 INFO L313 BlockEncoder]: Initial Icfg 28 locations, 34 edges [2020-06-22 09:30:44,315 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:30:44,316 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:30:44,316 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:30:44,316 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:30:44,318 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:30:44,319 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:30:44,319 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:30:44,342 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:30:44,374 INFO L200 BlockEncoder]: SBE split 11 edges [2020-06-22 09:30:44,378 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 09:30:44,380 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:30:44,407 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 09:30:44,410 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 09:30:44,411 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:30:44,412 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:30:44,412 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:30:44,413 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:30:44,413 INFO L313 BlockEncoder]: Encoded RCFG 20 locations, 36 edges [2020-06-22 09:30:44,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:30:44 BasicIcfg [2020-06-22 09:30:44,414 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:30:44,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:30:44,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:30:44,418 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:30:44,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:30:43" (1/4) ... [2020-06-22 09:30:44,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f799b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:30:44, skipping insertion in model container [2020-06-22 09:30:44,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (2/4) ... [2020-06-22 09:30:44,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f799b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:30:44, skipping insertion in model container [2020-06-22 09:30:44,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:30:44" (3/4) ... [2020-06-22 09:30:44,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f799b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:30:44, skipping insertion in model container [2020-06-22 09:30:44,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:30:44" (4/4) ... [2020-06-22 09:30:44,422 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:30:44,432 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:30:44,440 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-06-22 09:30:44,456 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-06-22 09:30:44,484 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:30:44,485 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:30:44,485 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:30:44,486 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:30:44,486 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:30:44,486 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:30:44,486 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:30:44,486 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:30:44,486 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:30:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-06-22 09:30:44,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:30:44,507 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:44,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:30:44,508 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:44,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:44,513 INFO L82 PathProgramCache]: Analyzing trace with hash 159033776, now seen corresponding path program 1 times [2020-06-22 09:30:44,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:44,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:44,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:44,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:44,676 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 09:30:44,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:44,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:30:44,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:44,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:44,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:44,699 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2020-06-22 09:30:44,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:44,796 INFO L93 Difference]: Finished difference Result 20 states and 36 transitions. [2020-06-22 09:30:44,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:44,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:30:44,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:44,811 INFO L225 Difference]: With dead ends: 20 [2020-06-22 09:30:44,811 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:30:44,815 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 09:30:44,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:30:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:30:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:30:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2020-06-22 09:30:44,852 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 5 [2020-06-22 09:30:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:44,853 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 34 transitions. [2020-06-22 09:30:44,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 34 transitions. [2020-06-22 09:30:44,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:30:44,854 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:44,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:30:44,854 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:44,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:44,855 INFO L82 PathProgramCache]: Analyzing trace with hash 159033778, now seen corresponding path program 1 times [2020-06-22 09:30:44,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:44,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:44,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:44,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:44,901 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 09:30:44,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:44,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:30:44,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:30:44,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:30:44,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:30:44,905 INFO L87 Difference]: Start difference. First operand 19 states and 34 transitions. Second operand 4 states. [2020-06-22 09:30:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:44,979 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. [2020-06-22 09:30:44,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:30:44,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 09:30:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:44,980 INFO L225 Difference]: With dead ends: 20 [2020-06-22 09:30:44,981 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:30:44,982 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 09:30:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:30:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:30:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:30:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2020-06-22 09:30:44,986 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 5 [2020-06-22 09:30:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:44,986 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 33 transitions. [2020-06-22 09:30:44,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:30:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 33 transitions. [2020-06-22 09:30:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:30:44,987 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:44,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:30:44,987 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:44,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:44,988 INFO L82 PathProgramCache]: Analyzing trace with hash 159033779, now seen corresponding path program 1 times [2020-06-22 09:30:44,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:44,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:44,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:44,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:45,019 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 09:30:45,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:45,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:30:45,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:30:45,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:30:45,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:30:45,021 INFO L87 Difference]: Start difference. First operand 19 states and 33 transitions. Second operand 3 states. [2020-06-22 09:30:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:45,072 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2020-06-22 09:30:45,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:30:45,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:30:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:45,073 INFO L225 Difference]: With dead ends: 19 [2020-06-22 09:30:45,073 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:30:45,074 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 09:30:45,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:30:45,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:30:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:30:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2020-06-22 09:30:45,077 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 5 [2020-06-22 09:30:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:45,078 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 32 transitions. [2020-06-22 09:30:45,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:30:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. [2020-06-22 09:30:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 09:30:45,079 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:45,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:45,079 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:45,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1787341292, now seen corresponding path program 1 times [2020-06-22 09:30:45,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:45,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:45,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:45,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:45,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:45,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:30:45,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:30:45,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:30:45,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:30:45,146 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand 4 states. [2020-06-22 09:30:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:45,243 INFO L93 Difference]: Finished difference Result 18 states and 32 transitions. [2020-06-22 09:30:45,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:30:45,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 09:30:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:45,244 INFO L225 Difference]: With dead ends: 18 [2020-06-22 09:30:45,244 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 09:30:45,245 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 09:30:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 09:30:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 09:30:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 09:30:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2020-06-22 09:30:45,248 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 7 [2020-06-22 09:30:45,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:45,249 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2020-06-22 09:30:45,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:30:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2020-06-22 09:30:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 09:30:45,249 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:45,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:45,250 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:45,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:45,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1787341290, now seen corresponding path program 1 times [2020-06-22 09:30:45,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:45,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:45,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:45,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:45,320 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 09:30:45,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:45,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:30:45,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:30:45,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:30:45,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:30:45,321 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2020-06-22 09:30:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:45,480 INFO L93 Difference]: Finished difference Result 24 states and 42 transitions. [2020-06-22 09:30:45,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:30:45,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-06-22 09:30:45,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:45,481 INFO L225 Difference]: With dead ends: 24 [2020-06-22 09:30:45,482 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 09:30:45,482 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 09:30:45,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 09:30:45,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2020-06-22 09:30:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:30:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2020-06-22 09:30:45,487 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 7 [2020-06-22 09:30:45,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:45,487 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. [2020-06-22 09:30:45,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:30:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. [2020-06-22 09:30:45,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:30:45,488 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:45,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:45,488 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:45,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:45,489 INFO L82 PathProgramCache]: Analyzing trace with hash 426993808, now seen corresponding path program 1 times [2020-06-22 09:30:45,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:45,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:45,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:45,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:45,596 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 09:30:45,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:45,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:30:45,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:30:45,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:30:45,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:30:45,597 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand 6 states. [2020-06-22 09:30:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:45,733 INFO L93 Difference]: Finished difference Result 23 states and 40 transitions. [2020-06-22 09:30:45,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:30:45,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-06-22 09:30:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:45,734 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:30:45,734 INFO L226 Difference]: Without dead ends: 22 [2020-06-22 09:30:45,735 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 09:30:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-06-22 09:30:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-06-22 09:30:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 09:30:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2020-06-22 09:30:45,740 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 35 transitions. Word has length 8 [2020-06-22 09:30:45,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:45,740 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-06-22 09:30:45,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:30:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. [2020-06-22 09:30:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:30:45,741 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:45,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:45,741 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:45,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:45,741 INFO L82 PathProgramCache]: Analyzing trace with hash 426993806, now seen corresponding path program 1 times [2020-06-22 09:30:45,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:45,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:45,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:45,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:45,802 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 09:30:45,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:45,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:30:45,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:30:45,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:30:45,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:30:45,803 INFO L87 Difference]: Start difference. First operand 20 states and 35 transitions. Second operand 6 states. [2020-06-22 09:30:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:45,919 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2020-06-22 09:30:45,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:30:45,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-06-22 09:30:45,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:45,920 INFO L225 Difference]: With dead ends: 20 [2020-06-22 09:30:45,921 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:30:45,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:30:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:30:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:30:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:30:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 31 transitions. [2020-06-22 09:30:45,925 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 31 transitions. Word has length 8 [2020-06-22 09:30:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:45,926 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 31 transitions. [2020-06-22 09:30:45,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:30:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2020-06-22 09:30:45,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:30:45,926 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:45,927 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:45,927 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:45,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:45,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1121839631, now seen corresponding path program 1 times [2020-06-22 09:30:45,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:45,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:45,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:45,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:45,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:30:45,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:30:45,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:30:45,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:30:45,972 INFO L87 Difference]: Start difference. First operand 19 states and 31 transitions. Second operand 5 states. [2020-06-22 09:30:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:46,073 INFO L93 Difference]: Finished difference Result 42 states and 69 transitions. [2020-06-22 09:30:46,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:30:46,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-06-22 09:30:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:46,075 INFO L225 Difference]: With dead ends: 42 [2020-06-22 09:30:46,075 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 09:30:46,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:30:46,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 09:30:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-06-22 09:30:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 09:30:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2020-06-22 09:30:46,081 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 11 [2020-06-22 09:30:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:46,081 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 40 transitions. [2020-06-22 09:30:46,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:30:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 40 transitions. [2020-06-22 09:30:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:30:46,082 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:46,082 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:46,082 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:46,083 INFO L82 PathProgramCache]: Analyzing trace with hash -638294766, now seen corresponding path program 1 times [2020-06-22 09:30:46,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:46,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:46,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:46,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:46,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 09:30:46,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 09:30:46,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 09:30:46,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:30:46,167 INFO L87 Difference]: Start difference. First operand 25 states and 40 transitions. Second operand 7 states. [2020-06-22 09:30:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:46,311 INFO L93 Difference]: Finished difference Result 54 states and 88 transitions. [2020-06-22 09:30:46,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:30:46,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-06-22 09:30:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:46,315 INFO L225 Difference]: With dead ends: 54 [2020-06-22 09:30:46,315 INFO L226 Difference]: Without dead ends: 43 [2020-06-22 09:30:46,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-06-22 09:30:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-06-22 09:30:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2020-06-22 09:30:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 09:30:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 42 transitions. [2020-06-22 09:30:46,321 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 42 transitions. Word has length 11 [2020-06-22 09:30:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:46,321 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 42 transitions. [2020-06-22 09:30:46,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 09:30:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 42 transitions. [2020-06-22 09:30:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:30:46,322 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:46,322 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:46,323 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:46,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:46,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1227835281, now seen corresponding path program 1 times [2020-06-22 09:30:46,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:46,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:46,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:46,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:46,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:46,475 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 09:30:46,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:30:46,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:30:46,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:46,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 28 conjunts are in the unsatisfiable core [2020-06-22 09:30:46,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:46,588 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:46,589 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 09:30:46,590 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:46,609 INFO L497 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-06-22 09:30:46,610 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:46,610 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-06-22 09:30:46,633 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 09:30:46,634 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:46,643 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:46,644 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 09:30:46,644 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-06-22 09:30:46,725 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:46,725 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-06-22 09:30:46,729 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:30:46,744 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:46,749 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:46,749 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:34 [2020-06-22 09:30:46,863 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 09:30:46,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:30:46,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-06-22 09:30:46,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 09:30:46,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 09:30:46,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-06-22 09:30:46,892 INFO L87 Difference]: Start difference. First operand 26 states and 42 transitions. Second operand 15 states. [2020-06-22 09:30:47,281 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2020-06-22 09:30:47,413 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2020-06-22 09:30:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:47,655 INFO L93 Difference]: Finished difference Result 34 states and 55 transitions. [2020-06-22 09:30:47,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 09:30:47,655 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2020-06-22 09:30:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:47,656 INFO L225 Difference]: With dead ends: 34 [2020-06-22 09:30:47,656 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 09:30:47,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2020-06-22 09:30:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 09:30:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2020-06-22 09:30:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 09:30:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 48 transitions. [2020-06-22 09:30:47,662 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 48 transitions. Word has length 11 [2020-06-22 09:30:47,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:47,663 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 48 transitions. [2020-06-22 09:30:47,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 09:30:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 48 transitions. [2020-06-22 09:30:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 09:30:47,663 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:47,664 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:47,664 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:47,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:47,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1227835280, now seen corresponding path program 1 times [2020-06-22 09:30:47,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:47,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:47,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:47,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:47,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:47,716 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 09:30:47,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:30:47,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:30:47,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:47,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:30:47,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:47,773 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 09:30:47,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:30:47,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 09:30:47,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:30:47,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:30:47,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:30:47,801 INFO L87 Difference]: Start difference. First operand 29 states and 48 transitions. Second operand 8 states. [2020-06-22 09:30:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:47,931 INFO L93 Difference]: Finished difference Result 30 states and 48 transitions. [2020-06-22 09:30:47,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:30:47,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-06-22 09:30:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:47,932 INFO L225 Difference]: With dead ends: 30 [2020-06-22 09:30:47,932 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 09:30:47,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 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 09:30:47,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 09:30:47,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 09:30:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 09:30:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 46 transitions. [2020-06-22 09:30:47,938 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 46 transitions. Word has length 11 [2020-06-22 09:30:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:47,938 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 46 transitions. [2020-06-22 09:30:47,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:30:47,938 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 46 transitions. [2020-06-22 09:30:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:30:47,939 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:47,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:47,939 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:47,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:47,940 INFO L82 PathProgramCache]: Analyzing trace with hash -418787049, now seen corresponding path program 1 times [2020-06-22 09:30:47,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:47,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:47,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:47,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:47,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:47,977 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 09:30:47,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:47,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:30:47,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:30:47,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:30:47,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:30:47,978 INFO L87 Difference]: Start difference. First operand 29 states and 46 transitions. Second operand 5 states. [2020-06-22 09:30:48,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:48,050 INFO L93 Difference]: Finished difference Result 36 states and 57 transitions. [2020-06-22 09:30:48,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:30:48,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-06-22 09:30:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:48,051 INFO L225 Difference]: With dead ends: 36 [2020-06-22 09:30:48,051 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:30:48,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 09:30:48,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:30:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 09:30:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 09:30:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2020-06-22 09:30:48,057 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 12 [2020-06-22 09:30:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:48,057 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. [2020-06-22 09:30:48,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:30:48,057 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. [2020-06-22 09:30:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:30:48,058 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:48,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:48,058 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:48,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,058 INFO L82 PathProgramCache]: Analyzing trace with hash -418787018, now seen corresponding path program 1 times [2020-06-22 09:30:48,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:48,110 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 09:30:48,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:48,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 09:30:48,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 09:30:48,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 09:30:48,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 09:30:48,112 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 7 states. [2020-06-22 09:30:48,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:48,241 INFO L93 Difference]: Finished difference Result 44 states and 67 transitions. [2020-06-22 09:30:48,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:30:48,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-06-22 09:30:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:48,244 INFO L225 Difference]: With dead ends: 44 [2020-06-22 09:30:48,244 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:30:48,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-06-22 09:30:48,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:30:48,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 09:30:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 09:30:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2020-06-22 09:30:48,250 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 12 [2020-06-22 09:30:48,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:48,250 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2020-06-22 09:30:48,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 09:30:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2020-06-22 09:30:48,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:30:48,251 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:48,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:48,251 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:48,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1686201909, now seen corresponding path program 1 times [2020-06-22 09:30:48,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:48,294 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 09:30:48,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:48,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:30:48,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 09:30:48,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 09:30:48,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:30:48,295 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 6 states. [2020-06-22 09:30:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:48,397 INFO L93 Difference]: Finished difference Result 31 states and 46 transitions. [2020-06-22 09:30:48,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:30:48,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-06-22 09:30:48,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:48,398 INFO L225 Difference]: With dead ends: 31 [2020-06-22 09:30:48,398 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 09:30:48,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:30:48,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 09:30:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 09:30:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 09:30:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2020-06-22 09:30:48,403 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 12 [2020-06-22 09:30:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:48,403 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2020-06-22 09:30:48,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 09:30:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2020-06-22 09:30:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:30:48,404 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:48,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:48,405 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:48,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1686201911, now seen corresponding path program 1 times [2020-06-22 09:30:48,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:48,500 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 09:30:48,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:48,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 09:30:48,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 09:30:48,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 09:30:48,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 09:30:48,501 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 9 states. [2020-06-22 09:30:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:48,710 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2020-06-22 09:30:48,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 09:30:48,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2020-06-22 09:30:48,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:48,711 INFO L225 Difference]: With dead ends: 33 [2020-06-22 09:30:48,711 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 09:30:48,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-06-22 09:30:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 09:30:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-06-22 09:30:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 09:30:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2020-06-22 09:30:48,716 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 12 [2020-06-22 09:30:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:48,717 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2020-06-22 09:30:48,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 09:30:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2020-06-22 09:30:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:30:48,717 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:48,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:48,718 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:48,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1686201912, now seen corresponding path program 1 times [2020-06-22 09:30:48,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:48,785 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 09:30:48,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:48,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 09:30:48,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:30:48,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:30:48,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:30:48,787 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 8 states. [2020-06-22 09:30:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:48,938 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2020-06-22 09:30:48,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 09:30:48,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-06-22 09:30:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:48,939 INFO L225 Difference]: With dead ends: 32 [2020-06-22 09:30:48,939 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:30:48,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-06-22 09:30:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:30:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 09:30:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 09:30:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2020-06-22 09:30:48,955 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 12 [2020-06-22 09:30:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:48,955 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-06-22 09:30:48,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:30:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2020-06-22 09:30:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:30:48,956 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:48,956 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:48,956 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:48,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:48,957 INFO L82 PathProgramCache]: Analyzing trace with hash 591810903, now seen corresponding path program 1 times [2020-06-22 09:30:48,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:48,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:48,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:48,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:49,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:30:49,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:30:49,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:49,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 30 conjunts are in the unsatisfiable core [2020-06-22 09:30:49,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:49,088 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 09:30:49,089 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:49,099 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:49,104 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 09:30:49,104 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:49,112 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:49,113 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:49,114 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-06-22 09:30:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:49,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:30:49,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2020-06-22 09:30:49,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-06-22 09:30:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-06-22 09:30:49,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-06-22 09:30:49,203 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand 11 states. [2020-06-22 09:30:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:49,438 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2020-06-22 09:30:49,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 09:30:49,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2020-06-22 09:30:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:49,439 INFO L225 Difference]: With dead ends: 42 [2020-06-22 09:30:49,439 INFO L226 Difference]: Without dead ends: 41 [2020-06-22 09:30:49,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2020-06-22 09:30:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-06-22 09:30:49,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2020-06-22 09:30:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 09:30:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2020-06-22 09:30:49,445 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 12 [2020-06-22 09:30:49,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:49,445 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2020-06-22 09:30:49,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-06-22 09:30:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2020-06-22 09:30:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 09:30:49,446 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:49,446 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:49,446 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:49,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:49,447 INFO L82 PathProgramCache]: Analyzing trace with hash 591810904, now seen corresponding path program 1 times [2020-06-22 09:30:49,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:49,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:49,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:49,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:49,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:49,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:30:49,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:30:49,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:49,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:30:49,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:49,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:30:49,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 09:30:49,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:30:49,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:30:49,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:30:49,582 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 8 states. [2020-06-22 09:30:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:49,696 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2020-06-22 09:30:49,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:30:49,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-06-22 09:30:49,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:49,697 INFO L225 Difference]: With dead ends: 31 [2020-06-22 09:30:49,697 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 09:30:49,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 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 09:30:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 09:30:49,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 09:30:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 09:30:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2020-06-22 09:30:49,702 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 12 [2020-06-22 09:30:49,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:49,702 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2020-06-22 09:30:49,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:30:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2020-06-22 09:30:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:30:49,703 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:49,703 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:49,703 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:49,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:49,704 INFO L82 PathProgramCache]: Analyzing trace with hash -296086263, now seen corresponding path program 1 times [2020-06-22 09:30:49,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:49,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:49,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:49,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:49,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:49,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:30:49,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:30:49,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:49,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:30:49,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:49,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:30:49,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 09:30:49,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:30:49,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:30:49,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:30:49,801 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand 5 states. [2020-06-22 09:30:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:49,850 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2020-06-22 09:30:49,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:30:49,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-06-22 09:30:49,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:49,851 INFO L225 Difference]: With dead ends: 34 [2020-06-22 09:30:49,851 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 09:30:49,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 09:30:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 09:30:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 09:30:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 09:30:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2020-06-22 09:30:49,856 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 15 [2020-06-22 09:30:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:49,856 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2020-06-22 09:30:49,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:30:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2020-06-22 09:30:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:30:49,857 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:49,857 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:49,857 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:49,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:49,857 INFO L82 PathProgramCache]: Analyzing trace with hash -296086232, now seen corresponding path program 1 times [2020-06-22 09:30:49,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:49,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:49,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:49,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:49,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:30:49,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:30:49,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:30:49,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:50,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 43 conjunts are in the unsatisfiable core [2020-06-22 09:30:50,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:50,012 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 09:30:50,012 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:50,018 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:50,021 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 09:30:50,021 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:50,028 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:50,028 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:50,028 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-06-22 09:30:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:50,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:30:50,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2020-06-22 09:30:50,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-06-22 09:30:50,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-06-22 09:30:50,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-06-22 09:30:50,197 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand 19 states. [2020-06-22 09:30:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:50,729 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2020-06-22 09:30:50,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-06-22 09:30:50,729 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2020-06-22 09:30:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:50,730 INFO L225 Difference]: With dead ends: 39 [2020-06-22 09:30:50,730 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 09:30:50,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2020-06-22 09:30:50,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 09:30:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 09:30:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 09:30:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-06-22 09:30:50,733 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 15 [2020-06-22 09:30:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:50,734 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-06-22 09:30:50,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-06-22 09:30:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-06-22 09:30:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:30:50,734 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:30:50,734 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:50,735 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION]=== [2020-06-22 09:30:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:50,735 INFO L82 PathProgramCache]: Analyzing trace with hash -203381814, now seen corresponding path program 2 times [2020-06-22 09:30:50,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:50,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:50,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:50,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:50,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:50,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:30:50,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:30:50,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 09:30:50,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 09:30:50,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 09:30:50,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 47 conjunts are in the unsatisfiable core [2020-06-22 09:30:50,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:50,999 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 09:30:51,000 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:51,005 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:51,008 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 09:30:51,008 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:51,015 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:51,015 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:51,016 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:13 [2020-06-22 09:30:51,037 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 15 treesize of output 11 [2020-06-22 09:30:51,038 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:51,042 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:51,042 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:51,042 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2020-06-22 09:30:51,083 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2020-06-22 09:30:51,084 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 09:30:51,089 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:51,090 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 09:30:51,090 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2020-06-22 09:30:51,140 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:51,140 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 09:30:51,141 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 09:30:51,150 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 09:30:51,152 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-06-22 09:30:51,152 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2020-06-22 09:30:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:30:51,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:30:51,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-06-22 09:30:51,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 09:30:51,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 09:30:51,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-06-22 09:30:51,216 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 17 states. [2020-06-22 09:30:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:51,836 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-06-22 09:30:51,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-06-22 09:30:51,837 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2020-06-22 09:30:51,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:30:51,837 INFO L225 Difference]: With dead ends: 18 [2020-06-22 09:30:51,837 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:30:51,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2020-06-22 09:30:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:30:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:30:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:30:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:30:51,838 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-06-22 09:30:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:30:51,839 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:30:51,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 09:30:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:30:51,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:30:51,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:30:52,673 WARN L188 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2020-06-22 09:30:52,878 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2020-06-22 09:30:52,881 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-06-22 09:30:52,881 INFO L448 ceAbstractionStarter]: For program point L31-2(lines 28 42) no Hoare annotation was computed. [2020-06-22 09:30:52,881 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2020-06-22 09:30:52,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:30:52,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:30:52,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. [2020-06-22 09:30:52,881 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 39) no Hoare annotation was computed. [2020-06-22 09:30:52,882 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 34 36) no Hoare annotation was computed. [2020-06-22 09:30:52,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:30:52,882 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 21) no Hoare annotation was computed. [2020-06-22 09:30:52,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:30:52,882 INFO L444 ceAbstractionStarter]: At program point L20-3(lines 20 21) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_main_~nondetString~0.offset 0) (<= 1 ULTIMATE.start_main_~length~0) (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base)) (= ULTIMATE.start_main_~nondetArea~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1) (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1) (<= 1 ULTIMATE.start_main_~n~0) (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~dst~0.base)) (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~src~0.base)))) (.cse1 (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (.cse2 (<= 0 ULTIMATE.start_cstrncpy_~n)) (.cse4 (<= 1 ULTIMATE.start_cstrncpy_~src~0.offset)) (.cse3 (<= 0 ULTIMATE.start_cstrncpy_~n2~0))) (or (and (<= ULTIMATE.start_cstrncpy_~n2~0 0) (<= ULTIMATE.start_cstrncpy_~n 0) .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~n~0 1) .cse4) (and (and (<= 1 ULTIMATE.start_cstrncpy_~dst~0.offset) (<= 1 ULTIMATE.start_cstrncpy_~us~0.offset) .cse0 .cse1 .cse2 (= (select |#valid| ULTIMATE.start_cstrncpy_~us~0.base) 1) (<= (+ ULTIMATE.start_cstrncpy_~n ULTIMATE.start_cstrncpy_~dst~0.offset) (select |#length| ULTIMATE.start_cstrncpy_~dst~0.base)) .cse4) .cse3 (<= (+ ULTIMATE.start_cstrncpy_~us~0.offset ULTIMATE.start_cstrncpy_~n2~0) (select |#length| ULTIMATE.start_cstrncpy_~us~0.base))))) [2020-06-22 09:30:52,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:30:52,882 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 09:30:52,883 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2020-06-22 09:30:52,883 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-06-22 09:30:52,883 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-06-22 09:30:52,883 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 23) no Hoare annotation was computed. [2020-06-22 09:30:52,883 INFO L444 ceAbstractionStarter]: At program point L12-2(lines 12 24) the Hoare annotation is: (let ((.cse20 (select |#length| ULTIMATE.start_cstrncpy_~dst~0.base)) (.cse21 (select |#memory_int| ULTIMATE.start_cstrncpy_~src~0.base)) (.cse19 (select |#length| ULTIMATE.start_cstrncpy_~src~0.base))) (let ((.cse11 (not (= ULTIMATE.start_main_~nondetString~0.base ULTIMATE.start_main_~nondetArea~0.base))) (.cse15 (= (select .cse21 (+ .cse19 (- 1))) 0)) (.cse18 (not (= ULTIMATE.start_cstrncpy_~src~0.base ULTIMATE.start_cstrncpy_~dst~0.base))) (.cse14 (<= ULTIMATE.start_cstrncpy_~n .cse20)) (.cse1 (<= 1 ULTIMATE.start_main_~length~0)) (.cse9 (<= ULTIMATE.start_main_~n~0 1)) (.cse2 (= ULTIMATE.start_main_~n~0 (select |#length| ULTIMATE.start_main_~nondetArea~0.base))) (.cse12 (= 0 ULTIMATE.start_cstrncpy_~dst~0.offset)) (.cse3 (= ULTIMATE.start_main_~nondetArea~0.offset 0)) (.cse4 (= (select |#valid| ULTIMATE.start_main_~nondetArea~0.base) 1)) (.cse5 (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (.cse13 (<= 1 .cse19)) (.cse7 (<= 1 ULTIMATE.start_main_~n~0)) (.cse0 (= ULTIMATE.start_main_~nondetString~0.offset 0)) (.cse16 (<= 1 .cse20)) (.cse6 (= (select |#valid| ULTIMATE.start_main_~nondetString~0.base) 1)) (.cse8 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~dst~0.base))) (.cse17 (= ULTIMATE.start_cstrncpy_~src~0.offset 0)) (.cse10 (= 1 (select |#valid| ULTIMATE.start_cstrncpy_~src~0.base)))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_cstrncpy_~n 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse13 .cse7 .cse14 .cse0 .cse15 .cse16 .cse6 .cse8 .cse17 .cse18 .cse10) (and (<= 1 ULTIMATE.start_cstrncpy_~dst~0.offset) .cse11 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_cstrncpy_~src~0.offset 1) .cse19) .cse4 .cse5 (<= 0 ULTIMATE.start_cstrncpy_~n) .cse7 .cse0 .cse15 .cse6 .cse8 (<= (+ ULTIMATE.start_cstrncpy_~n ULTIMATE.start_cstrncpy_~dst~0.offset) .cse20) .cse18 (<= 1 ULTIMATE.start_cstrncpy_~src~0.offset) .cse10) (and (exists ((ULTIMATE.start_main_~nondetString~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrncpy_~src~0.base) (+ (select |#length| ULTIMATE.start_cstrncpy_~src~0.base) ULTIMATE.start_main_~nondetString~0.offset (- 1)))) (<= ULTIMATE.start_main_~nondetString~0.offset 0) (<= ULTIMATE.start_cstrncpy_~src~0.offset ULTIMATE.start_main_~nondetString~0.offset))) .cse14 (or (and .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse13 .cse7 (<= ULTIMATE.start_cstrncpy_~n 1) .cse0 .cse6 .cse8 .cse17 .cse9 .cse10) (and .cse2 .cse12 .cse3 .cse4 .cse5 .cse13 (= 0 (select .cse21 ULTIMATE.start_cstrncpy_~src~0.offset)) .cse7 (= (+ ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~nondetString~0.offset) 1) .cse0 .cse16 .cse6 .cse8 .cse17 .cse10)))))) [2020-06-22 09:30:52,883 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2020-06-22 09:30:52,884 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:30:52,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:52,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:52,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:52,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,901 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:52,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:52,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,903 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:52,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,904 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,905 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:52,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,915 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:52,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:52,916 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:52,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,919 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,920 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:52,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,923 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:52,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:52,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,924 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,926 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:52,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,934 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,935 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,936 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:52,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:30:52 BasicIcfg [2020-06-22 09:30:52,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:30:52,939 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:30:52,939 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:30:52,942 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:30:52,943 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:52,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:30:43" (1/5) ... [2020-06-22 09:30:52,944 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57af6a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:30:52, skipping insertion in model container [2020-06-22 09:30:52,944 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:52,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:30:43" (2/5) ... [2020-06-22 09:30:52,944 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57af6a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:30:52, skipping insertion in model container [2020-06-22 09:30:52,944 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:52,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:30:44" (3/5) ... [2020-06-22 09:30:52,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57af6a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:30:52, skipping insertion in model container [2020-06-22 09:30:52,945 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:52,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:30:44" (4/5) ... [2020-06-22 09:30:52,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57af6a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:30:52, skipping insertion in model container [2020-06-22 09:30:52,945 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:30:52,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:30:52" (5/5) ... [2020-06-22 09:30:52,947 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:30:52,968 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:30:52,968 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:30:52,968 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:30:52,968 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:30:52,968 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:30:52,969 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:30:52,969 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:30:52,969 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:30:52,969 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:30:52,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-06-22 09:30:52,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-06-22 09:30:52,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:52,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:52,981 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:30:52,981 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:30:52,981 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:30:52,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-06-22 09:30:52,982 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-06-22 09:30:52,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:52,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:52,983 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 09:30:52,983 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 09:30:52,988 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue [138] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 13#L31true [100] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 9#L31-2true [101] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 18#L34-1true [117] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< |v_ULTIMATE.start_main_#t~malloc9.base_2| |v_#StackHeapBarrier_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 7#L39true [139] L39-->L12-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 v_ULTIMATE.start_cstrncpy_~src~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 |v_ULTIMATE.start_cstrncpy_#in~s1.base_2|) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~n_7 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 v_ULTIMATE.start_cstrncpy_~src~0.base_5) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2| v_ULTIMATE.start_main_~nondetArea~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 v_ULTIMATE.start_cstrncpy_~dst~0.offset_6) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 v_ULTIMATE.start_cstrncpy_~dst~0.base_6) (= |v_ULTIMATE.start_cstrncpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= 1 .cse0) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#in~s2.base=|v_ULTIMATE.start_cstrncpy_#in~s2.base_2|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_6, ULTIMATE.start_cstrncpy_#in~s1.base=|v_ULTIMATE.start_cstrncpy_#in~s1.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_6, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_6, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_6, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~s1.offset=v_ULTIMATE.start_cstrncpy_~s1.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_5, ULTIMATE.start_cstrncpy_~s1.base=v_ULTIMATE.start_cstrncpy_~s1.base_4, ULTIMATE.start_cstrncpy_#in~s2.offset=|v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_6, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_7|, ULTIMATE.start_cstrncpy_~s2.base=v_ULTIMATE.start_cstrncpy_~s2.base_3, ULTIMATE.start_cstrncpy_#in~s1.offset=|v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_5, ULTIMATE.start_cstrncpy_~s2.offset=v_ULTIMATE.start_cstrncpy_~s2.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#in~s2.base, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#in~s1.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~s1.offset, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~s1.base, ULTIMATE.start_cstrncpy_#in~s2.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_~s2.base, ULTIMATE.start_cstrncpy_#in~s1.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~s2.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 14#L12-2true [2020-06-22 09:30:52,989 INFO L796 eck$LassoCheckResult]: Loop: 14#L12-2true [75] L12-2-->L14: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~dst~0.base_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~dst~0.offset_4) (= (+ v_ULTIMATE.start_cstrncpy_~n_4 1) v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~dst~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~src~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1)) (= v_ULTIMATE.start_cstrncpy_~src~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~src~0.base_4) (< 0 v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_4, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_4, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_3, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_3, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 21#L14true [86] L14-->L14-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 20#L14-1true [82] L14-1-->L14-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (= (select |v_#valid_10| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 19#L14-2true [130] L14-2-->L12-2: Formula: (> |v_ULTIMATE.start_cstrncpy_#t~mem3_7| 0) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_7|} OutVars{ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_7|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_7|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_#t~post2.offset] 14#L12-2true [2020-06-22 09:30:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:52,990 INFO L82 PathProgramCache]: Analyzing trace with hash 159154976, now seen corresponding path program 1 times [2020-06-22 09:30:52,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:52,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:52,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:53,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:53,019 INFO L82 PathProgramCache]: Analyzing trace with hash 3243164, now seen corresponding path program 1 times [2020-06-22 09:30:53,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:53,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:53,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:53,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:53,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:53,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:53,027 INFO L82 PathProgramCache]: Analyzing trace with hash 594106427, now seen corresponding path program 1 times [2020-06-22 09:30:53,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:53,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:53,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:53,334 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2020-06-22 09:30:53,435 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:30:53,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:30:53,436 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:30:53,436 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:30:53,437 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:30:53,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:30:53,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:30:53,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:30:53,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 09:30:53,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:30:53,437 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:30:53,454 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 09:30:53,459 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 09:30:53,460 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 09:30:53,462 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 09:30:53,463 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 09:30:53,466 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 09:30:53,467 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 09:30:53,469 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 09:30:53,471 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 09:30:53,472 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 09:30:53,474 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 09:30:53,476 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 09:30:53,714 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2020-06-22 09:30:53,851 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-06-22 09:30:53,852 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 09:30:53,853 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 09:30:53,855 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 09:30:53,856 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 09:30:53,858 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 09:30:53,860 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 09:30:53,861 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 09:30:53,863 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 09:30:53,864 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 09:30:53,866 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 09:30:54,362 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:30:54,368 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:30:54,370 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 09:30:54,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:54,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:54,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:54,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,378 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 09:30:54,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:54,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:54,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:54,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,381 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 09:30:54,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:54,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:54,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:54,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,383 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 09:30:54,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:54,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:54,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:54,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,385 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 09:30:54,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:54,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:54,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,392 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 09:30:54,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:54,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:54,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:54,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,395 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 09:30:54,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:54,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:54,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:54,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,397 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 09:30:54,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:54,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:54,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:54,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,400 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 09:30:54,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:54,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:54,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:54,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,402 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 09:30:54,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:54,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:54,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:54,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,406 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 09:30:54,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:54,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:54,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,412 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 09:30:54,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:54,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:54,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,425 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 09:30:54,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:54,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:54,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:54,431 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 09:30:54,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:54,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:54,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:54,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:54,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:54,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:54,482 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:30:54,504 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:30:54,505 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:30:54,507 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:30:54,509 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:30:54,509 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:30:54,510 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstrncpy_~src~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstrncpy_~src~0.offset Supporting invariants [] [2020-06-22 09:30:54,550 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2020-06-22 09:30:54,557 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:54,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:54,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 30 conjunts are in the unsatisfiable core [2020-06-22 09:30:54,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:54,633 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 09:30:54,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:54,673 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 09:30:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:54,875 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:30:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:54,884 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 09:30:54,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:54,886 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 10 predicates after loop cannibalization [2020-06-22 09:30:54,890 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 10 loop predicates [2020-06-22 09:30:54,891 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states. Second operand 5 states. [2020-06-22 09:30:55,437 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states.. Second operand 5 states. Result 48 states and 85 transitions. Complement of second has 13 states. [2020-06-22 09:30:55,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 4 non-accepting loop states 3 accepting loop states [2020-06-22 09:30:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 09:30:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2020-06-22 09:30:55,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 5 letters. Loop has 4 letters. [2020-06-22 09:30:55,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:55,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 09:30:55,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:55,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 09:30:55,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:55,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 85 transitions. [2020-06-22 09:30:55,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:30:55,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 19 states and 29 transitions. [2020-06-22 09:30:55,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-06-22 09:30:55,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-06-22 09:30:55,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 29 transitions. [2020-06-22 09:30:55,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:30:55,469 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-06-22 09:30:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 29 transitions. [2020-06-22 09:30:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-06-22 09:30:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:30:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-06-22 09:30:55,471 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 09:30:55,471 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 09:30:55,472 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:30:55,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2020-06-22 09:30:55,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:30:55,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:55,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:55,473 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:55,473 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:30:55,474 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY [138] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 225#L31 [100] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 226#L31-2 [101] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 234#L34-1 [117] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< |v_ULTIMATE.start_main_#t~malloc9.base_2| |v_#StackHeapBarrier_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 235#L39 [139] L39-->L12-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 v_ULTIMATE.start_cstrncpy_~src~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 |v_ULTIMATE.start_cstrncpy_#in~s1.base_2|) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~n_7 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 v_ULTIMATE.start_cstrncpy_~src~0.base_5) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2| v_ULTIMATE.start_main_~nondetArea~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 v_ULTIMATE.start_cstrncpy_~dst~0.offset_6) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 v_ULTIMATE.start_cstrncpy_~dst~0.base_6) (= |v_ULTIMATE.start_cstrncpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= 1 .cse0) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#in~s2.base=|v_ULTIMATE.start_cstrncpy_#in~s2.base_2|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_6, ULTIMATE.start_cstrncpy_#in~s1.base=|v_ULTIMATE.start_cstrncpy_#in~s1.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_6, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_6, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_6, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~s1.offset=v_ULTIMATE.start_cstrncpy_~s1.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_5, ULTIMATE.start_cstrncpy_~s1.base=v_ULTIMATE.start_cstrncpy_~s1.base_4, ULTIMATE.start_cstrncpy_#in~s2.offset=|v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_6, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_7|, ULTIMATE.start_cstrncpy_~s2.base=v_ULTIMATE.start_cstrncpy_~s2.base_3, ULTIMATE.start_cstrncpy_#in~s1.offset=|v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_5, ULTIMATE.start_cstrncpy_~s2.offset=v_ULTIMATE.start_cstrncpy_~s2.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#in~s2.base, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#in~s1.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~s1.offset, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~s1.base, ULTIMATE.start_cstrncpy_#in~s2.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_~s2.base, ULTIMATE.start_cstrncpy_#in~s1.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~s2.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 227#L12-2 [75] L12-2-->L14: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~dst~0.base_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~dst~0.offset_4) (= (+ v_ULTIMATE.start_cstrncpy_~n_4 1) v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~dst~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~src~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1)) (= v_ULTIMATE.start_cstrncpy_~src~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~src~0.base_4) (< 0 v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_4, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_4, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_3, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_3, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 228#L14 [86] L14-->L14-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 241#L14-1 [82] L14-1-->L14-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (= (select |v_#valid_10| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 242#L14-2 [80] L14-2-->L20-3: Formula: (and (= v_ULTIMATE.start_cstrncpy_~us~0.base_3 v_ULTIMATE.start_cstrncpy_~dst~0.base_5) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_3 v_ULTIMATE.start_cstrncpy_~dst~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_5| 0) (= v_ULTIMATE.start_cstrncpy_~n2~0_3 v_ULTIMATE.start_cstrncpy_~n_6)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_5|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_3, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_4|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_5, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_6|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_5|, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_6|, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_5, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#t~post2.offset] 232#L20-3 [2020-06-22 09:30:55,474 INFO L796 eck$LassoCheckResult]: Loop: 232#L20-3 [67] L20-3-->L20-1: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post4_2| v_ULTIMATE.start_cstrncpy_~n2~0_5) (= v_ULTIMATE.start_cstrncpy_~n2~0_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post4_2| (- 1)))) InVars {ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4] 236#L20-1 [132] L20-1-->L21: Formula: (and (> 0 |v_ULTIMATE.start_cstrncpy_#t~post4_6|) (= v_ULTIMATE.start_cstrncpy_~us~0.base_4 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~us~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~us~0.base_5)) InVars {ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_5, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_6|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_5} OutVars{ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_5|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_4, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_~us~0.offset] 231#L21 [143] L21-->L20-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 232#L20-3 [2020-06-22 09:30:55,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:55,475 INFO L82 PathProgramCache]: Analyzing trace with hash 594106377, now seen corresponding path program 1 times [2020-06-22 09:30:55,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:55,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:55,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:55,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:55,495 INFO L82 PathProgramCache]: Analyzing trace with hash 98413, now seen corresponding path program 1 times [2020-06-22 09:30:55,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:55,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:55,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:55,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:55,501 INFO L82 PathProgramCache]: Analyzing trace with hash -537080987, now seen corresponding path program 1 times [2020-06-22 09:30:55,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:55,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:55,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:55,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:55,529 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 09:30:55,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:30:55,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 09:30:55,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:30:55,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:30:55,576 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-06-22 09:30:55,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:55,638 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2020-06-22 09:30:55,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:30:55,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 30 transitions. [2020-06-22 09:30:55,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:30:55,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 30 transitions. [2020-06-22 09:30:55,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 09:30:55,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 09:30:55,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 30 transitions. [2020-06-22 09:30:55,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:30:55,644 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2020-06-22 09:30:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 30 transitions. [2020-06-22 09:30:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-06-22 09:30:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 09:30:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2020-06-22 09:30:55,646 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2020-06-22 09:30:55,646 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2020-06-22 09:30:55,646 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:30:55,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2020-06-22 09:30:55,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:30:55,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:55,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:55,647 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:55,647 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:30:55,648 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY [138] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 277#L31 [100] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 278#L31-2 [101] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 286#L34-1 [117] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< |v_ULTIMATE.start_main_#t~malloc9.base_2| |v_#StackHeapBarrier_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 287#L39 [139] L39-->L12-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 v_ULTIMATE.start_cstrncpy_~src~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 |v_ULTIMATE.start_cstrncpy_#in~s1.base_2|) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~n_7 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 v_ULTIMATE.start_cstrncpy_~src~0.base_5) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2| v_ULTIMATE.start_main_~nondetArea~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 v_ULTIMATE.start_cstrncpy_~dst~0.offset_6) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 v_ULTIMATE.start_cstrncpy_~dst~0.base_6) (= |v_ULTIMATE.start_cstrncpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= 1 .cse0) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#in~s2.base=|v_ULTIMATE.start_cstrncpy_#in~s2.base_2|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_6, ULTIMATE.start_cstrncpy_#in~s1.base=|v_ULTIMATE.start_cstrncpy_#in~s1.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_6, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_6, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_6, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~s1.offset=v_ULTIMATE.start_cstrncpy_~s1.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_5, ULTIMATE.start_cstrncpy_~s1.base=v_ULTIMATE.start_cstrncpy_~s1.base_4, ULTIMATE.start_cstrncpy_#in~s2.offset=|v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_6, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_7|, ULTIMATE.start_cstrncpy_~s2.base=v_ULTIMATE.start_cstrncpy_~s2.base_3, ULTIMATE.start_cstrncpy_#in~s1.offset=|v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_5, ULTIMATE.start_cstrncpy_~s2.offset=v_ULTIMATE.start_cstrncpy_~s2.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#in~s2.base, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#in~s1.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~s1.offset, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~s1.base, ULTIMATE.start_cstrncpy_#in~s2.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_~s2.base, ULTIMATE.start_cstrncpy_#in~s1.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~s2.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 279#L12-2 [75] L12-2-->L14: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~dst~0.base_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~dst~0.offset_4) (= (+ v_ULTIMATE.start_cstrncpy_~n_4 1) v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~dst~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~src~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1)) (= v_ULTIMATE.start_cstrncpy_~src~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~src~0.base_4) (< 0 v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_4, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_4, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_3, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_3, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 280#L14 [86] L14-->L14-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 294#L14-1 [82] L14-1-->L14-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (= (select |v_#valid_10| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 296#L14-2 [80] L14-2-->L20-3: Formula: (and (= v_ULTIMATE.start_cstrncpy_~us~0.base_3 v_ULTIMATE.start_cstrncpy_~dst~0.base_5) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_3 v_ULTIMATE.start_cstrncpy_~dst~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_5| 0) (= v_ULTIMATE.start_cstrncpy_~n2~0_3 v_ULTIMATE.start_cstrncpy_~n_6)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_5|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_3, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_4|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_5, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_6|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_5|, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_6|, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_5, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#t~post2.offset] 288#L20-3 [67] L20-3-->L20-1: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post4_2| v_ULTIMATE.start_cstrncpy_~n2~0_5) (= v_ULTIMATE.start_cstrncpy_~n2~0_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post4_2| (- 1)))) InVars {ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4] 289#L20-1 [133] L20-1-->L21: Formula: (and (= v_ULTIMATE.start_cstrncpy_~us~0.base_4 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1)) (< 0 |v_ULTIMATE.start_cstrncpy_#t~post4_6|) (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~us~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~us~0.base_5)) InVars {ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_5, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_6|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_5} OutVars{ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_5|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_4, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_~us~0.offset] 283#L21 [2020-06-22 09:30:55,649 INFO L796 eck$LassoCheckResult]: Loop: 283#L21 [143] L21-->L20-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 284#L20-3 [67] L20-3-->L20-1: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post4_2| v_ULTIMATE.start_cstrncpy_~n2~0_5) (= v_ULTIMATE.start_cstrncpy_~n2~0_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post4_2| (- 1)))) InVars {ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4] 295#L20-1 [132] L20-1-->L21: Formula: (and (> 0 |v_ULTIMATE.start_cstrncpy_#t~post4_6|) (= v_ULTIMATE.start_cstrncpy_~us~0.base_4 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1)) (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~us~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~us~0.base_5)) InVars {ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_5, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_6|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_5} OutVars{ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_5|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_4, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_~us~0.offset] 283#L21 [2020-06-22 09:30:55,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:55,649 INFO L82 PathProgramCache]: Analyzing trace with hash -294419861, now seen corresponding path program 1 times [2020-06-22 09:30:55,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:55,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:55,668 INFO L82 PathProgramCache]: Analyzing trace with hash 169423, now seen corresponding path program 2 times [2020-06-22 09:30:55,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:55,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:55,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:55,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash -738720987, now seen corresponding path program 1 times [2020-06-22 09:30:55,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:55,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:55,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:30:55,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:55,701 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 09:30:55,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:30:55,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:30:55,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:55,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:30:55,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:55,746 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 09:30:55,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:30:55,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-06-22 09:30:55,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:30:55,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:30:55,834 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-06-22 09:30:55,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:30:55,884 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. [2020-06-22 09:30:55,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:30:55,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 29 transitions. [2020-06-22 09:30:55,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:30:55,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 29 transitions. [2020-06-22 09:30:55,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 09:30:55,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 09:30:55,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2020-06-22 09:30:55,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:30:55,890 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-06-22 09:30:55,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2020-06-22 09:30:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-06-22 09:30:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:30:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2020-06-22 09:30:55,891 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-06-22 09:30:55,891 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-06-22 09:30:55,891 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:30:55,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2020-06-22 09:30:55,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 09:30:55,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:30:55,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:30:55,893 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:30:55,893 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 09:30:55,894 INFO L794 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY [138] ULTIMATE.startENTRY-->L31: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_5|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_5|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_4, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_9, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_4, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_5|, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_5|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~length~0, ULTIMATE.start_main_#t~ret10.offset] 368#L31 [100] L31-->L31-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 369#L31-2 [101] L31-2-->L34-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 378#L34-1 [117] L34-1-->L39: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc9.offset_2| 0) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8.offset_2|) (> |v_ULTIMATE.start_main_#t~malloc8.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc8.offset_2| 0) (> 0 |v_ULTIMATE.start_main_#t~malloc9.base_2|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc8.base_2| v_ULTIMATE.start_main_~n~0_7) |v_ULTIMATE.start_main_#t~malloc9.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc9.offset_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc8.base_2|) 0) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc8.base_2|) (< |v_ULTIMATE.start_main_#t~malloc9.base_2| |v_#StackHeapBarrier_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc9.base_2|)))) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc8.base=|v_ULTIMATE.start_main_#t~malloc8.base_2|, ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_2|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, ULTIMATE.start_main_#t~malloc8.offset=|v_ULTIMATE.start_main_#t~malloc8.offset_2|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8.base, ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~malloc8.offset, #valid, ULTIMATE.start_main_~nondetArea~0.base, #length, ULTIMATE.start_main_#t~malloc9.offset] 379#L39 [139] L39-->L12-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 v_ULTIMATE.start_cstrncpy_~src~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 |v_ULTIMATE.start_cstrncpy_#in~s1.base_2|) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~n_7 |v_ULTIMATE.start_cstrncpy_#in~n_2|) (= |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_cstrncpy_~s2.base_3 v_ULTIMATE.start_cstrncpy_~src~0.base_5) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_9| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0))) (= |v_ULTIMATE.start_cstrncpy_#in~s1.offset_2| v_ULTIMATE.start_main_~nondetArea~0.offset_5) (= v_ULTIMATE.start_cstrncpy_~s1.offset_4 v_ULTIMATE.start_cstrncpy_~dst~0.offset_6) (= v_ULTIMATE.start_cstrncpy_~s1.base_4 v_ULTIMATE.start_cstrncpy_~dst~0.base_6) (= |v_ULTIMATE.start_cstrncpy_#in~s1.base_2| v_ULTIMATE.start_main_~nondetArea~0.base_5) (<= 1 .cse0) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrncpy_#in~s2.base_2|) (= v_ULTIMATE.start_cstrncpy_~s2.offset_3 |v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrncpy_#in~n_2| v_ULTIMATE.start_main_~n~0_10))) InVars {ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_19|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrncpy_#in~s2.base=|v_ULTIMATE.start_cstrncpy_#in~s2.base_2|, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_8|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_6, ULTIMATE.start_cstrncpy_#in~s1.base=|v_ULTIMATE.start_cstrncpy_#in~s1.base_2|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_6, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_8|, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_6, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_6, ULTIMATE.start_cstrncpy_#res.base=|v_ULTIMATE.start_cstrncpy_#res.base_4|, ULTIMATE.start_cstrncpy_~s1.offset=v_ULTIMATE.start_cstrncpy_~s1.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrncpy_#in~n=|v_ULTIMATE.start_cstrncpy_#in~n_2|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_7, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_7|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_10, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_5, ULTIMATE.start_cstrncpy_~s1.base=v_ULTIMATE.start_cstrncpy_~s1.base_4, ULTIMATE.start_cstrncpy_#in~s2.offset=|v_ULTIMATE.start_cstrncpy_#in~s2.offset_2|, ULTIMATE.start_cstrncpy_#res.offset=|v_ULTIMATE.start_cstrncpy_#res.offset_4|, ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_6, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_7|, ULTIMATE.start_cstrncpy_~s2.base=v_ULTIMATE.start_cstrncpy_~s2.base_3, ULTIMATE.start_cstrncpy_#in~s1.offset=|v_ULTIMATE.start_cstrncpy_#in~s1.offset_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_8|, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_6|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_5, ULTIMATE.start_cstrncpy_~s2.offset=v_ULTIMATE.start_cstrncpy_~s2.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#in~s2.base, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#in~s1.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#res.base, ULTIMATE.start_cstrncpy_~s1.offset, ULTIMATE.start_cstrncpy_#in~n, ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~s1.base, ULTIMATE.start_cstrncpy_#in~s2.offset, ULTIMATE.start_cstrncpy_#res.offset, ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_~s2.base, ULTIMATE.start_cstrncpy_#in~s1.offset, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~s2.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 370#L12-2 [75] L12-2-->L14: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post1.base_2| v_ULTIMATE.start_cstrncpy_~dst~0.base_4) (= |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| v_ULTIMATE.start_cstrncpy_~dst~0.offset_4) (= (+ v_ULTIMATE.start_cstrncpy_~n_4 1) v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~dst~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post1.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| v_ULTIMATE.start_cstrncpy_~src~0.offset_4) (= v_ULTIMATE.start_cstrncpy_~dst~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_2| 1)) (= v_ULTIMATE.start_cstrncpy_~src~0.base_3 |v_ULTIMATE.start_cstrncpy_#t~post2.base_2|) (= |v_ULTIMATE.start_cstrncpy_#t~post2.base_2| v_ULTIMATE.start_cstrncpy_~src~0.base_4) (< 0 v_ULTIMATE.start_cstrncpy_~n_5) (= v_ULTIMATE.start_cstrncpy_~src~0.offset_3 (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_2| 1))) InVars {ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_4, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_4, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_5, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_4} OutVars{ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_4, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_3, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_2|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_2|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_2|, ULTIMATE.start_cstrncpy_~src~0.base=v_ULTIMATE.start_cstrncpy_~src~0.base_3, ULTIMATE.start_cstrncpy_~src~0.offset=v_ULTIMATE.start_cstrncpy_~src~0.offset_3, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_3, ULTIMATE.start_cstrncpy_#t~post0=|v_ULTIMATE.start_cstrncpy_#t~post0_2|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n, ULTIMATE.start_cstrncpy_~dst~0.base, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~src~0.base, ULTIMATE.start_cstrncpy_~src~0.offset, ULTIMATE.start_cstrncpy_~dst~0.offset, ULTIMATE.start_cstrncpy_#t~post0, ULTIMATE.start_cstrncpy_#t~post2.offset] 371#L14 [86] L14-->L14-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_6| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|)) (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_2| (select (select |v_#memory_int_3| |v_ULTIMATE.start_cstrncpy_#t~post2.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|))) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_2|, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~mem3] 383#L14-1 [82] L14-1-->L14-2: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|) (= (select |v_#valid_10| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) 1) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_8| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_cstrncpy_#t~post1.base_3|) |v_ULTIMATE.start_cstrncpy_#t~post1.offset_3| |v_ULTIMATE.start_cstrncpy_#t~mem3_3|)) |v_#memory_int_4|)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} OutVars{ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_3|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_3|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_3|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 384#L14-2 [80] L14-2-->L20-3: Formula: (and (= v_ULTIMATE.start_cstrncpy_~us~0.base_3 v_ULTIMATE.start_cstrncpy_~dst~0.base_5) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_3 v_ULTIMATE.start_cstrncpy_~dst~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~mem3_5| 0) (= v_ULTIMATE.start_cstrncpy_~n2~0_3 v_ULTIMATE.start_cstrncpy_~n_6)) InVars {ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_5|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_5, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_3, ULTIMATE.start_cstrncpy_#t~mem3=|v_ULTIMATE.start_cstrncpy_#t~mem3_4|, ULTIMATE.start_cstrncpy_~n=v_ULTIMATE.start_cstrncpy_~n_6, ULTIMATE.start_cstrncpy_~dst~0.base=v_ULTIMATE.start_cstrncpy_~dst~0.base_5, ULTIMATE.start_cstrncpy_#t~post2.base=|v_ULTIMATE.start_cstrncpy_#t~post2.base_6|, ULTIMATE.start_cstrncpy_#t~post1.offset=|v_ULTIMATE.start_cstrncpy_#t~post1.offset_5|, ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_3, ULTIMATE.start_cstrncpy_#t~post1.base=|v_ULTIMATE.start_cstrncpy_#t~post1.base_6|, ULTIMATE.start_cstrncpy_~dst~0.offset=v_ULTIMATE.start_cstrncpy_~dst~0.offset_5, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_3, ULTIMATE.start_cstrncpy_#t~post2.offset=|v_ULTIMATE.start_cstrncpy_#t~post2.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~mem3, ULTIMATE.start_cstrncpy_#t~post2.base, ULTIMATE.start_cstrncpy_#t~post1.offset, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_#t~post1.base, ULTIMATE.start_cstrncpy_~us~0.offset, ULTIMATE.start_cstrncpy_#t~post2.offset] 375#L20-3 [2020-06-22 09:30:55,894 INFO L796 eck$LassoCheckResult]: Loop: 375#L20-3 [67] L20-3-->L20-1: Formula: (and (= |v_ULTIMATE.start_cstrncpy_#t~post4_2| v_ULTIMATE.start_cstrncpy_~n2~0_5) (= v_ULTIMATE.start_cstrncpy_~n2~0_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post4_2| (- 1)))) InVars {ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_5} OutVars{ULTIMATE.start_cstrncpy_~n2~0=v_ULTIMATE.start_cstrncpy_~n2~0_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_~n2~0, ULTIMATE.start_cstrncpy_#t~post4] 377#L20-1 [133] L20-1-->L21: Formula: (and (= v_ULTIMATE.start_cstrncpy_~us~0.base_4 |v_ULTIMATE.start_cstrncpy_#t~post5.base_2|) (= v_ULTIMATE.start_cstrncpy_~us~0.offset_4 (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| 1)) (< 0 |v_ULTIMATE.start_cstrncpy_#t~post4_6|) (= |v_ULTIMATE.start_cstrncpy_#t~post5.offset_2| v_ULTIMATE.start_cstrncpy_~us~0.offset_5) (= |v_ULTIMATE.start_cstrncpy_#t~post5.base_2| v_ULTIMATE.start_cstrncpy_~us~0.base_5)) InVars {ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_5, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_6|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_5} OutVars{ULTIMATE.start_cstrncpy_~us~0.base=v_ULTIMATE.start_cstrncpy_~us~0.base_4, ULTIMATE.start_cstrncpy_#t~post4=|v_ULTIMATE.start_cstrncpy_#t~post4_5|, ULTIMATE.start_cstrncpy_~us~0.offset=v_ULTIMATE.start_cstrncpy_~us~0.offset_4, ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_2|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post4, ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, ULTIMATE.start_cstrncpy_~us~0.base, ULTIMATE.start_cstrncpy_~us~0.offset] 374#L21 [143] L21-->L20-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|) (= (select |v_#valid_26| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) 1) (= (store |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9| (store (select |v_#memory_int_11| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|) |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 0)) |v_#memory_int_10|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post5.offset_8| 1) (select |v_#length_13| |v_ULTIMATE.start_cstrncpy_#t~post5.base_9|))) InVars {ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_8|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} OutVars{ULTIMATE.start_cstrncpy_#t~post5.offset=|v_ULTIMATE.start_cstrncpy_#t~post5.offset_7|, ULTIMATE.start_cstrncpy_#t~post5.base=|v_ULTIMATE.start_cstrncpy_#t~post5.base_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncpy_#t~post5.offset, ULTIMATE.start_cstrncpy_#t~post5.base, #memory_int] 375#L20-3 [2020-06-22 09:30:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:55,894 INFO L82 PathProgramCache]: Analyzing trace with hash 594106377, now seen corresponding path program 2 times [2020-06-22 09:30:55,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:55,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:55,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:55,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:55,912 INFO L82 PathProgramCache]: Analyzing trace with hash 98444, now seen corresponding path program 1 times [2020-06-22 09:30:55,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:55,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:55,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:30:55,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:55,919 INFO L82 PathProgramCache]: Analyzing trace with hash -537080956, now seen corresponding path program 1 times [2020-06-22 09:30:55,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:30:55,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:30:55,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:30:55,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:30:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:56,478 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 123 [2020-06-22 09:30:56,659 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-06-22 09:30:56,661 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:30:56,661 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:30:56,661 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:30:56,662 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:30:56,662 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:30:56,662 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:30:56,662 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:30:56,662 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:30:56,662 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 09:30:56,662 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:30:56,662 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:30:56,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 09:30:56,675 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 09:30:56,678 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 09:30:56,680 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 09:30:56,681 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 09:30:56,683 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 09:30:56,684 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 09:30:56,686 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 09:30:56,687 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 09:30:56,690 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 09:30:56,691 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 09:30:56,693 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 09:30:56,694 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 09:30:56,696 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 09:30:56,697 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 09:30:56,699 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 09:30:56,700 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 09:30:56,702 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 09:30:56,704 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 09:30:56,706 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 09:30:57,050 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2020-06-22 09:30:57,326 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2020-06-22 09:30:57,625 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-06-22 09:30:57,777 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:30:57,777 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:30:57,778 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 09:30:57,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:57,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:57,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,783 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 09:30:57,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:57,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:57,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,786 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 09:30:57,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,788 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 09:30:57,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,790 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 09:30:57,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,791 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 09:30:57,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,793 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 09:30:57,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,795 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 09:30:57,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,797 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 09:30:57,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:57,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:57,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,800 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 09:30:57,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,802 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 09:30:57,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,804 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 09:30:57,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,806 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 09:30:57,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,808 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 09:30:57,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,810 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 09:30:57,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,812 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 09:30:57,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,814 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 09:30:57,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,816 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 09:30:57,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,818 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 09:30:57,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:30:57,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:30:57,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:30:57,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:30:57,820 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 09:30:57,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:30:57,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:30:57,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:30:57,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:30:57,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:30:57,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:30:57,852 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:30:57,877 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-06-22 09:30:57,878 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2020-06-22 09:30:57,878 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:30:57,897 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:30:57,897 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:30:57,898 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncpy_~dst~0.base)_2, ULTIMATE.start_cstrncpy_~us~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncpy_~dst~0.base)_2 - 1*ULTIMATE.start_cstrncpy_~us~0.offset Supporting invariants [] [2020-06-22 09:30:57,965 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2020-06-22 09:30:57,967 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:57,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:30:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:58,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:30:58,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:30:58,019 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 09:30:58,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:30:58,036 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 09:30:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:30:58,089 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 09:30:58,089 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 6 predicates after loop cannibalization [2020-06-22 09:30:58,090 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2020-06-22 09:30:58,090 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 27 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-06-22 09:30:58,148 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 27 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 21 states and 31 transitions. Complement of second has 6 states. [2020-06-22 09:30:58,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 09:30:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 09:30:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2020-06-22 09:30:58,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 3 letters. [2020-06-22 09:30:58,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:58,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 3 letters. [2020-06-22 09:30:58,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:58,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 6 letters. [2020-06-22 09:30:58,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:30:58,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 31 transitions. [2020-06-22 09:30:58,154 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:30:58,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2020-06-22 09:30:58,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:30:58,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:30:58,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:30:58,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:30:58,155 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:30:58,155 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:30:58,155 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:30:58,155 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 09:30:58,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:30:58,155 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:30:58,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:30:58,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:30:58 BasicIcfg [2020-06-22 09:30:58,161 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:30:58,162 INFO L168 Benchmark]: Toolchain (without parser) took 14542.90 ms. Allocated memory was 514.9 MB in the beginning and 772.3 MB in the end (delta: 257.4 MB). Free memory was 437.3 MB in the beginning and 685.7 MB in the end (delta: -248.4 MB). Peak memory consumption was 9.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:58,163 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 457.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:30:58,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.62 ms. Allocated memory was 514.9 MB in the beginning and 582.5 MB in the end (delta: 67.6 MB). Free memory was 436.6 MB in the beginning and 551.6 MB in the end (delta: -115.0 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:58,163 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.64 ms. Allocated memory is still 582.5 MB. Free memory was 551.6 MB in the beginning and 549.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:58,164 INFO L168 Benchmark]: Boogie Preprocessor took 25.59 ms. Allocated memory is still 582.5 MB. Free memory was 549.9 MB in the beginning and 548.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:58,164 INFO L168 Benchmark]: RCFGBuilder took 306.02 ms. Allocated memory is still 582.5 MB. Free memory was 548.2 MB in the beginning and 528.1 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:58,165 INFO L168 Benchmark]: BlockEncodingV2 took 119.86 ms. Allocated memory is still 582.5 MB. Free memory was 528.1 MB in the beginning and 519.6 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:58,165 INFO L168 Benchmark]: TraceAbstraction took 8523.94 ms. Allocated memory was 582.5 MB in the beginning and 712.5 MB in the end (delta: 130.0 MB). Free memory was 518.8 MB in the beginning and 612.3 MB in the end (delta: -93.6 MB). Peak memory consumption was 205.9 MB. Max. memory is 50.3 GB. [2020-06-22 09:30:58,166 INFO L168 Benchmark]: BuchiAutomizer took 5222.29 ms. Allocated memory was 712.5 MB in the beginning and 772.3 MB in the end (delta: 59.8 MB). Free memory was 612.3 MB in the beginning and 685.7 MB in the end (delta: -73.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:30:58,170 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 28 locations, 34 edges - StatisticsResult: Encoded RCFG 20 locations, 36 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 457.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 299.62 ms. Allocated memory was 514.9 MB in the beginning and 582.5 MB in the end (delta: 67.6 MB). Free memory was 436.6 MB in the beginning and 551.6 MB in the end (delta: -115.0 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.64 ms. Allocated memory is still 582.5 MB. Free memory was 551.6 MB in the beginning and 549.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.59 ms. Allocated memory is still 582.5 MB. Free memory was 549.9 MB in the beginning and 548.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 306.02 ms. Allocated memory is still 582.5 MB. Free memory was 548.2 MB in the beginning and 528.1 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 119.86 ms. Allocated memory is still 582.5 MB. Free memory was 528.1 MB in the beginning and 519.6 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 8523.94 ms. Allocated memory was 582.5 MB in the beginning and 712.5 MB in the end (delta: 130.0 MB). Free memory was 518.8 MB in the beginning and 612.3 MB in the end (delta: -93.6 MB). Peak memory consumption was 205.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5222.29 ms. Allocated memory was 712.5 MB in the beginning and 772.3 MB in the end (delta: 59.8 MB). Free memory was 612.3 MB in the beginning and 685.7 MB in the end (delta: -73.3 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_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 39]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 39]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-06-22 09:30:58,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:58,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:58,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:58,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:58,183 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,184 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:58,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:58,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,185 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,186 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:58,187 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:58,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:58,189 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString~0.offset,QUANTIFIED] [2020-06-22 09:30:58,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,190 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:58,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:58,192 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:58,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,193 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,194 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 09:30:58,195 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((nondetString == 0 && 1 <= length) && n == unknown-#length-unknown[nondetArea]) && n <= 0) && nondetArea == 0) && \valid[nondetArea] == 1) && length == unknown-#length-unknown[nondetString]) && \valid[nondetString] == 1) && 1 <= n) && 1 == \valid[dst]) && n <= 1) && 1 == \valid[src]) || (((((((((((((((((!(nondetString == nondetArea) && 1 <= length) && n == unknown-#length-unknown[nondetArea]) && 0 == dst) && nondetArea == 0) && \valid[nondetArea] == 1) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#length-unknown[src]) && 1 <= n) && n <= unknown-#length-unknown[dst]) && nondetString == 0) && unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1] == 0) && 1 <= unknown-#length-unknown[dst]) && \valid[nondetString] == 1) && 1 == \valid[dst]) && src == 0) && !(src == dst)) && 1 == \valid[src])) || (((((((((((((((((1 <= dst && !(nondetString == nondetArea)) && 1 <= length) && n == unknown-#length-unknown[nondetArea]) && nondetArea == 0) && src + 1 <= unknown-#length-unknown[src]) && \valid[nondetArea] == 1) && length == unknown-#length-unknown[nondetString]) && 0 <= n) && 1 <= n) && nondetString == 0) && unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1] == 0) && \valid[nondetString] == 1) && 1 == \valid[dst]) && n + dst <= unknown-#length-unknown[dst]) && !(src == dst)) && 1 <= src) && 1 == \valid[src])) || (((\exists ULTIMATE.start_main_~nondetString~0.offset : int :: (0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + ULTIMATE.start_main_~nondetString~0.offset + -1] && ULTIMATE.start_main_~nondetString~0.offset <= 0) && src <= ULTIMATE.start_main_~nondetString~0.offset) && n <= unknown-#length-unknown[dst]) && (((((((((((((((1 <= length && n == unknown-#length-unknown[nondetArea]) && 0 == dst) && nondetArea == 0) && \valid[nondetArea] == 1) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#length-unknown[src]) && 1 <= n) && n <= 1) && nondetString == 0) && \valid[nondetString] == 1) && 1 == \valid[dst]) && src == 0) && n <= 1) && 1 == \valid[src]) || ((((((((((((((n == unknown-#length-unknown[nondetArea] && 0 == dst) && nondetArea == 0) && \valid[nondetArea] == 1) && length == unknown-#length-unknown[nondetString]) && 1 <= unknown-#length-unknown[src]) && 0 == unknown-#memory_int-unknown[src][src]) && 1 <= n) && length + nondetString == 1) && nondetString == 0) && 1 <= unknown-#length-unknown[dst]) && \valid[nondetString] == 1) && 1 == \valid[dst]) && src == 0) && 1 == \valid[src]))) - InvariantResult [Line: 20]: Loop Invariant [2020-06-22 09:30:58,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,196 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,197 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,198 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:30:58,199 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((n2 <= 0 && n <= 0) && (((((((nondetString == 0 && 1 <= length) && n == unknown-#length-unknown[nondetArea]) && nondetArea == 0) && \valid[nondetArea] == 1) && \valid[nondetString] == 1) && 1 <= n) && 1 == \valid[dst]) && 1 == \valid[src]) && length == unknown-#length-unknown[nondetString]) && 0 <= n) && 0 <= n2) && n <= 1) && 1 <= src) || (((((((((1 <= dst && 1 <= us) && (((((((nondetString == 0 && 1 <= length) && n == unknown-#length-unknown[nondetArea]) && nondetArea == 0) && \valid[nondetArea] == 1) && \valid[nondetString] == 1) && 1 <= n) && 1 == \valid[dst]) && 1 == \valid[src]) && length == unknown-#length-unknown[nondetString]) && 0 <= n) && \valid[us] == 1) && n + dst <= unknown-#length-unknown[dst]) && 1 <= src) && 0 <= n2) && us + n2 <= unknown-#length-unknown[us]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 8 error locations. SAFE Result, 8.4s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 113 SDtfs, 736 SDslu, 903 SDs, 0 SdLazy, 1971 SolverSat, 291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=12, 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, 21 MinimizatonAttempts, 43 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 14 NumberOfFragments, 515 HoareAnnotationTreeSize, 2 FomulaSimplifications, 679 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 3073 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 281 ConstructedInterpolants, 2 QuantifiedInterpolants, 18968 SizeOfPredicates, 70 NumberOfNonLiveVariables, 890 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 11/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(n * sizeof(char))] + -1 * src and consists of 9 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[dst] + -1 * us and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 39 SDtfs, 333 SDslu, 160 SDs, 0 SdLazy, 287 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax100 hnf100 lsp96 ukn87 mio100 lsp51 div100 bol100 ite100 ukn100 eq194 hnf88 smp97 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 09:30:40.333 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:30:58.429 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check