YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 08:48:56,336 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 08:48:56,338 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 08:48:56,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 08:48:56,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 08:48:56,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 08:48:56,352 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 08:48:56,353 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 08:48:56,355 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 08:48:56,355 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 08:48:56,356 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 08:48:56,356 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 08:48:56,357 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 08:48:56,358 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 08:48:56,359 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 08:48:56,360 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 08:48:56,360 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 08:48:56,362 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 08:48:56,364 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 08:48:56,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 08:48:56,366 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 08:48:56,367 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 08:48:56,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 08:48:56,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 08:48:56,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 08:48:56,371 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 08:48:56,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 08:48:56,372 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 08:48:56,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 08:48:56,373 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 08:48:56,374 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 08:48:56,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 08:48:56,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 08:48:56,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 08:48:56,376 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 08:48:56,376 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 08:48:56,376 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 08:48:56,377 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 08:48:56,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 08:48:56,378 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 08:48:56,392 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 08:48:56,393 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 08:48:56,394 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 08:48:56,394 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 08:48:56,394 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 08:48:56,394 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:48:56,394 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 08:48:56,395 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 08:48:56,395 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 08:48:56,395 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 08:48:56,395 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 08:48:56,395 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 08:48:56,395 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 08:48:56,396 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 08:48:56,396 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:48:56,396 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 08:48:56,396 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 08:48:56,396 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 08:48:56,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 08:48:56,397 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 08:48:56,397 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 08:48:56,397 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 08:48:56,397 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 08:48:56,397 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 08:48:56,397 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:48:56,398 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 08:48:56,398 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 08:48:56,398 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 08:48:56,398 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 08:48:56,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 08:48:56,437 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 08:48:56,440 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 08:48:56,442 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 08:48:56,442 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 08:48:56,443 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:48:56,499 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/641a12502f1f4178a41d928e6e09eed8/FLAG01b2bf2e6 [2020-06-22 08:48:56,846 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 08:48:56,847 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:48:56,847 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 08:48:56,854 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/641a12502f1f4178a41d928e6e09eed8/FLAG01b2bf2e6 [2020-06-22 08:48:57,252 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/641a12502f1f4178a41d928e6e09eed8 [2020-06-22 08:48:57,263 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 08:48:57,265 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 08:48:57,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 08:48:57,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 08:48:57,269 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 08:48:57,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:48:57" (1/1) ... [2020-06-22 08:48:57,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0086db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57, skipping insertion in model container [2020-06-22 08:48:57,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:48:57" (1/1) ... [2020-06-22 08:48:57,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 08:48:57,301 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 08:48:57,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:48:57,533 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 08:48:57,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:48:57,570 INFO L195 MainTranslator]: Completed translation [2020-06-22 08:48:57,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57 WrapperNode [2020-06-22 08:48:57,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 08:48:57,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 08:48:57,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 08:48:57,571 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 08:48:57,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57" (1/1) ... [2020-06-22 08:48:57,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57" (1/1) ... [2020-06-22 08:48:57,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 08:48:57,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 08:48:57,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 08:48:57,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 08:48:57,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57" (1/1) ... [2020-06-22 08:48:57,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57" (1/1) ... [2020-06-22 08:48:57,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57" (1/1) ... [2020-06-22 08:48:57,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57" (1/1) ... [2020-06-22 08:48:57,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57" (1/1) ... [2020-06-22 08:48:57,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57" (1/1) ... [2020-06-22 08:48:57,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57" (1/1) ... [2020-06-22 08:48:57,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 08:48:57,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 08:48:57,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 08:48:57,639 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 08:48:57,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:48:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 08:48:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 08:48:57,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 08:48:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 08:48:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 08:48:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 08:48:57,982 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 08:48:57,983 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 08:48:57,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:48:57 BoogieIcfgContainer [2020-06-22 08:48:57,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 08:48:57,985 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 08:48:57,985 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 08:48:57,987 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 08:48:57,988 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:48:57" (1/1) ... [2020-06-22 08:48:58,006 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 51 edges [2020-06-22 08:48:58,008 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 08:48:58,009 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 08:48:58,009 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 08:48:58,010 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:48:58,014 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 08:48:58,015 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 08:48:58,015 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 08:48:58,041 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 08:48:58,074 INFO L200 BlockEncoder]: SBE split 21 edges [2020-06-22 08:48:58,079 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 08:48:58,080 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:48:58,109 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-06-22 08:48:58,112 INFO L70 RemoveSinkStates]: Removed 8 edges and 4 locations by removing sink states [2020-06-22 08:48:58,113 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:48:58,113 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:48:58,113 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 08:48:58,114 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:48:58,114 INFO L313 BlockEncoder]: Encoded RCFG 33 locations, 62 edges [2020-06-22 08:48:58,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:48:58 BasicIcfg [2020-06-22 08:48:58,115 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 08:48:58,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 08:48:58,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 08:48:58,119 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 08:48:58,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 08:48:57" (1/4) ... [2020-06-22 08:48:58,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1937984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:48:58, skipping insertion in model container [2020-06-22 08:48:58,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57" (2/4) ... [2020-06-22 08:48:58,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1937984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:48:58, skipping insertion in model container [2020-06-22 08:48:58,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:48:57" (3/4) ... [2020-06-22 08:48:58,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1937984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:48:58, skipping insertion in model container [2020-06-22 08:48:58,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:48:58" (4/4) ... [2020-06-22 08:48:58,123 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:48:58,133 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 08:48:58,141 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-06-22 08:48:58,157 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-06-22 08:48:58,186 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:48:58,187 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 08:48:58,187 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 08:48:58,187 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:48:58,187 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:48:58,187 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:48:58,187 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 08:48:58,187 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:48:58,188 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 08:48:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-06-22 08:48:58,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:48:58,208 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:48:58,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:48:58,210 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:48:58,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:48:58,215 INFO L82 PathProgramCache]: Analyzing trace with hash 225676850, now seen corresponding path program 1 times [2020-06-22 08:48:58,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:48:58,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:48:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:58,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:48:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:48:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:48:58,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:48:58,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:48:58,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:48:58,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:48:58,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:48:58,416 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-06-22 08:48:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:48:58,558 INFO L93 Difference]: Finished difference Result 33 states and 62 transitions. [2020-06-22 08:48:58,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:48:58,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 08:48:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:48:58,573 INFO L225 Difference]: With dead ends: 33 [2020-06-22 08:48:58,573 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 08:48:58,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:48:58,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 08:48:58,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 08:48:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 08:48:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 60 transitions. [2020-06-22 08:48:58,619 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 60 transitions. Word has length 5 [2020-06-22 08:48:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:48:58,620 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 60 transitions. [2020-06-22 08:48:58,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:48:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 60 transitions. [2020-06-22 08:48:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:48:58,621 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:48:58,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:48:58,621 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:48:58,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:48:58,622 INFO L82 PathProgramCache]: Analyzing trace with hash 225676852, now seen corresponding path program 1 times [2020-06-22 08:48:58,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:48:58,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:48:58,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:58,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:48:58,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:48:58,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 08:48:58,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:48:58,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:48:58,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:48:58,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:48:58,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:48:58,676 INFO L87 Difference]: Start difference. First operand 32 states and 60 transitions. Second operand 3 states. [2020-06-22 08:48:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:48:58,758 INFO L93 Difference]: Finished difference Result 33 states and 60 transitions. [2020-06-22 08:48:58,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:48:58,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 08:48:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:48:58,760 INFO L225 Difference]: With dead ends: 33 [2020-06-22 08:48:58,760 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 08:48:58,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:48:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 08:48:58,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 08:48:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 08:48:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2020-06-22 08:48:58,766 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 59 transitions. Word has length 5 [2020-06-22 08:48:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:48:58,766 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 59 transitions. [2020-06-22 08:48:58,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:48:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 59 transitions. [2020-06-22 08:48:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:48:58,767 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:48:58,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:48:58,767 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:48:58,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:48:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash 225676853, now seen corresponding path program 1 times [2020-06-22 08:48:58,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:48:58,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:48:58,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:58,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:48:58,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:48:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:48:58,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:48:58,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:48:58,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:48:58,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:48:58,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:48:58,801 INFO L87 Difference]: Start difference. First operand 32 states and 59 transitions. Second operand 4 states. [2020-06-22 08:48:58,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:48:58,907 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2020-06-22 08:48:58,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:48:58,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 08:48:58,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:48:58,908 INFO L225 Difference]: With dead ends: 32 [2020-06-22 08:48:58,908 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 08:48:58,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:48:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 08:48:58,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 08:48:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 08:48:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 58 transitions. [2020-06-22 08:48:58,913 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 58 transitions. Word has length 5 [2020-06-22 08:48:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:48:58,914 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 58 transitions. [2020-06-22 08:48:58,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:48:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 58 transitions. [2020-06-22 08:48:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 08:48:58,914 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:48:58,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:48:58,915 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:48:58,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:48:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1593954334, now seen corresponding path program 1 times [2020-06-22 08:48:58,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:48:58,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:48:58,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:58,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:48:58,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:48:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:48:58,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:48:58,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:48:58,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:48:58,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:48:58,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:48:58,944 INFO L87 Difference]: Start difference. First operand 31 states and 58 transitions. Second operand 3 states. [2020-06-22 08:48:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:48:59,019 INFO L93 Difference]: Finished difference Result 31 states and 58 transitions. [2020-06-22 08:48:59,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:48:59,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 08:48:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:48:59,020 INFO L225 Difference]: With dead ends: 31 [2020-06-22 08:48:59,021 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 08:48:59,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:48:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 08:48:59,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 08:48:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 08:48:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 56 transitions. [2020-06-22 08:48:59,025 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 56 transitions. Word has length 6 [2020-06-22 08:48:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:48:59,026 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 56 transitions. [2020-06-22 08:48:59,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:48:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 56 transitions. [2020-06-22 08:48:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 08:48:59,027 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:48:59,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:48:59,027 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:48:59,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:48:59,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1593954332, now seen corresponding path program 1 times [2020-06-22 08:48:59,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:48:59,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:48:59,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:48:59,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:48:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:48:59,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:48:59,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:48:59,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:48:59,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:48:59,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:48:59,067 INFO L87 Difference]: Start difference. First operand 30 states and 56 transitions. Second operand 3 states. [2020-06-22 08:48:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:48:59,178 INFO L93 Difference]: Finished difference Result 31 states and 56 transitions. [2020-06-22 08:48:59,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:48:59,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 08:48:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:48:59,180 INFO L225 Difference]: With dead ends: 31 [2020-06-22 08:48:59,180 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 08:48:59,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:48:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 08:48:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 08:48:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 08:48:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 55 transitions. [2020-06-22 08:48:59,185 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 55 transitions. Word has length 6 [2020-06-22 08:48:59,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:48:59,186 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 55 transitions. [2020-06-22 08:48:59,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:48:59,186 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 55 transitions. [2020-06-22 08:48:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 08:48:59,186 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:48:59,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:48:59,186 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:48:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:48:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1593954331, now seen corresponding path program 1 times [2020-06-22 08:48:59,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:48:59,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:48:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:48:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:48:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:48:59,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:48:59,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:48:59,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:48:59,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:48:59,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:48:59,223 INFO L87 Difference]: Start difference. First operand 30 states and 55 transitions. Second operand 4 states. [2020-06-22 08:48:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:48:59,288 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2020-06-22 08:48:59,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:48:59,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 08:48:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:48:59,290 INFO L225 Difference]: With dead ends: 30 [2020-06-22 08:48:59,290 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 08:48:59,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:48:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 08:48:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 08:48:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 08:48:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 54 transitions. [2020-06-22 08:48:59,294 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 54 transitions. Word has length 6 [2020-06-22 08:48:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:48:59,295 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 54 transitions. [2020-06-22 08:48:59,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:48:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 54 transitions. [2020-06-22 08:48:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 08:48:59,295 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:48:59,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:48:59,296 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:48:59,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:48:59,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1757036471, now seen corresponding path program 1 times [2020-06-22 08:48:59,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:48:59,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:48:59,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:48:59,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:48:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:48:59,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:48:59,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:48:59,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:48:59,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:48:59,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:48:59,329 INFO L87 Difference]: Start difference. First operand 29 states and 54 transitions. Second operand 3 states. [2020-06-22 08:48:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:48:59,433 INFO L93 Difference]: Finished difference Result 58 states and 108 transitions. [2020-06-22 08:48:59,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:48:59,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-06-22 08:48:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:48:59,453 INFO L225 Difference]: With dead ends: 58 [2020-06-22 08:48:59,453 INFO L226 Difference]: Without dead ends: 36 [2020-06-22 08:48:59,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:48:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-06-22 08:48:59,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2020-06-22 08:48:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 08:48:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 66 transitions. [2020-06-22 08:48:59,459 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 66 transitions. Word has length 10 [2020-06-22 08:48:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:48:59,460 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 66 transitions. [2020-06-22 08:48:59,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:48:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 66 transitions. [2020-06-22 08:48:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 08:48:59,461 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:48:59,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:48:59,461 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:48:59,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:48:59,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1757035510, now seen corresponding path program 1 times [2020-06-22 08:48:59,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:48:59,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:48:59,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:48:59,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:48:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:48:59,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:48:59,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:48:59,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:48:59,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:48:59,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:48:59,500 INFO L87 Difference]: Start difference. First operand 34 states and 66 transitions. Second operand 4 states. [2020-06-22 08:48:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:48:59,586 INFO L93 Difference]: Finished difference Result 34 states and 66 transitions. [2020-06-22 08:48:59,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:48:59,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-06-22 08:48:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:48:59,587 INFO L225 Difference]: With dead ends: 34 [2020-06-22 08:48:59,587 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 08:48:59,588 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 08:48:59,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 08:48:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-06-22 08:48:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 08:48:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 58 transitions. [2020-06-22 08:48:59,592 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 58 transitions. Word has length 10 [2020-06-22 08:48:59,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:48:59,592 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 58 transitions. [2020-06-22 08:48:59,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:48:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 58 transitions. [2020-06-22 08:48:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 08:48:59,593 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:48:59,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:48:59,594 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:48:59,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:48:59,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1757035508, now seen corresponding path program 1 times [2020-06-22 08:48:59,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:48:59,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:48:59,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:48:59,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:48:59,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:48:59,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:48:59,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:48:59,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:48:59,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:48:59,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:48:59,632 INFO L87 Difference]: Start difference. First operand 31 states and 58 transitions. Second operand 4 states. [2020-06-22 08:48:59,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:48:59,733 INFO L93 Difference]: Finished difference Result 58 states and 103 transitions. [2020-06-22 08:48:59,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:48:59,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-06-22 08:48:59,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:48:59,735 INFO L225 Difference]: With dead ends: 58 [2020-06-22 08:48:59,735 INFO L226 Difference]: Without dead ends: 55 [2020-06-22 08:48:59,735 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 08:48:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-06-22 08:48:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2020-06-22 08:48:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-06-22 08:48:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 87 transitions. [2020-06-22 08:48:59,742 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 87 transitions. Word has length 10 [2020-06-22 08:48:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:48:59,742 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 87 transitions. [2020-06-22 08:48:59,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:48:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 87 transitions. [2020-06-22 08:48:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 08:48:59,743 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:48:59,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:48:59,743 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:48:59,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:48:59,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1757035507, now seen corresponding path program 1 times [2020-06-22 08:48:59,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:48:59,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:48:59,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:48:59,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:48:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:48:59,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:48:59,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 08:48:59,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 08:48:59,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 08:48:59,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:48:59,808 INFO L87 Difference]: Start difference. First operand 43 states and 87 transitions. Second operand 6 states. [2020-06-22 08:48:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:48:59,939 INFO L93 Difference]: Finished difference Result 55 states and 99 transitions. [2020-06-22 08:48:59,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:48:59,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-06-22 08:48:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:48:59,940 INFO L225 Difference]: With dead ends: 55 [2020-06-22 08:48:59,940 INFO L226 Difference]: Without dead ends: 52 [2020-06-22 08:48:59,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:48:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-06-22 08:48:59,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2020-06-22 08:48:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-06-22 08:48:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 83 transitions. [2020-06-22 08:48:59,946 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 83 transitions. Word has length 10 [2020-06-22 08:48:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:48:59,946 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 83 transitions. [2020-06-22 08:48:59,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 08:48:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 83 transitions. [2020-06-22 08:48:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 08:48:59,947 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:48:59,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:48:59,947 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:48:59,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:48:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1366471907, now seen corresponding path program 1 times [2020-06-22 08:48:59,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:48:59,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:48:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:48:59,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:48:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:48:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:48:59,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:48:59,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:48:59,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:48:59,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:48:59,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:48:59,993 INFO L87 Difference]: Start difference. First operand 43 states and 83 transitions. Second operand 3 states. [2020-06-22 08:49:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:00,045 INFO L93 Difference]: Finished difference Result 43 states and 83 transitions. [2020-06-22 08:49:00,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:00,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-06-22 08:49:00,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:00,046 INFO L225 Difference]: With dead ends: 43 [2020-06-22 08:49:00,047 INFO L226 Difference]: Without dead ends: 41 [2020-06-22 08:49:00,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-06-22 08:49:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-06-22 08:49:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 08:49:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 77 transitions. [2020-06-22 08:49:00,052 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 77 transitions. Word has length 11 [2020-06-22 08:49:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:00,052 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 77 transitions. [2020-06-22 08:49:00,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:49:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 77 transitions. [2020-06-22 08:49:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 08:49:00,053 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:00,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:00,053 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:00,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:00,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1366471909, now seen corresponding path program 1 times [2020-06-22 08:49:00,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:00,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:00,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:00,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:00,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:00,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:49:00,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:49:00,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:49:00,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:49:00,105 INFO L87 Difference]: Start difference. First operand 41 states and 77 transitions. Second operand 5 states. [2020-06-22 08:49:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:00,205 INFO L93 Difference]: Finished difference Result 48 states and 87 transitions. [2020-06-22 08:49:00,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:49:00,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-06-22 08:49:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:00,207 INFO L225 Difference]: With dead ends: 48 [2020-06-22 08:49:00,207 INFO L226 Difference]: Without dead ends: 44 [2020-06-22 08:49:00,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:49:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-06-22 08:49:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-06-22 08:49:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 08:49:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions. [2020-06-22 08:49:00,213 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 73 transitions. Word has length 11 [2020-06-22 08:49:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:00,214 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 73 transitions. [2020-06-22 08:49:00,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:49:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 73 transitions. [2020-06-22 08:49:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 08:49:00,214 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:00,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:00,215 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:00,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:00,215 INFO L82 PathProgramCache]: Analyzing trace with hash -172792944, now seen corresponding path program 1 times [2020-06-22 08:49:00,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:00,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:00,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:00,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:00,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:00,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:49:00,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:49:00,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:00,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:00,240 INFO L87 Difference]: Start difference. First operand 40 states and 73 transitions. Second operand 3 states. [2020-06-22 08:49:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:00,310 INFO L93 Difference]: Finished difference Result 71 states and 134 transitions. [2020-06-22 08:49:00,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:00,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-06-22 08:49:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:00,311 INFO L225 Difference]: With dead ends: 71 [2020-06-22 08:49:00,311 INFO L226 Difference]: Without dead ends: 44 [2020-06-22 08:49:00,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-06-22 08:49:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-06-22 08:49:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-06-22 08:49:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2020-06-22 08:49:00,316 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 15 [2020-06-22 08:49:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:00,316 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2020-06-22 08:49:00,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:49:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2020-06-22 08:49:00,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 08:49:00,317 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:00,318 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:00,318 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:00,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:00,318 INFO L82 PathProgramCache]: Analyzing trace with hash -108148816, now seen corresponding path program 1 times [2020-06-22 08:49:00,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:00,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:00,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:00,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:00,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:00,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:49:00,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:49:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:00,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:00,351 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand 3 states. [2020-06-22 08:49:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:00,409 INFO L93 Difference]: Finished difference Result 76 states and 140 transitions. [2020-06-22 08:49:00,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:00,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-06-22 08:49:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:00,410 INFO L225 Difference]: With dead ends: 76 [2020-06-22 08:49:00,410 INFO L226 Difference]: Without dead ends: 42 [2020-06-22 08:49:00,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-06-22 08:49:00,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-06-22 08:49:00,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 08:49:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 68 transitions. [2020-06-22 08:49:00,415 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 68 transitions. Word has length 15 [2020-06-22 08:49:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:00,415 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 68 transitions. [2020-06-22 08:49:00,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:49:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 68 transitions. [2020-06-22 08:49:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 08:49:00,416 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:00,416 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:00,416 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:00,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:00,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1482178365, now seen corresponding path program 1 times [2020-06-22 08:49:00,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:00,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:00,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:00,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:00,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:00,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:49:00,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:49:00,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:00,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:00,441 INFO L87 Difference]: Start difference. First operand 41 states and 68 transitions. Second operand 3 states. [2020-06-22 08:49:00,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:00,494 INFO L93 Difference]: Finished difference Result 73 states and 119 transitions. [2020-06-22 08:49:00,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:00,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-06-22 08:49:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:00,496 INFO L225 Difference]: With dead ends: 73 [2020-06-22 08:49:00,496 INFO L226 Difference]: Without dead ends: 47 [2020-06-22 08:49:00,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-06-22 08:49:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2020-06-22 08:49:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 08:49:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2020-06-22 08:49:00,500 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 18 [2020-06-22 08:49:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:00,501 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2020-06-22 08:49:00,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:49:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2020-06-22 08:49:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 08:49:00,501 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:00,502 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:00,502 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:00,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:00,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1453549214, now seen corresponding path program 1 times [2020-06-22 08:49:00,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:00,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:00,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:00,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:00,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:00,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:49:00,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:49:00,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:00,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:00,528 INFO L87 Difference]: Start difference. First operand 41 states and 66 transitions. Second operand 3 states. [2020-06-22 08:49:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:00,577 INFO L93 Difference]: Finished difference Result 67 states and 108 transitions. [2020-06-22 08:49:00,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:00,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-06-22 08:49:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:00,578 INFO L225 Difference]: With dead ends: 67 [2020-06-22 08:49:00,578 INFO L226 Difference]: Without dead ends: 43 [2020-06-22 08:49:00,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:00,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-06-22 08:49:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2020-06-22 08:49:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-06-22 08:49:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-06-22 08:49:00,583 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 18 [2020-06-22 08:49:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:00,583 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-06-22 08:49:00,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:49:00,583 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-06-22 08:49:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-06-22 08:49:00,584 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:00,584 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:00,584 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:00,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1424920063, now seen corresponding path program 1 times [2020-06-22 08:49:00,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:00,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:00,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:00,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:00,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:00,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:49:00,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:49:00,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:00,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:00,614 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand 3 states. [2020-06-22 08:49:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:00,681 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2020-06-22 08:49:00,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:00,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-06-22 08:49:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:00,682 INFO L225 Difference]: With dead ends: 62 [2020-06-22 08:49:00,682 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 08:49:00,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 08:49:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-06-22 08:49:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 08:49:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2020-06-22 08:49:00,685 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 18 [2020-06-22 08:49:00,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:00,686 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2020-06-22 08:49:00,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:49:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2020-06-22 08:49:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 08:49:00,686 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:00,687 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:00,687 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:00,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:00,687 INFO L82 PathProgramCache]: Analyzing trace with hash 34073244, now seen corresponding path program 1 times [2020-06-22 08:49:00,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:00,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:00,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:00,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:00,728 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 08:49:00,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:49:00,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:49:00,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:00,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 08:49:00,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:00,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 08:49:00,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 08:49:00,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 08:49:00,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 08:49:00,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:49:00,837 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand 6 states. [2020-06-22 08:49:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:00,932 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-06-22 08:49:00,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:49:00,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-06-22 08:49:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:00,933 INFO L225 Difference]: With dead ends: 38 [2020-06-22 08:49:00,933 INFO L226 Difference]: Without dead ends: 35 [2020-06-22 08:49:00,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:49:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-06-22 08:49:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2020-06-22 08:49:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 08:49:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2020-06-22 08:49:00,937 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2020-06-22 08:49:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:00,937 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-06-22 08:49:00,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 08:49:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2020-06-22 08:49:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 08:49:00,938 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:00,938 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:00,938 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:00,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:00,938 INFO L82 PathProgramCache]: Analyzing trace with hash 34073245, now seen corresponding path program 1 times [2020-06-22 08:49:00,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:00,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:00,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:00,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:01,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:01,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-06-22 08:49:01,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 08:49:01,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 08:49:01,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 08:49:01,069 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 9 states. [2020-06-22 08:49:01,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:01,328 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2020-06-22 08:49:01,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 08:49:01,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-06-22 08:49:01,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:01,329 INFO L225 Difference]: With dead ends: 64 [2020-06-22 08:49:01,329 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 08:49:01,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-06-22 08:49:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 08:49:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-06-22 08:49:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 08:49:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2020-06-22 08:49:01,333 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 20 [2020-06-22 08:49:01,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:01,333 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-06-22 08:49:01,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 08:49:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2020-06-22 08:49:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 08:49:01,334 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:01,334 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:01,334 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:01,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:01,334 INFO L82 PathProgramCache]: Analyzing trace with hash 954106897, now seen corresponding path program 1 times [2020-06-22 08:49:01,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:01,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:01,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:01,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:01,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:01,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 08:49:01,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 08:49:01,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 08:49:01,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:49:01,442 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 7 states. [2020-06-22 08:49:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:01,672 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2020-06-22 08:49:01,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 08:49:01,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-06-22 08:49:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:01,673 INFO L225 Difference]: With dead ends: 65 [2020-06-22 08:49:01,673 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 08:49:01,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-06-22 08:49:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 08:49:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-06-22 08:49:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 08:49:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2020-06-22 08:49:01,676 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 20 [2020-06-22 08:49:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:01,677 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-06-22 08:49:01,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 08:49:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2020-06-22 08:49:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 08:49:01,677 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:01,678 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:01,678 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1534970425, now seen corresponding path program 1 times [2020-06-22 08:49:01,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:01,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:01,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:01,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:01,866 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 08:49:01,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:49:01,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:49:01,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:01,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjunts are in the unsatisfiable core [2020-06-22 08:49:01,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:01,972 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 08:49:01,972 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:01,983 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:01,984 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:49:01,985 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2020-06-22 08:49:02,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:49:02,026 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-06-22 08:49:02,027 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:02,041 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:02,043 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-06-22 08:49:02,043 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:44, output treesize:40 [2020-06-22 08:49:02,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:49:02,136 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:02,137 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 21 [2020-06-22 08:49:02,140 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:49:02,155 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:02,160 INFO L427 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:49:02,160 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:31 [2020-06-22 08:49:02,254 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 08:49:02,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:49:02,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-06-22 08:49:02,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 08:49:02,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 08:49:02,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-06-22 08:49:02,282 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 15 states. [2020-06-22 08:49:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:03,928 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2020-06-22 08:49:03,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-06-22 08:49:03,928 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2020-06-22 08:49:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:03,929 INFO L225 Difference]: With dead ends: 84 [2020-06-22 08:49:03,929 INFO L226 Difference]: Without dead ends: 81 [2020-06-22 08:49:03,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2020-06-22 08:49:03,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-06-22 08:49:03,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 36. [2020-06-22 08:49:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-06-22 08:49:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2020-06-22 08:49:03,934 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 20 [2020-06-22 08:49:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:03,934 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2020-06-22 08:49:03,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 08:49:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2020-06-22 08:49:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-06-22 08:49:03,935 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:03,935 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:03,935 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash 339440697, now seen corresponding path program 1 times [2020-06-22 08:49:03,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:03,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:03,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:04,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:49:04,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:49:04,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:04,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjunts are in the unsatisfiable core [2020-06-22 08:49:04,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:04,149 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 08:49:04,150 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:04,157 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:04,158 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:49:04,159 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 08:49:04,318 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:04,318 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 48 [2020-06-22 08:49:04,330 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:49:04,371 INFO L497 ElimStorePlain]: treesize reduction 16, result has 69.8 percent of original size [2020-06-22 08:49:04,373 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 08:49:04,373 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:37 [2020-06-22 08:49:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:07,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:49:07,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-06-22 08:49:07,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 08:49:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 08:49:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=219, Unknown=2, NotChecked=0, Total=272 [2020-06-22 08:49:07,123 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand 17 states. [2020-06-22 08:49:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:08,892 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2020-06-22 08:49:08,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-06-22 08:49:08,893 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2020-06-22 08:49:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:08,893 INFO L225 Difference]: With dead ends: 41 [2020-06-22 08:49:08,893 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 08:49:08,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=160, Invalid=488, Unknown=2, NotChecked=0, Total=650 [2020-06-22 08:49:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 08:49:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-06-22 08:49:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 08:49:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2020-06-22 08:49:08,898 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 21 [2020-06-22 08:49:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:08,898 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2020-06-22 08:49:08,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 08:49:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2020-06-22 08:49:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-06-22 08:49:08,899 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:08,899 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:08,899 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:08,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:08,899 INFO L82 PathProgramCache]: Analyzing trace with hash 339440698, now seen corresponding path program 1 times [2020-06-22 08:49:08,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:08,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:08,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:08,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:08,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:08,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:49:08,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:49:08,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:08,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 08:49:08,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:09,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 08:49:09,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 08:49:09,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 08:49:09,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 08:49:09,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:49:09,021 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 6 states. [2020-06-22 08:49:09,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:09,126 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2020-06-22 08:49:09,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:49:09,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-06-22 08:49:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:09,127 INFO L225 Difference]: With dead ends: 38 [2020-06-22 08:49:09,127 INFO L226 Difference]: Without dead ends: 33 [2020-06-22 08:49:09,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:49:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-06-22 08:49:09,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-06-22 08:49:09,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 08:49:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2020-06-22 08:49:09,130 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 21 [2020-06-22 08:49:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:09,131 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2020-06-22 08:49:09,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 08:49:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2020-06-22 08:49:09,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-06-22 08:49:09,131 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:09,132 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:09,132 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:09,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:09,132 INFO L82 PathProgramCache]: Analyzing trace with hash -742446647, now seen corresponding path program 2 times [2020-06-22 08:49:09,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:09,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:09,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:09,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:09,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:09,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:49:09,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:49:09,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 08:49:09,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 08:49:09,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 08:49:09,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 24 conjunts are in the unsatisfiable core [2020-06-22 08:49:09,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:09,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:49:09,474 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 08:49:09,474 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:09,485 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:09,486 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:49:09,486 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2020-06-22 08:49:09,519 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 08:49:09,520 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:09,538 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:09,539 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:49:09,539 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2020-06-22 08:49:09,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:49:09,575 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-06-22 08:49:09,576 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:09,589 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:09,590 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 08:49:09,590 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2020-06-22 08:49:09,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:49:09,711 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:09,711 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-06-22 08:49:09,752 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:49:09,768 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:09,770 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:49:09,770 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:27 [2020-06-22 08:49:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-06-22 08:49:09,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:49:09,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2020-06-22 08:49:09,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 08:49:09,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 08:49:09,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-06-22 08:49:09,895 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 17 states. [2020-06-22 08:49:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:12,208 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2020-06-22 08:49:12,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-06-22 08:49:12,208 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2020-06-22 08:49:12,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:12,209 INFO L225 Difference]: With dead ends: 86 [2020-06-22 08:49:12,209 INFO L226 Difference]: Without dead ends: 85 [2020-06-22 08:49:12,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=358, Invalid=1124, Unknown=0, NotChecked=0, Total=1482 [2020-06-22 08:49:12,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-06-22 08:49:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2020-06-22 08:49:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-06-22 08:49:12,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2020-06-22 08:49:12,217 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 30 [2020-06-22 08:49:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:12,217 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2020-06-22 08:49:12,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 08:49:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2020-06-22 08:49:12,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-06-22 08:49:12,218 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:12,219 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:12,219 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:12,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:12,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1541011799, now seen corresponding path program 2 times [2020-06-22 08:49:12,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:12,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:12,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:12,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:12,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:12,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:49:12,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:49:12,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 08:49:12,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 08:49:12,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 08:49:12,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 08:49:12,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:12,587 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:12,587 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 08:49:12,588 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:12,602 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 08:49:12,603 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:49:12,603 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-06-22 08:49:12,623 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 08:49:12,623 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:12,625 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:12,625 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:49:12,625 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 08:49:12,734 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:12,734 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2020-06-22 08:49:12,742 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-06-22 08:49:12,778 INFO L497 ElimStorePlain]: treesize reduction 58, result has 36.3 percent of original size [2020-06-22 08:49:12,779 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:49:12,779 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2020-06-22 08:49:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-06-22 08:49:12,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:49:12,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-06-22 08:49:12,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 08:49:12,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 08:49:12,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2020-06-22 08:49:12,909 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 18 states. [2020-06-22 08:49:14,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:14,002 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2020-06-22 08:49:14,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-06-22 08:49:14,002 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2020-06-22 08:49:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:14,003 INFO L225 Difference]: With dead ends: 97 [2020-06-22 08:49:14,003 INFO L226 Difference]: Without dead ends: 96 [2020-06-22 08:49:14,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=391, Invalid=1415, Unknown=0, NotChecked=0, Total=1806 [2020-06-22 08:49:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-06-22 08:49:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2020-06-22 08:49:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-06-22 08:49:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2020-06-22 08:49:14,012 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 31 [2020-06-22 08:49:14,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:14,012 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2020-06-22 08:49:14,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 08:49:14,012 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2020-06-22 08:49:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-06-22 08:49:14,013 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:14,013 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:14,013 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1303133656, now seen corresponding path program 1 times [2020-06-22 08:49:14,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:14,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:14,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:14,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:14,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-06-22 08:49:14,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:49:14,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:49:14,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:14,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 28 conjunts are in the unsatisfiable core [2020-06-22 08:49:14,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:14,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:49:14,207 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 08:49:14,207 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:14,215 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:14,215 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:49:14,216 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:20 [2020-06-22 08:49:14,237 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 08:49:14,238 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:14,245 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:14,246 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:49:14,246 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2020-06-22 08:49:14,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:49:14,271 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-06-22 08:49:14,272 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:14,280 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:14,280 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:49:14,280 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2020-06-22 08:49:14,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:49:14,365 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:14,365 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-06-22 08:49:14,366 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:49:14,376 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:14,376 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 08:49:14,376 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:23 [2020-06-22 08:49:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-06-22 08:49:14,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:49:14,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2020-06-22 08:49:14,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 08:49:14,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 08:49:14,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2020-06-22 08:49:14,483 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand 17 states. [2020-06-22 08:49:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:15,105 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2020-06-22 08:49:15,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-06-22 08:49:15,105 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2020-06-22 08:49:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:15,106 INFO L225 Difference]: With dead ends: 85 [2020-06-22 08:49:15,106 INFO L226 Difference]: Without dead ends: 84 [2020-06-22 08:49:15,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2020-06-22 08:49:15,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-06-22 08:49:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 42. [2020-06-22 08:49:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 08:49:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-06-22 08:49:15,111 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 40 [2020-06-22 08:49:15,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:15,112 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-06-22 08:49:15,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 08:49:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-06-22 08:49:15,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-06-22 08:49:15,112 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:49:15,113 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:15,113 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION]=== [2020-06-22 08:49:15,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:15,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1742435450, now seen corresponding path program 1 times [2020-06-22 08:49:15,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:15,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:15,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:15,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:15,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-06-22 08:49:15,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:49:15,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/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 08:49:15,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:15,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 08:49:15,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:15,334 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:15,334 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 08:49:15,335 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:15,351 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 08:49:15,351 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:49:15,352 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-06-22 08:49:15,356 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 08:49:15,356 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:49:15,358 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:15,358 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:49:15,358 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 08:49:15,445 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:49:15,445 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2020-06-22 08:49:15,452 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-06-22 08:49:15,493 INFO L497 ElimStorePlain]: treesize reduction 58, result has 36.3 percent of original size [2020-06-22 08:49:15,493 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:49:15,494 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2020-06-22 08:49:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-06-22 08:49:15,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:49:15,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2020-06-22 08:49:15,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 08:49:15,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 08:49:15,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-06-22 08:49:15,586 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 15 states. [2020-06-22 08:49:16,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:16,001 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-06-22 08:49:16,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 08:49:16,001 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-06-22 08:49:16,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:49:16,001 INFO L225 Difference]: With dead ends: 42 [2020-06-22 08:49:16,002 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 08:49:16,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2020-06-22 08:49:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 08:49:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 08:49:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 08:49:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 08:49:16,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-06-22 08:49:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:49:16,003 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:49:16,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 08:49:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:49:16,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 08:49:16,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 08:49:16,138 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 195 [2020-06-22 08:49:22,347 WARN L188 SmtUtils]: Spent 6.21 s on a formula simplification. DAG size of input: 190 DAG size of output: 82 [2020-06-22 08:49:22,350 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2020-06-22 08:49:22,350 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2020-06-22 08:49:22,351 INFO L448 ceAbstractionStarter]: For program point L19-2(line 19) no Hoare annotation was computed. [2020-06-22 08:49:22,351 INFO L448 ceAbstractionStarter]: For program point L19-3(line 19) no Hoare annotation was computed. [2020-06-22 08:49:22,351 INFO L448 ceAbstractionStarter]: For program point L19-4(lines 19 20) no Hoare annotation was computed. [2020-06-22 08:49:22,351 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2020-06-22 08:49:22,351 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2020-06-22 08:49:22,351 INFO L448 ceAbstractionStarter]: For program point L40-1(line 40) no Hoare annotation was computed. [2020-06-22 08:49:22,351 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 08:49:22,351 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2020-06-22 08:49:22,351 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 08:49:22,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 08:49:22,352 INFO L448 ceAbstractionStarter]: For program point L32-2(lines 29 43) no Hoare annotation was computed. [2020-06-22 08:49:22,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. [2020-06-22 08:49:22,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 08:49:22,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 08:49:22,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 08:49:22,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 08:49:22,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 08:49:22,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 08:49:22,352 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 08:49:22,353 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 41) no Hoare annotation was computed. [2020-06-22 08:49:22,353 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 41) no Hoare annotation was computed. [2020-06-22 08:49:22,353 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. [2020-06-22 08:49:22,353 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 40) no Hoare annotation was computed. [2020-06-22 08:49:22,353 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-06-22 08:49:22,353 INFO L448 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. [2020-06-22 08:49:22,353 INFO L448 ceAbstractionStarter]: For program point L16-3(line 16) no Hoare annotation was computed. [2020-06-22 08:49:22,353 INFO L448 ceAbstractionStarter]: For program point L16-4(line 16) no Hoare annotation was computed. [2020-06-22 08:49:22,353 INFO L448 ceAbstractionStarter]: For program point L16-6(lines 16 23) no Hoare annotation was computed. [2020-06-22 08:49:22,354 INFO L444 ceAbstractionStarter]: At program point L16-8(lines 16 23) the Hoare annotation is: (let ((.cse3 (select |#memory_int| ULTIMATE.start_cstrncmp_~s2.base)) (.cse19 (select |#memory_int| ULTIMATE.start_cstrncmp_~s1.base)) (.cse20 (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base)) (.cse23 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse22 (select |#length| ULTIMATE.start_cstrncmp_~s1.base)) (.cse21 (select |#length| ULTIMATE.start_cstrncmp_~s2.base))) (let ((.cse0 (= 0 ULTIMATE.start_cstrncmp_~s2.offset)) (.cse5 (= 0 ULTIMATE.start_cstrncmp_~s1.offset)) (.cse6 (<= 1 .cse21)) (.cse9 (<= 1 .cse22)) (.cse14 (= 0 (select .cse20 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse23 (- 1))))) (.cse10 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse1 (= ULTIMATE.start_main_~length1~0 .cse23)) (.cse2 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s2.base))) (.cse16 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse7 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse8 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse12 (= 1 (select |#valid| ULTIMATE.start_cstrncmp_~s1.base))) (.cse13 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse15 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse11 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse4 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse17 (= (select .cse19 (+ .cse22 (- 1))) 0)) (.cse18 (= 0 (select .cse3 (+ .cse21 (- 1)))))) (or (and (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) .cse0 .cse1 .cse2 (= (select .cse3 ULTIMATE.start_cstrncmp_~s2.offset) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (and .cse14 .cse15 (and .cse0 .cse1 .cse2 .cse4 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse17 .cse5) .cse18) (and (= 0 (select .cse19 ULTIMATE.start_cstrncmp_~s1.offset)) .cse0 .cse1 .cse2 .cse15 .cse4 (= 0 (select .cse20 ULTIMATE.start_main_~nondetString1~0.offset)) .cse16 .cse5 .cse6 (= 1 ULTIMATE.start_main_~length1~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ULTIMATE.start_cstrncmp_~s2.offset 1) .cse21) (and .cse14 .cse10 (and (<= 1 ULTIMATE.start_cstrncmp_~n) .cse1 .cse2 .cse16 .cse7 .cse8 .cse12 (<= 1 ULTIMATE.start_cstrncmp_~s1.offset) .cse13) .cse15 .cse11 (<= (+ ULTIMATE.start_cstrncmp_~s1.offset 1) .cse22) .cse4 .cse17 (<= 1 ULTIMATE.start_cstrncmp_~s2.offset)) .cse18)))) [2020-06-22 08:49:22,354 INFO L448 ceAbstractionStarter]: For program point L16-9(lines 16 23) no Hoare annotation was computed. [2020-06-22 08:49:22,354 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 35 37) no Hoare annotation was computed. [2020-06-22 08:49:22,354 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 08:49:22,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,374 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,375 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,376 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,377 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,393 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,395 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,395 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,395 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,395 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,395 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:22,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:22,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:49:22 BasicIcfg [2020-06-22 08:49:22,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 08:49:22,400 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 08:49:22,400 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 08:49:22,403 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 08:49:22,404 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:22,404 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 08:48:57" (1/5) ... [2020-06-22 08:49:22,404 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74706814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:49:22, skipping insertion in model container [2020-06-22 08:49:22,404 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:22,405 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:48:57" (2/5) ... [2020-06-22 08:49:22,405 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74706814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:49:22, skipping insertion in model container [2020-06-22 08:49:22,405 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:22,405 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:48:57" (3/5) ... [2020-06-22 08:49:22,405 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74706814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:49:22, skipping insertion in model container [2020-06-22 08:49:22,405 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:22,405 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:48:58" (4/5) ... [2020-06-22 08:49:22,406 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74706814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:49:22, skipping insertion in model container [2020-06-22 08:49:22,406 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:49:22,406 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:49:22" (5/5) ... [2020-06-22 08:49:22,407 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:49:22,428 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:49:22,428 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 08:49:22,428 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 08:49:22,428 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:49:22,428 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:49:22,428 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:49:22,428 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 08:49:22,428 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:49:22,428 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 08:49:22,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-06-22 08:49:22,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:49:22,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:22,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:22,441 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:22,441 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 08:49:22,441 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 08:49:22,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-06-22 08:49:22,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:49:22,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:22,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:22,443 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:22,443 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 08:49:22,448 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue [210] ULTIMATE.startENTRY-->L32: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_6|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_5|, ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_5|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_5|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc14.offset, ULTIMATE.start_main_~length2~0] 13#L32true [140] L32-->L32-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 29#L32-2true [141] L32-2-->L35-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 31#L35-1true [166] L35-1-->L40: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc13.offset_2| 0) (= |v_ULTIMATE.start_main_#t~malloc14.offset_2| 0) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc14.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc14.base_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2| 1)) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc13.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc14.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc13.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc13.offset_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2|)) (< |v_ULTIMATE.start_main_#t~malloc14.base_2| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_main_#t~malloc13.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc13.base_2| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc14.base_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_2|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_2|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc14.offset] 8#L40true [94] L40-->L40-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 6#L40-1true [211] L40-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~mem9=|v_ULTIMATE.start_cstrncmp_#t~mem9_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_4|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_5|, ULTIMATE.start_cstrncmp_#t~ite10=|v_ULTIMATE.start_cstrncmp_#t~ite10_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_4|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_6|, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_10|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem9, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~ite10, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset] 32#L13true [175] L13-->L16-8: Formula: (< v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 27#L16-8true [2020-06-22 08:49:22,449 INFO L796 eck$LassoCheckResult]: Loop: 27#L16-8true [177] L16-8-->L16-1: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~post0_2| v_ULTIMATE.start_cstrncmp_~n_6) (>= 0 |v_ULTIMATE.start_cstrncmp_#t~post0_2|) (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post0_2| (- 1))) (not |v_ULTIMATE.start_cstrncmp_#t~short3_2|)) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_2|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short3] 3#L16-1true [90] L16-1-->L16-6: Formula: (not |v_ULTIMATE.start_cstrncmp_#t~short3_5|) InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_5|} OutVars{ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_5|} AuxVars[] AssignedVars[] 12#L16-6true [187] L16-6-->L19: Formula: (and (< v_ULTIMATE.start_cstrncmp_~n_7 0) (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|) |v_ULTIMATE.start_cstrncmp_#t~short3_9|) InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_4|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_8|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5] 28#L19true [127] L19-->L19-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short5_3| InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} AuxVars[] AssignedVars[] 22#L19-4true [115] L19-4-->L16-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (not |v_ULTIMATE.start_cstrncmp_#t~short5_9|) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_2|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset, ULTIMATE.start_cstrncmp_~s1.offset] 27#L16-8true [2020-06-22 08:49:22,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:22,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1011605018, now seen corresponding path program 1 times [2020-06-22 08:49:22,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:22,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:22,479 INFO L82 PathProgramCache]: Analyzing trace with hash 194957317, now seen corresponding path program 1 times [2020-06-22 08:49:22,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:22,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:22,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:22,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:22,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:22,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:49:22,488 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 08:49:22,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:22,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:22,489 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-06-22 08:49:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:22,573 INFO L93 Difference]: Finished difference Result 35 states and 64 transitions. [2020-06-22 08:49:22,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:22,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 64 transitions. [2020-06-22 08:49:22,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:49:22,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 17 states and 28 transitions. [2020-06-22 08:49:22,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 08:49:22,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 08:49:22,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 28 transitions. [2020-06-22 08:49:22,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:49:22,581 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 28 transitions. [2020-06-22 08:49:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 28 transitions. [2020-06-22 08:49:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 08:49:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 08:49:22,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 28 transitions. [2020-06-22 08:49:22,583 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 28 transitions. [2020-06-22 08:49:22,583 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 28 transitions. [2020-06-22 08:49:22,583 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 08:49:22,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 28 transitions. [2020-06-22 08:49:22,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:49:22,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:22,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:22,584 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:22,585 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:22,585 INFO L794 eck$LassoCheckResult]: Stem: 90#ULTIMATE.startENTRY [210] ULTIMATE.startENTRY-->L32: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_6|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_5|, ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_5|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_5|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc14.offset, ULTIMATE.start_main_~length2~0] 91#L32 [140] L32-->L32-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 87#L32-2 [141] L32-2-->L35-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 88#L35-1 [166] L35-1-->L40: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc13.offset_2| 0) (= |v_ULTIMATE.start_main_#t~malloc14.offset_2| 0) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc14.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc14.base_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2| 1)) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc13.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc14.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc13.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc13.offset_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2|)) (< |v_ULTIMATE.start_main_#t~malloc14.base_2| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_main_#t~malloc13.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc13.base_2| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc14.base_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_2|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_2|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc14.offset] 85#L40 [94] L40-->L40-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 83#L40-1 [211] L40-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~mem9=|v_ULTIMATE.start_cstrncmp_#t~mem9_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_4|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_5|, ULTIMATE.start_cstrncmp_#t~ite10=|v_ULTIMATE.start_cstrncmp_#t~ite10_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_4|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_6|, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_10|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem9, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~ite10, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset] 84#L13 [175] L13-->L16-8: Formula: (< v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 78#L16-8 [2020-06-22 08:49:22,586 INFO L796 eck$LassoCheckResult]: Loop: 78#L16-8 [178] L16-8-->L16-1: Formula: (and (< 0 |v_ULTIMATE.start_cstrncmp_#t~post0_2|) |v_ULTIMATE.start_cstrncmp_#t~short3_2| (= |v_ULTIMATE.start_cstrncmp_#t~post0_2| v_ULTIMATE.start_cstrncmp_~n_6) (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post0_2| (- 1)))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_2|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short3] 79#L16-1 [89] L16-1-->L16-2: Formula: |v_ULTIMATE.start_cstrncmp_#t~short3_3| InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_3|} AuxVars[] AssignedVars[] 80#L16-2 [108] L16-2-->L16-3: Formula: (and (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_cstrncmp_~s1.base_3)) (= |v_ULTIMATE.start_cstrncmp_#t~mem1_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrncmp_~s1.base_3) v_ULTIMATE.start_cstrncmp_~s1.offset_3)) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrncmp_~s1.base_3))) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_2|, #length=|v_#length_8|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem1] 93#L16-3 [103] L16-3-->L16-4: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~mem2_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrncmp_~s2.base_3) v_ULTIMATE.start_cstrncmp_~s2.offset_3)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_cstrncmp_~s2.base_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s2.offset_3) (<= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_3 1) (select |v_#length_10| v_ULTIMATE.start_cstrncmp_~s2.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, #length=|v_#length_10|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem2] 92#L16-4 [200] L16-4-->L16-6: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short3_4| (= |v_ULTIMATE.start_cstrncmp_#t~mem1_3| |v_ULTIMATE.start_cstrncmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_3|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_3|, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_4|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short3] 89#L16-6 [187] L16-6-->L19: Formula: (and (< v_ULTIMATE.start_cstrncmp_~n_7 0) (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|) |v_ULTIMATE.start_cstrncmp_#t~short3_9|) InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_4|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_8|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5] 86#L19 [127] L19-->L19-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short5_3| InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} AuxVars[] AssignedVars[] 77#L19-4 [115] L19-4-->L16-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (not |v_ULTIMATE.start_cstrncmp_#t~short5_9|) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_2|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset, ULTIMATE.start_cstrncmp_~s1.offset] 78#L16-8 [2020-06-22 08:49:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:22,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1011605018, now seen corresponding path program 2 times [2020-06-22 08:49:22,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:22,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:22,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:22,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:22,599 INFO L82 PathProgramCache]: Analyzing trace with hash -248198230, now seen corresponding path program 1 times [2020-06-22 08:49:22,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:22,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:22,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:22,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:22,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:22,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:49:22,608 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 08:49:22,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:22,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:22,609 INFO L87 Difference]: Start difference. First operand 17 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-06-22 08:49:22,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:22,647 INFO L93 Difference]: Finished difference Result 18 states and 28 transitions. [2020-06-22 08:49:22,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:22,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 28 transitions. [2020-06-22 08:49:22,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:49:22,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 28 transitions. [2020-06-22 08:49:22,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-06-22 08:49:22,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-06-22 08:49:22,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2020-06-22 08:49:22,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:49:22,650 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 08:49:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2020-06-22 08:49:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-06-22 08:49:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 08:49:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2020-06-22 08:49:22,651 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 27 transitions. [2020-06-22 08:49:22,651 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 27 transitions. [2020-06-22 08:49:22,651 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 08:49:22,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 27 transitions. [2020-06-22 08:49:22,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:49:22,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:22,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:22,652 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:22,652 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:22,653 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY [210] ULTIMATE.startENTRY-->L32: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_6|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_5|, ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_5|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_5|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc14.offset, ULTIMATE.start_main_~length2~0] 132#L32 [140] L32-->L32-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 128#L32-2 [141] L32-2-->L35-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 129#L35-1 [166] L35-1-->L40: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc13.offset_2| 0) (= |v_ULTIMATE.start_main_#t~malloc14.offset_2| 0) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc14.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc14.base_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2| 1)) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc13.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc14.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc13.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc13.offset_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2|)) (< |v_ULTIMATE.start_main_#t~malloc14.base_2| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_main_#t~malloc13.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc13.base_2| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc14.base_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_2|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_2|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc14.offset] 126#L40 [94] L40-->L40-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 124#L40-1 [211] L40-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~mem9=|v_ULTIMATE.start_cstrncmp_#t~mem9_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_4|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_5|, ULTIMATE.start_cstrncmp_#t~ite10=|v_ULTIMATE.start_cstrncmp_#t~ite10_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_4|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_6|, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_10|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem9, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~ite10, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset] 125#L13 [175] L13-->L16-8: Formula: (< v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 121#L16-8 [2020-06-22 08:49:22,653 INFO L796 eck$LassoCheckResult]: Loop: 121#L16-8 [178] L16-8-->L16-1: Formula: (and (< 0 |v_ULTIMATE.start_cstrncmp_#t~post0_2|) |v_ULTIMATE.start_cstrncmp_#t~short3_2| (= |v_ULTIMATE.start_cstrncmp_#t~post0_2| v_ULTIMATE.start_cstrncmp_~n_6) (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post0_2| (- 1)))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_2|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short3] 118#L16-1 [89] L16-1-->L16-2: Formula: |v_ULTIMATE.start_cstrncmp_#t~short3_3| InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_3|} AuxVars[] AssignedVars[] 119#L16-2 [108] L16-2-->L16-3: Formula: (and (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_cstrncmp_~s1.base_3)) (= |v_ULTIMATE.start_cstrncmp_#t~mem1_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrncmp_~s1.base_3) v_ULTIMATE.start_cstrncmp_~s1.offset_3)) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrncmp_~s1.base_3))) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_2|, #length=|v_#length_8|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem1] 134#L16-3 [103] L16-3-->L16-4: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~mem2_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrncmp_~s2.base_3) v_ULTIMATE.start_cstrncmp_~s2.offset_3)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_cstrncmp_~s2.base_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s2.offset_3) (<= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_3 1) (select |v_#length_10| v_ULTIMATE.start_cstrncmp_~s2.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, #length=|v_#length_10|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem2] 133#L16-4 [200] L16-4-->L16-6: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short3_4| (= |v_ULTIMATE.start_cstrncmp_#t~mem1_3| |v_ULTIMATE.start_cstrncmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_3|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_3|, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_4|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short3] 130#L16-6 [188] L16-6-->L19: Formula: (and (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|) |v_ULTIMATE.start_cstrncmp_#t~short3_9| (> v_ULTIMATE.start_cstrncmp_~n_7 0)) InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_4|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_8|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5] 127#L19 [127] L19-->L19-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short5_3| InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} AuxVars[] AssignedVars[] 120#L19-4 [115] L19-4-->L16-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (not |v_ULTIMATE.start_cstrncmp_#t~short5_9|) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_2|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset, ULTIMATE.start_cstrncmp_~s1.offset] 121#L16-8 [2020-06-22 08:49:22,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:22,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1011605018, now seen corresponding path program 3 times [2020-06-22 08:49:22,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:22,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:22,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:22,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash -248197269, now seen corresponding path program 1 times [2020-06-22 08:49:22,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:22,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:22,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 08:49:22,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:22,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:49:22,677 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 08:49:22,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:22,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:22,678 INFO L87 Difference]: Start difference. First operand 17 states and 27 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-06-22 08:49:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:22,712 INFO L93 Difference]: Finished difference Result 19 states and 29 transitions. [2020-06-22 08:49:22,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:22,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 29 transitions. [2020-06-22 08:49:22,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 08:49:22,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 29 transitions. [2020-06-22 08:49:22,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-06-22 08:49:22,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-06-22 08:49:22,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 29 transitions. [2020-06-22 08:49:22,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:49:22,714 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-06-22 08:49:22,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 29 transitions. [2020-06-22 08:49:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-06-22 08:49:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 08:49:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-06-22 08:49:22,716 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 08:49:22,716 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 08:49:22,716 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 08:49:22,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2020-06-22 08:49:22,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 08:49:22,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:22,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:22,717 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:22,717 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:22,718 INFO L794 eck$LassoCheckResult]: Stem: 174#ULTIMATE.startENTRY [210] ULTIMATE.startENTRY-->L32: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_6|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_5|, ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_5|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_5|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc14.offset, ULTIMATE.start_main_~length2~0] 175#L32 [140] L32-->L32-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 170#L32-2 [141] L32-2-->L35-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 171#L35-1 [166] L35-1-->L40: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc13.offset_2| 0) (= |v_ULTIMATE.start_main_#t~malloc14.offset_2| 0) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc14.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc14.base_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2| 1)) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc13.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc14.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc13.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc13.offset_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2|)) (< |v_ULTIMATE.start_main_#t~malloc14.base_2| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_main_#t~malloc13.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc13.base_2| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc14.base_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_2|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_2|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc14.offset] 168#L40 [94] L40-->L40-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 166#L40-1 [211] L40-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~mem9=|v_ULTIMATE.start_cstrncmp_#t~mem9_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_4|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_5|, ULTIMATE.start_cstrncmp_#t~ite10=|v_ULTIMATE.start_cstrncmp_#t~ite10_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_4|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_6|, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_10|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem9, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~ite10, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset] 167#L13 [175] L13-->L16-8: Formula: (< v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 163#L16-8 [2020-06-22 08:49:22,718 INFO L796 eck$LassoCheckResult]: Loop: 163#L16-8 [178] L16-8-->L16-1: Formula: (and (< 0 |v_ULTIMATE.start_cstrncmp_#t~post0_2|) |v_ULTIMATE.start_cstrncmp_#t~short3_2| (= |v_ULTIMATE.start_cstrncmp_#t~post0_2| v_ULTIMATE.start_cstrncmp_~n_6) (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post0_2| (- 1)))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_2|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short3] 160#L16-1 [89] L16-1-->L16-2: Formula: |v_ULTIMATE.start_cstrncmp_#t~short3_3| InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_3|} AuxVars[] AssignedVars[] 161#L16-2 [108] L16-2-->L16-3: Formula: (and (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_cstrncmp_~s1.base_3)) (= |v_ULTIMATE.start_cstrncmp_#t~mem1_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrncmp_~s1.base_3) v_ULTIMATE.start_cstrncmp_~s1.offset_3)) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrncmp_~s1.base_3))) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_2|, #length=|v_#length_8|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem1] 177#L16-3 [103] L16-3-->L16-4: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~mem2_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrncmp_~s2.base_3) v_ULTIMATE.start_cstrncmp_~s2.offset_3)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_cstrncmp_~s2.base_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s2.offset_3) (<= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_3 1) (select |v_#length_10| v_ULTIMATE.start_cstrncmp_~s2.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, #length=|v_#length_10|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem2] 176#L16-4 [200] L16-4-->L16-6: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short3_4| (= |v_ULTIMATE.start_cstrncmp_#t~mem1_3| |v_ULTIMATE.start_cstrncmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_3|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_3|, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_4|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short3] 172#L16-6 [189] L16-6-->L19: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short5_2| (= v_ULTIMATE.start_cstrncmp_~n_7 0) |v_ULTIMATE.start_cstrncmp_#t~short3_9|) InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_4|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_8|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5] 173#L19 [127] L19-->L19-4: Formula: |v_ULTIMATE.start_cstrncmp_#t~short5_3| InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_3|} AuxVars[] AssignedVars[] 162#L19-4 [115] L19-4-->L16-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (not |v_ULTIMATE.start_cstrncmp_#t~short5_9|) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_2|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset, ULTIMATE.start_cstrncmp_~s1.offset] 163#L16-8 [2020-06-22 08:49:22,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:22,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1011605018, now seen corresponding path program 4 times [2020-06-22 08:49:22,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:22,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:22,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:22,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:22,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash -248196308, now seen corresponding path program 1 times [2020-06-22 08:49:22,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:22,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:22,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:22,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:22,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:49:22,740 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 08:49:22,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:22,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:22,741 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-06-22 08:49:22,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:22,776 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2020-06-22 08:49:22,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:22,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 27 transitions. [2020-06-22 08:49:22,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:49:22,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 24 transitions. [2020-06-22 08:49:22,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 08:49:22,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 08:49:22,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2020-06-22 08:49:22,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:49:22,778 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-06-22 08:49:22,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2020-06-22 08:49:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 08:49:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 08:49:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-06-22 08:49:22,779 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-06-22 08:49:22,779 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-06-22 08:49:22,779 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 08:49:22,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-06-22 08:49:22,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:49:22,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:22,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:22,780 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:22,780 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:22,781 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY [210] ULTIMATE.startENTRY-->L32: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_6|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_5|, ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_5|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_5|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc14.offset, ULTIMATE.start_main_~length2~0] 217#L32 [140] L32-->L32-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 213#L32-2 [141] L32-2-->L35-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 214#L35-1 [166] L35-1-->L40: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc13.offset_2| 0) (= |v_ULTIMATE.start_main_#t~malloc14.offset_2| 0) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc14.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc14.base_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2| 1)) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc13.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc14.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc13.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc13.offset_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2|)) (< |v_ULTIMATE.start_main_#t~malloc14.base_2| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_main_#t~malloc13.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc13.base_2| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc14.base_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_2|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_2|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc14.offset] 211#L40 [94] L40-->L40-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 209#L40-1 [211] L40-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~mem9=|v_ULTIMATE.start_cstrncmp_#t~mem9_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_4|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_5|, ULTIMATE.start_cstrncmp_#t~ite10=|v_ULTIMATE.start_cstrncmp_#t~ite10_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_4|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_6|, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_10|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem9, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~ite10, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset] 210#L13 [175] L13-->L16-8: Formula: (< v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 206#L16-8 [2020-06-22 08:49:22,781 INFO L796 eck$LassoCheckResult]: Loop: 206#L16-8 [178] L16-8-->L16-1: Formula: (and (< 0 |v_ULTIMATE.start_cstrncmp_#t~post0_2|) |v_ULTIMATE.start_cstrncmp_#t~short3_2| (= |v_ULTIMATE.start_cstrncmp_#t~post0_2| v_ULTIMATE.start_cstrncmp_~n_6) (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post0_2| (- 1)))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_2|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short3] 203#L16-1 [89] L16-1-->L16-2: Formula: |v_ULTIMATE.start_cstrncmp_#t~short3_3| InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_3|} AuxVars[] AssignedVars[] 204#L16-2 [108] L16-2-->L16-3: Formula: (and (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_cstrncmp_~s1.base_3)) (= |v_ULTIMATE.start_cstrncmp_#t~mem1_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrncmp_~s1.base_3) v_ULTIMATE.start_cstrncmp_~s1.offset_3)) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrncmp_~s1.base_3))) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_2|, #length=|v_#length_8|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem1] 219#L16-3 [103] L16-3-->L16-4: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~mem2_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrncmp_~s2.base_3) v_ULTIMATE.start_cstrncmp_~s2.offset_3)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_cstrncmp_~s2.base_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s2.offset_3) (<= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_3 1) (select |v_#length_10| v_ULTIMATE.start_cstrncmp_~s2.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, #length=|v_#length_10|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem2] 218#L16-4 [200] L16-4-->L16-6: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short3_4| (= |v_ULTIMATE.start_cstrncmp_#t~mem1_3| |v_ULTIMATE.start_cstrncmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_3|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_3|, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_4|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short3] 215#L16-6 [188] L16-6-->L19: Formula: (and (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|) |v_ULTIMATE.start_cstrncmp_#t~short3_9| (> v_ULTIMATE.start_cstrncmp_~n_7 0)) InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_4|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_8|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5] 212#L19 [128] L19-->L19-2: Formula: (not |v_ULTIMATE.start_cstrncmp_#t~short5_4|) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_4|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_4|} AuxVars[] AssignedVars[] 208#L19-2 [119] L19-2-->L19-3: Formula: (and (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_cstrncmp_~s1.base_6)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_cstrncmp_~s1.base_6)) (= |v_ULTIMATE.start_cstrncmp_#t~mem4_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrncmp_~s1.base_6) v_ULTIMATE.start_cstrncmp_~s1.offset_5)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_5)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_6, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_5, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_6, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4] 207#L19-3 [208] L19-3-->L19-4: Formula: (and (not |v_ULTIMATE.start_cstrncmp_#t~short5_5|) (< |v_ULTIMATE.start_cstrncmp_#t~mem4_3| 0)) InVars {ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short5] 205#L19-4 [115] L19-4-->L16-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (not |v_ULTIMATE.start_cstrncmp_#t~short5_9|) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_2|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset, ULTIMATE.start_cstrncmp_~s1.offset] 206#L16-8 [2020-06-22 08:49:22,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1011605018, now seen corresponding path program 5 times [2020-06-22 08:49:22,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:22,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:22,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:22,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2000633265, now seen corresponding path program 1 times [2020-06-22 08:49:22,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:22,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:22,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:22,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:22,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:22,802 INFO L82 PathProgramCache]: Analyzing trace with hash -711850666, now seen corresponding path program 1 times [2020-06-22 08:49:22,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:22,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:22,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:22,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:22,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:49:22,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:49:22,941 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-06-22 08:49:22,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:49:22,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:49:22,974 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-06-22 08:49:22,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:49:22,996 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-06-22 08:49:22,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:49:22,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2020-06-22 08:49:22,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:49:22,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2020-06-22 08:49:22,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-06-22 08:49:22,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-06-22 08:49:22,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2020-06-22 08:49:22,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:49:22,998 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-06-22 08:49:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2020-06-22 08:49:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 08:49:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 08:49:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-06-22 08:49:22,999 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-06-22 08:49:22,999 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-06-22 08:49:22,999 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 08:49:23,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-06-22 08:49:23,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:49:23,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:49:23,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:49:23,000 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:23,001 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:49:23,001 INFO L794 eck$LassoCheckResult]: Stem: 259#ULTIMATE.startENTRY [210] ULTIMATE.startENTRY-->L32: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_6|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_5|, ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_5|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_5|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_5|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc14.offset, ULTIMATE.start_main_~length2~0] 260#L32 [140] L32-->L32-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 256#L32-2 [141] L32-2-->L35-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 257#L35-1 [166] L35-1-->L40: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2| 1))) (and (= |v_ULTIMATE.start_main_#t~malloc13.offset_2| 0) (= |v_ULTIMATE.start_main_#t~malloc14.offset_2| 0) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc13.base_2|)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc14.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc14.base_2|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2| 1)) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc13.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc14.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc13.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc13.offset_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc14.base_2|)) (< |v_ULTIMATE.start_main_#t~malloc14.base_2| |v_#StackHeapBarrier_1|) (> |v_ULTIMATE.start_main_#t~malloc13.base_2| 0) (< |v_ULTIMATE.start_main_#t~malloc13.base_2| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc14.base_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc13.offset=|v_ULTIMATE.start_main_#t~malloc13.offset_2|, ULTIMATE.start_main_#t~malloc13.base=|v_ULTIMATE.start_main_#t~malloc13.base_2|, ULTIMATE.start_main_#t~malloc14.base=|v_ULTIMATE.start_main_#t~malloc14.base_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc14.offset=|v_ULTIMATE.start_main_#t~malloc14.offset_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc13.offset, ULTIMATE.start_main_#t~malloc13.base, ULTIMATE.start_main_#t~malloc14.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc14.offset] 254#L40 [94] L40-->L40-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 252#L40-1 [211] L40-1-->L13: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_main_~nondetString2~0.base_8 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2| v_ULTIMATE.start_main_~nondetString2~0.offset_7) (= |v_ULTIMATE.start_main_#t~nondet15_5| |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.base_11 |v_ULTIMATE.start_cstrncmp_#in~s2.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= v_ULTIMATE.start_cstrncmp_~n_8 |v_ULTIMATE.start_cstrncmp_#in~n_2|) (= v_ULTIMATE.start_cstrncmp_~s2.offset_9 |v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|) (= v_ULTIMATE.start_cstrncmp_~s1.base_14 |v_ULTIMATE.start_cstrncmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrncmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrncmp_#in~s1.offset_2| v_ULTIMATE.start_cstrncmp_~s1.offset_11))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrncmp_#t~mem8=|v_ULTIMATE.start_cstrncmp_#t~mem8_5|, ULTIMATE.start_cstrncmp_#t~mem9=|v_ULTIMATE.start_cstrncmp_#t~mem9_5|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_11, ULTIMATE.start_cstrncmp_#res=|v_ULTIMATE.start_cstrncmp_#res_6|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_6|, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_4|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_6|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_14, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_4|, ULTIMATE.start_cstrncmp_#in~s2.offset=|v_ULTIMATE.start_cstrncmp_#in~s2.offset_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_5|, ULTIMATE.start_cstrncmp_#t~ite10=|v_ULTIMATE.start_cstrncmp_#t~ite10_6|, #length=|v_#length_18|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_8, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_4|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrncmp_~uc2~0=v_ULTIMATE.start_cstrncmp_~uc2~0_6, ULTIMATE.start_cstrncmp_#in~n=|v_ULTIMATE.start_cstrncmp_#in~n_2|, ULTIMATE.start_cstrncmp_~uc1~0=v_ULTIMATE.start_cstrncmp_~uc1~0_6, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_cstrncmp_#in~s1.offset=|v_ULTIMATE.start_cstrncmp_#in~s1.offset_2|, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_9, ULTIMATE.start_cstrncmp_#in~s2.base=|v_ULTIMATE.start_cstrncmp_#in~s2.base_2|, ULTIMATE.start_cstrncmp_#in~s1.base=|v_ULTIMATE.start_cstrncmp_#in~s1.base_2|, #valid=|v_#valid_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_6|, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_10|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_10|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem8, ULTIMATE.start_cstrncmp_#t~mem9, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#res, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_#in~s2.offset, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~ite10, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.offset, ULTIMATE.start_cstrncmp_~uc2~0, ULTIMATE.start_cstrncmp_#in~n, ULTIMATE.start_cstrncmp_~uc1~0, ULTIMATE.start_cstrncmp_#in~s1.offset, ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#in~s2.base, ULTIMATE.start_cstrncmp_#in~s1.base, #memory_int, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset] 253#L13 [176] L13-->L16-8: Formula: (> v_ULTIMATE.start_cstrncmp_~n_4 0) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} OutVars{ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_4} AuxVars[] AssignedVars[] 249#L16-8 [2020-06-22 08:49:23,002 INFO L796 eck$LassoCheckResult]: Loop: 249#L16-8 [178] L16-8-->L16-1: Formula: (and (< 0 |v_ULTIMATE.start_cstrncmp_#t~post0_2|) |v_ULTIMATE.start_cstrncmp_#t~short3_2| (= |v_ULTIMATE.start_cstrncmp_#t~post0_2| v_ULTIMATE.start_cstrncmp_~n_6) (= v_ULTIMATE.start_cstrncmp_~n_5 (+ |v_ULTIMATE.start_cstrncmp_#t~post0_2| (- 1)))) InVars {ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_6} OutVars{ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_2|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_5, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_~n, ULTIMATE.start_cstrncmp_#t~short3] 246#L16-1 [89] L16-1-->L16-2: Formula: |v_ULTIMATE.start_cstrncmp_#t~short3_3| InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_3|} OutVars{ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_3|} AuxVars[] AssignedVars[] 247#L16-2 [108] L16-2-->L16-3: Formula: (and (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_3) (= 1 (select |v_#valid_10| v_ULTIMATE.start_cstrncmp_~s1.base_3)) (= |v_ULTIMATE.start_cstrncmp_#t~mem1_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrncmp_~s1.base_3) v_ULTIMATE.start_cstrncmp_~s1.offset_3)) (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_3 1) (select |v_#length_8| v_ULTIMATE.start_cstrncmp_~s1.base_3))) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_2|, #length=|v_#length_8|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_3, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem1] 262#L16-3 [103] L16-3-->L16-4: Formula: (and (= |v_ULTIMATE.start_cstrncmp_#t~mem2_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrncmp_~s2.base_3) v_ULTIMATE.start_cstrncmp_~s2.offset_3)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_cstrncmp_~s2.base_3)) (<= 0 v_ULTIMATE.start_cstrncmp_~s2.offset_3) (<= (+ v_ULTIMATE.start_cstrncmp_~s2.offset_3 1) (select |v_#length_10| v_ULTIMATE.start_cstrncmp_~s2.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, #length=|v_#length_10|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_3, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_3, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_2|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem2] 261#L16-4 [200] L16-4-->L16-6: Formula: (and |v_ULTIMATE.start_cstrncmp_#t~short3_4| (= |v_ULTIMATE.start_cstrncmp_#t~mem1_3| |v_ULTIMATE.start_cstrncmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_3|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_3|, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_4|, ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short3] 258#L16-6 [188] L16-6-->L19: Formula: (and (not |v_ULTIMATE.start_cstrncmp_#t~short5_2|) |v_ULTIMATE.start_cstrncmp_#t~short3_9| (> v_ULTIMATE.start_cstrncmp_~n_7 0)) InVars {ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_9|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7} OutVars{ULTIMATE.start_cstrncmp_#t~mem2=|v_ULTIMATE.start_cstrncmp_#t~mem2_5|, ULTIMATE.start_cstrncmp_#t~post0=|v_ULTIMATE.start_cstrncmp_#t~post0_4|, ULTIMATE.start_cstrncmp_#t~mem1=|v_ULTIMATE.start_cstrncmp_#t~mem1_5|, ULTIMATE.start_cstrncmp_~n=v_ULTIMATE.start_cstrncmp_~n_7, ULTIMATE.start_cstrncmp_#t~short3=|v_ULTIMATE.start_cstrncmp_#t~short3_8|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem2, ULTIMATE.start_cstrncmp_#t~post0, ULTIMATE.start_cstrncmp_#t~mem1, ULTIMATE.start_cstrncmp_#t~short3, ULTIMATE.start_cstrncmp_#t~short5] 255#L19 [128] L19-->L19-2: Formula: (not |v_ULTIMATE.start_cstrncmp_#t~short5_4|) InVars {ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_4|} OutVars{ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_4|} AuxVars[] AssignedVars[] 251#L19-2 [119] L19-2-->L19-3: Formula: (and (<= (+ v_ULTIMATE.start_cstrncmp_~s1.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_cstrncmp_~s1.base_6)) (= 1 (select |v_#valid_14| v_ULTIMATE.start_cstrncmp_~s1.base_6)) (= |v_ULTIMATE.start_cstrncmp_#t~mem4_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrncmp_~s1.base_6) v_ULTIMATE.start_cstrncmp_~s1.offset_5)) (<= 0 v_ULTIMATE.start_cstrncmp_~s1.offset_5)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_6, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_5, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_6, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~mem4] 250#L19-3 [208] L19-3-->L19-4: Formula: (and (not |v_ULTIMATE.start_cstrncmp_#t~short5_5|) (< |v_ULTIMATE.start_cstrncmp_#t~mem4_3| 0)) InVars {ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|} OutVars{ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_3|, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_#t~short5] 248#L19-4 [115] L19-4-->L16-8: Formula: (and (= v_ULTIMATE.start_cstrncmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrncmp_~s1.offset_8 1)) (= v_ULTIMATE.start_cstrncmp_~s2.offset_5 (+ v_ULTIMATE.start_cstrncmp_~s2.offset_6 1)) (= v_ULTIMATE.start_cstrncmp_~s1.base_9 v_ULTIMATE.start_cstrncmp_~s1.base_10) (not |v_ULTIMATE.start_cstrncmp_#t~short5_9|) (= v_ULTIMATE.start_cstrncmp_~s2.base_7 v_ULTIMATE.start_cstrncmp_~s2.base_6)) InVars {ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_6, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_7, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_10, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_9|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_8} OutVars{ULTIMATE.start_cstrncmp_~s2.offset=v_ULTIMATE.start_cstrncmp_~s2.offset_5, ULTIMATE.start_cstrncmp_#t~post7.base=|v_ULTIMATE.start_cstrncmp_#t~post7.base_2|, ULTIMATE.start_cstrncmp_~s2.base=v_ULTIMATE.start_cstrncmp_~s2.base_6, ULTIMATE.start_cstrncmp_#t~post6.offset=|v_ULTIMATE.start_cstrncmp_#t~post6.offset_2|, ULTIMATE.start_cstrncmp_#t~mem4=|v_ULTIMATE.start_cstrncmp_#t~mem4_5|, ULTIMATE.start_cstrncmp_#t~post6.base=|v_ULTIMATE.start_cstrncmp_#t~post6.base_2|, ULTIMATE.start_cstrncmp_~s1.base=v_ULTIMATE.start_cstrncmp_~s1.base_9, ULTIMATE.start_cstrncmp_#t~short5=|v_ULTIMATE.start_cstrncmp_#t~short5_8|, ULTIMATE.start_cstrncmp_#t~post7.offset=|v_ULTIMATE.start_cstrncmp_#t~post7.offset_2|, ULTIMATE.start_cstrncmp_~s1.offset=v_ULTIMATE.start_cstrncmp_~s1.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrncmp_~s2.offset, ULTIMATE.start_cstrncmp_#t~post7.base, ULTIMATE.start_cstrncmp_~s2.base, ULTIMATE.start_cstrncmp_#t~post6.offset, ULTIMATE.start_cstrncmp_#t~mem4, ULTIMATE.start_cstrncmp_#t~post6.base, ULTIMATE.start_cstrncmp_~s1.base, ULTIMATE.start_cstrncmp_#t~short5, ULTIMATE.start_cstrncmp_#t~post7.offset, ULTIMATE.start_cstrncmp_~s1.offset] 249#L16-8 [2020-06-22 08:49:23,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:23,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1011605017, now seen corresponding path program 1 times [2020-06-22 08:49:23,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:23,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:23,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:23,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:23,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:23,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:23,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2000633265, now seen corresponding path program 2 times [2020-06-22 08:49:23,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:23,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:23,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:49:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:23,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1786165271, now seen corresponding path program 1 times [2020-06-22 08:49:23,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:49:23,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:49:23,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:23,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:49:23,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:49:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:49:23,175 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2020-06-22 08:49:23,532 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2020-06-22 08:49:23,689 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-06-22 08:49:23,702 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:49:23,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:49:23,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:49:23,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:49:23,704 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:49:23,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:49:23,705 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:49:23,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:49:23,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-06-22 08:49:23,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:49:23,705 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:49:23,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:23,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:23,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:23,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:23,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:23,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:23,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:23,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:23,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:23,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:23,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:23,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:23,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:24,039 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2020-06-22 08:49:24,163 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-06-22 08:49:24,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:24,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:24,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:24,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:24,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:24,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:24,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:24,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:24,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:24,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:24,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:49:24,710 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:49:24,717 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:49:24,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:24,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:24,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:24,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:24,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:24,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:24,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:24,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:24,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:24,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:24,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:24,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:24,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:24,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:24,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:24,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:24,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:24,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:24,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:24,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:24,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:24,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:24,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:24,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:24,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:24,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:24,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:24,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:24,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:24,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:24,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:24,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:24,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:24,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:24,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:49:24,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:49:24,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:49:24,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:24,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:24,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:24,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:24,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:24,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:24,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:49:24,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:49:24,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:49:24,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:49:24,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:49:24,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:49:24,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:49:24,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:49:24,815 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:49:24,842 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-06-22 08:49:24,842 INFO L444 ModelExtractionUtils]: 38 out of 46 variables were initially zero. Simplification set additionally 5 variables to zero. [2020-06-22 08:49:24,845 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:49:24,846 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:49:24,846 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:49:24,847 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_1, ULTIMATE.start_cstrncmp_~s2.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc14.base)_1 - 1*ULTIMATE.start_cstrncmp_~s2.offset Supporting invariants [] [2020-06-22 08:49:24,894 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2020-06-22 08:49:24,898 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:49:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:24,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:49:24,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:24,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:49:24,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:49:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:25,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:49:25,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:25,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:49:25,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:49:25,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:49:25,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:49:25,148 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 08:49:25,153 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2020-06-22 08:49:25,154 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 23 transitions. cyclomatic complexity: 7 Second operand 6 states. [2020-06-22 08:49:25,312 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 23 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 27 states and 35 transitions. Complement of second has 8 states. [2020-06-22 08:49:25,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 08:49:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-22 08:49:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-06-22 08:49:25,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 7 letters. Loop has 10 letters. [2020-06-22 08:49:25,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:25,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 17 letters. Loop has 10 letters. [2020-06-22 08:49:25,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:25,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 7 letters. Loop has 20 letters. [2020-06-22 08:49:25,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:49:25,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2020-06-22 08:49:25,324 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:49:25,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2020-06-22 08:49:25,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 08:49:25,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 08:49:25,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 08:49:25,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:49:25,324 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:49:25,325 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:49:25,325 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:49:25,325 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 08:49:25,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:49:25,325 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:49:25,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 08:49:25,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:49:25 BasicIcfg [2020-06-22 08:49:25,333 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 08:49:25,333 INFO L168 Benchmark]: Toolchain (without parser) took 28069.43 ms. Allocated memory was 649.6 MB in the beginning and 940.6 MB in the end (delta: 291.0 MB). Free memory was 559.5 MB in the beginning and 542.2 MB in the end (delta: 17.3 MB). Peak memory consumption was 308.2 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:25,334 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:49:25,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.92 ms. Allocated memory was 649.6 MB in the beginning and 679.0 MB in the end (delta: 29.4 MB). Free memory was 559.5 MB in the beginning and 642.0 MB in the end (delta: -82.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:25,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.11 ms. Allocated memory is still 679.0 MB. Free memory was 642.0 MB in the beginning and 639.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:25,335 INFO L168 Benchmark]: Boogie Preprocessor took 25.60 ms. Allocated memory is still 679.0 MB. Free memory was 639.8 MB in the beginning and 637.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:25,335 INFO L168 Benchmark]: RCFGBuilder took 346.17 ms. Allocated memory is still 679.0 MB. Free memory was 637.6 MB in the beginning and 613.4 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:25,336 INFO L168 Benchmark]: BlockEncodingV2 took 130.32 ms. Allocated memory is still 679.0 MB. Free memory was 613.4 MB in the beginning and 602.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:25,336 INFO L168 Benchmark]: TraceAbstraction took 24283.10 ms. Allocated memory was 679.0 MB in the beginning and 912.8 MB in the end (delta: 233.8 MB). Free memory was 602.6 MB in the beginning and 584.0 MB in the end (delta: 18.6 MB). Peak memory consumption was 252.4 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:25,337 INFO L168 Benchmark]: BuchiAutomizer took 2933.04 ms. Allocated memory was 912.8 MB in the beginning and 940.6 MB in the end (delta: 27.8 MB). Free memory was 584.0 MB in the beginning and 542.2 MB in the end (delta: 41.7 MB). Peak memory consumption was 69.5 MB. Max. memory is 50.3 GB. [2020-06-22 08:49:25,340 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 43 locations, 51 edges - StatisticsResult: Encoded RCFG 33 locations, 62 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 304.92 ms. Allocated memory was 649.6 MB in the beginning and 679.0 MB in the end (delta: 29.4 MB). Free memory was 559.5 MB in the beginning and 642.0 MB in the end (delta: -82.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.11 ms. Allocated memory is still 679.0 MB. Free memory was 642.0 MB in the beginning and 639.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.60 ms. Allocated memory is still 679.0 MB. Free memory was 639.8 MB in the beginning and 637.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 346.17 ms. Allocated memory is still 679.0 MB. Free memory was 637.6 MB in the beginning and 613.4 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 130.32 ms. Allocated memory is still 679.0 MB. Free memory was 613.4 MB in the beginning and 602.6 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 24283.10 ms. Allocated memory was 679.0 MB in the beginning and 912.8 MB in the end (delta: 233.8 MB). Free memory was 602.6 MB in the beginning and 584.0 MB in the end (delta: 18.6 MB). Peak memory consumption was 252.4 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2933.04 ms. Allocated memory was 912.8 MB in the beginning and 940.6 MB in the end (delta: 27.8 MB). Free memory was 584.0 MB in the beginning and 542.2 MB in the end (delta: 41.7 MB). Peak memory consumption was 69.5 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 40]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 40]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 24]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 41]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2020-06-22 08:49:25,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,354 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,358 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,359 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,360 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,361 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,364 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,365 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,366 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,367 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,368 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:49:25,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:49:25,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((1 == length2 + nondetString2 && 0 == s2) && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[s2]) && unknown-#memory_int-unknown[s2][s2] == 0) && unknown-#length-unknown[nondetString2] == length2) && 0 == s1) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 <= unknown-#length-unknown[s1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[s1]) && 1 == \valid[nondetString2]) || (((((0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && !(nondetString1 == nondetString2)) && (((((((((((0 == s2 && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[s2]) && unknown-#length-unknown[nondetString2] == length2) && 1 <= length2) && 1 <= unknown-#length-unknown[s2]) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 <= unknown-#length-unknown[s1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[s1]) && 1 == \valid[nondetString2]) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) && 0 == s1) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1])) || ((((((((((((((((0 == unknown-#memory_int-unknown[s1][s1] && 0 == s2) && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[s2]) && !(nondetString1 == nondetString2)) && unknown-#length-unknown[nondetString2] == length2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && 1 <= length2) && 0 == s1) && 1 <= unknown-#length-unknown[s2]) && 1 == length1) && 1 == \valid[nondetString1]) && 1 <= unknown-#length-unknown[s1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[s1]) && 1 == \valid[nondetString2])) || ((s2 + 1 <= unknown-#length-unknown[s2] && (((((((0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1] && nondetString1 == 0) && (((((((1 <= n && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[s2]) && 1 <= length2) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[s1]) && 1 <= s1) && 1 == \valid[nondetString2]) && !(nondetString1 == nondetString2)) && nondetString2 == 0) && s1 + 1 <= unknown-#length-unknown[s1]) && unknown-#length-unknown[nondetString2] == length2) && unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1] == 0) && 1 <= s2) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 14 error locations. SAFE Result, 24.1s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 10.1s AutomataDifference, 0.0s DeadEndRemovalTime, 6.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 259 SDtfs, 2251 SDslu, 1223 SDs, 0 SdLazy, 2817 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 455 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 147 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 7 NumberOfFragments, 384 HoareAnnotationTreeSize, 1 FomulaSimplifications, 2488 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 2434 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 667 NumberOfCodeBlocks, 667 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 632 ConstructedInterpolants, 70 QuantifiedInterpolants, 207725 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1190 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 35 InterpolantComputations, 21 PerfectInterpolantSequences, 114/277 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[alloca(length2 * sizeof(char))] + -1 * s2 and consists of 6 locations. 5 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 89 SDslu, 142 SDs, 0 SdLazy, 266 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital227 mio100 ax100 hnf100 lsp89 ukn85 mio100 lsp46 div100 bol100 ite100 ukn100 eq195 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 08:48:54.020 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 08:49:25.610 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check