java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 08:54:59,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 08:54:59,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 08:54:59,574 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 08:54:59,574 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 08:54:59,576 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 08:54:59,577 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 08:54:59,582 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 08:54:59,584 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 08:54:59,585 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 08:54:59,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 08:54:59,588 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 08:54:59,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 08:54:59,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 08:54:59,598 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 08:54:59,601 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 08:54:59,602 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 08:54:59,604 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 08:54:59,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 08:54:59,610 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 08:54:59,612 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 08:54:59,613 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 08:54:59,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 08:54:59,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 08:54:59,619 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 08:54:59,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 08:54:59,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 08:54:59,622 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 08:54:59,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 08:54:59,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 08:54:59,626 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 08:54:59,626 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 08:54:59,626 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 08:54:59,627 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 08:54:59,628 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 08:54:59,629 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 08:54:59,629 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-03 08:54:59,658 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 08:54:59,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 08:54:59,659 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 08:54:59,660 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 08:54:59,660 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 08:54:59,660 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 08:54:59,661 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 08:54:59,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 08:54:59,661 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 08:54:59,661 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 08:54:59,662 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 08:54:59,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 08:54:59,663 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 08:54:59,663 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 08:54:59,663 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 08:54:59,663 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 08:54:59,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 08:54:59,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 08:54:59,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 08:54:59,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 08:54:59,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 08:54:59,665 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 08:54:59,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:54:59,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 08:54:59,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 08:54:59,666 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 08:54:59,666 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 08:54:59,667 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 08:54:59,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 08:54:59,667 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 08:54:59,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 08:54:59,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 08:54:59,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 08:54:59,754 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 08:54:59,755 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 08:54:59,756 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2018-10-03 08:54:59,756 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2018-10-03 08:54:59,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 08:54:59,839 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 08:54:59,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 08:54:59,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 08:54:59,840 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 08:54:59,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:59" (1/1) ... [2018-10-03 08:54:59,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:59" (1/1) ... [2018-10-03 08:54:59,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 08:54:59,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 08:54:59,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 08:54:59,912 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 08:54:59,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:59" (1/1) ... [2018-10-03 08:54:59,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:59" (1/1) ... [2018-10-03 08:54:59,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:59" (1/1) ... [2018-10-03 08:54:59,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:59" (1/1) ... [2018-10-03 08:54:59,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:59" (1/1) ... [2018-10-03 08:54:59,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:59" (1/1) ... [2018-10-03 08:54:59,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:59" (1/1) ... [2018-10-03 08:54:59,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 08:54:59,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 08:54:59,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 08:54:59,947 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 08:54:59,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:55:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 08:55:00,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 08:55:00,328 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 08:55:00,329 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:55:00 BoogieIcfgContainer [2018-10-03 08:55:00,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 08:55:00,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 08:55:00,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 08:55:00,334 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 08:55:00,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 08:54:59" (1/2) ... [2018-10-03 08:55:00,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc1ea2a and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 08:55:00, skipping insertion in model container [2018-10-03 08:55:00,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 08:55:00" (2/2) ... [2018-10-03 08:55:00,338 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2018-10-03 08:55:00,347 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 08:55:00,356 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-10-03 08:55:00,406 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 08:55:00,407 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 08:55:00,407 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 08:55:00,407 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 08:55:00,407 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 08:55:00,408 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 08:55:00,408 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 08:55:00,408 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 08:55:00,408 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 08:55:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-10-03 08:55:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-03 08:55:00,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:00,431 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-03 08:55:00,432 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:00,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:00,438 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2018-10-03 08:55:00,440 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:00,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:00,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:00,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:00,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:00,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:55:00,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:55:00,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 08:55:00,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 08:55:00,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-03 08:55:00,760 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2018-10-03 08:55:00,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:00,900 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-10-03 08:55:00,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-03 08:55:00,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-03 08:55:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:00,918 INFO L225 Difference]: With dead ends: 24 [2018-10-03 08:55:00,918 INFO L226 Difference]: Without dead ends: 11 [2018-10-03 08:55:00,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:55:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-03 08:55:00,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-10-03 08:55:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-03 08:55:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-10-03 08:55:00,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-10-03 08:55:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:00,959 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-03 08:55:00,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 08:55:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-03 08:55:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-03 08:55:00,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:00,960 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-03 08:55:00,961 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:00,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:00,961 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2018-10-03 08:55:00,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:00,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:00,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:00,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:00,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:01,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:55:01,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:55:01,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 08:55:01,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 08:55:01,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-03 08:55:01,124 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-10-03 08:55:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:01,318 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-10-03 08:55:01,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-03 08:55:01,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-03 08:55:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:01,320 INFO L225 Difference]: With dead ends: 18 [2018-10-03 08:55:01,320 INFO L226 Difference]: Without dead ends: 17 [2018-10-03 08:55:01,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:55:01,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-03 08:55:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-10-03 08:55:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-03 08:55:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-10-03 08:55:01,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2018-10-03 08:55:01,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:01,328 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-10-03 08:55:01,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 08:55:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-10-03 08:55:01,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-03 08:55:01,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:01,329 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:55:01,329 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:01,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:01,329 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2018-10-03 08:55:01,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:01,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:01,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:01,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:01,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:01,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:55:01,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:55:01,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:55:01,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:55:01,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:55:01,371 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2018-10-03 08:55:01,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:01,390 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-10-03 08:55:01,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:55:01,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-03 08:55:01,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:01,391 INFO L225 Difference]: With dead ends: 19 [2018-10-03 08:55:01,391 INFO L226 Difference]: Without dead ends: 12 [2018-10-03 08:55:01,392 INFO L605 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 [2018-10-03 08:55:01,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-03 08:55:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-03 08:55:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-03 08:55:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-03 08:55:01,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-10-03 08:55:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:01,400 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-03 08:55:01,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:55:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-03 08:55:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 08:55:01,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:01,401 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-10-03 08:55:01,403 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:01,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:01,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2018-10-03 08:55:01,404 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:01,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:01,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:01,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:01,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:01,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:01,594 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-10-03 08:55:01,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:01,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:01,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:01,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:01,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:01,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:01,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:01,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-03 08:55:01,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 08:55:01,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 08:55:01,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-03 08:55:01,926 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-10-03 08:55:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:02,225 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-03 08:55:02,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-03 08:55:02,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-03 08:55:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:02,228 INFO L225 Difference]: With dead ends: 21 [2018-10-03 08:55:02,228 INFO L226 Difference]: Without dead ends: 20 [2018-10-03 08:55:02,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-03 08:55:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-03 08:55:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-10-03 08:55:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-03 08:55:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-03 08:55:02,235 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2018-10-03 08:55:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:02,235 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-03 08:55:02,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 08:55:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-03 08:55:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-03 08:55:02,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:02,237 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2018-10-03 08:55:02,237 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:02,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2018-10-03 08:55:02,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:02,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:02,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:02,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:02,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:02,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:02,350 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-10-03 08:55:02,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:55:02,385 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:55:02,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:02,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:02,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:02,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:02,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:02,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:02,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:02,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-03 08:55:02,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-03 08:55:02,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-03 08:55:02,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-03 08:55:02,666 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-10-03 08:55:03,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:03,067 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-03 08:55:03,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-03 08:55:03,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-10-03 08:55:03,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:03,068 INFO L225 Difference]: With dead ends: 26 [2018-10-03 08:55:03,068 INFO L226 Difference]: Without dead ends: 25 [2018-10-03 08:55:03,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-10-03 08:55:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-03 08:55:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-03 08:55:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-03 08:55:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-03 08:55:03,074 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2018-10-03 08:55:03,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:03,075 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-03 08:55:03,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-03 08:55:03,075 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-03 08:55:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-03 08:55:03,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:03,076 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2018-10-03 08:55:03,077 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:03,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:03,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2018-10-03 08:55:03,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:03,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:03,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:03,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:03,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:03,255 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:03,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:03,256 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-10-03 08:55:03,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:55:03,298 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-03 08:55:03,298 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:03,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:03,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:03,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:03,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:03,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:03,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:03,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-03 08:55:03,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-03 08:55:03,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-03 08:55:03,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-03 08:55:03,468 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2018-10-03 08:55:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:03,713 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-03 08:55:03,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-03 08:55:03,714 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-10-03 08:55:03,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:03,714 INFO L225 Difference]: With dead ends: 31 [2018-10-03 08:55:03,715 INFO L226 Difference]: Without dead ends: 30 [2018-10-03 08:55:03,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-10-03 08:55:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-03 08:55:03,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-10-03 08:55:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-03 08:55:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-03 08:55:03,721 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2018-10-03 08:55:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:03,722 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-03 08:55:03,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-03 08:55:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-03 08:55:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-03 08:55:03,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:03,723 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2018-10-03 08:55:03,723 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:03,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:03,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2018-10-03 08:55:03,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:03,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:03,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:03,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:03,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:03,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:03,926 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-10-03 08:55:03,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:55:03,985 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:55:03,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:03,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:04,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:04,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:04,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:04,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:04,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:04,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-03 08:55:04,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 08:55:04,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 08:55:04,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-03 08:55:04,175 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-03 08:55:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:04,544 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-03 08:55:04,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 08:55:04,544 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-03 08:55:04,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:04,546 INFO L225 Difference]: With dead ends: 36 [2018-10-03 08:55:04,546 INFO L226 Difference]: Without dead ends: 35 [2018-10-03 08:55:04,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2018-10-03 08:55:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-03 08:55:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-10-03 08:55:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-03 08:55:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-03 08:55:04,553 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2018-10-03 08:55:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:04,554 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-03 08:55:04,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 08:55:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-03 08:55:04,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-03 08:55:04,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:04,555 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2018-10-03 08:55:04,555 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:04,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:04,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2018-10-03 08:55:04,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:04,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:04,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:04,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:04,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:04,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:04,712 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-10-03 08:55:04,721 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:55:04,755 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-03 08:55:04,755 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:04,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:04,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:04,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:04,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:04,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:04,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:04,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-03 08:55:04,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-03 08:55:04,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-03 08:55:04,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-10-03 08:55:04,979 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2018-10-03 08:55:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:05,562 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-03 08:55:05,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-03 08:55:05,563 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-10-03 08:55:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:05,564 INFO L225 Difference]: With dead ends: 41 [2018-10-03 08:55:05,564 INFO L226 Difference]: Without dead ends: 40 [2018-10-03 08:55:05,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-10-03 08:55:05,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-03 08:55:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-10-03 08:55:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-03 08:55:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-03 08:55:05,573 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2018-10-03 08:55:05,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:05,573 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-03 08:55:05,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-03 08:55:05,573 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-03 08:55:05,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-03 08:55:05,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:05,575 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2018-10-03 08:55:05,575 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:05,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:05,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2018-10-03 08:55:05,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:05,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:05,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:05,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:05,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:06,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:06,055 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-10-03 08:55:06,070 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:55:06,146 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-03 08:55:06,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:06,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:06,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:06,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:06,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:06,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:06,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:06,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-03 08:55:06,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 08:55:06,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 08:55:06,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-10-03 08:55:06,441 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2018-10-03 08:55:06,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:06,888 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-03 08:55:06,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-03 08:55:06,888 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-10-03 08:55:06,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:06,889 INFO L225 Difference]: With dead ends: 46 [2018-10-03 08:55:06,889 INFO L226 Difference]: Without dead ends: 45 [2018-10-03 08:55:06,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2018-10-03 08:55:06,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-03 08:55:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-10-03 08:55:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-03 08:55:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-03 08:55:06,899 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2018-10-03 08:55:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:06,899 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-03 08:55:06,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 08:55:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-03 08:55:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-03 08:55:06,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:06,901 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2018-10-03 08:55:06,901 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:06,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:06,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2018-10-03 08:55:06,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:06,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:06,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:07,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:07,103 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-10-03 08:55:07,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:07,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:07,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:07,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:07,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:07,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:07,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:07,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-03 08:55:07,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-03 08:55:07,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-03 08:55:07,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-10-03 08:55:07,701 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2018-10-03 08:55:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:08,032 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-03 08:55:08,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-03 08:55:08,040 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-10-03 08:55:08,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:08,041 INFO L225 Difference]: With dead ends: 51 [2018-10-03 08:55:08,041 INFO L226 Difference]: Without dead ends: 50 [2018-10-03 08:55:08,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2018-10-03 08:55:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-03 08:55:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-10-03 08:55:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-03 08:55:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-03 08:55:08,050 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2018-10-03 08:55:08,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:08,050 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-03 08:55:08,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-03 08:55:08,050 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-03 08:55:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-03 08:55:08,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:08,052 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2018-10-03 08:55:08,052 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:08,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:08,052 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2018-10-03 08:55:08,052 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:08,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:08,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:08,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:08,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:08,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:08,993 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-10-03 08:55:09,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:55:09,057 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:55:09,058 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:09,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:09,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:09,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:09,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:09,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:09,309 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:09,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:09,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-03 08:55:09,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-03 08:55:09,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-03 08:55:09,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-10-03 08:55:09,334 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2018-10-03 08:55:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:09,744 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-03 08:55:09,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 08:55:09,745 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-10-03 08:55:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:09,746 INFO L225 Difference]: With dead ends: 56 [2018-10-03 08:55:09,746 INFO L226 Difference]: Without dead ends: 55 [2018-10-03 08:55:09,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2018-10-03 08:55:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-03 08:55:09,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-10-03 08:55:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-03 08:55:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-03 08:55:09,756 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2018-10-03 08:55:09,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:09,756 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-03 08:55:09,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-03 08:55:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-03 08:55:09,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-03 08:55:09,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:09,757 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2018-10-03 08:55:09,757 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:09,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:09,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2018-10-03 08:55:09,758 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:09,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:09,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:09,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:09,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:10,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:10,120 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:10,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:55:10,178 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-03 08:55:10,179 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:10,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:10,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:10,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:10,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:10,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:10,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:10,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-03 08:55:10,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-03 08:55:10,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-03 08:55:10,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-10-03 08:55:10,470 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2018-10-03 08:55:10,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:10,951 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-03 08:55:10,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-03 08:55:10,951 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-10-03 08:55:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:10,953 INFO L225 Difference]: With dead ends: 61 [2018-10-03 08:55:10,953 INFO L226 Difference]: Without dead ends: 60 [2018-10-03 08:55:10,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-10-03 08:55:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-03 08:55:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-10-03 08:55:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-03 08:55:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-03 08:55:10,970 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2018-10-03 08:55:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:10,971 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-03 08:55:10,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-03 08:55:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-03 08:55:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-03 08:55:10,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:10,973 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2018-10-03 08:55:10,973 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:10,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2018-10-03 08:55:10,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:10,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:10,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:10,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:10,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:11,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:11,262 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:11,273 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:55:11,313 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:55:11,313 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:11,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:11,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:11,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:11,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:11,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:11,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:11,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-03 08:55:11,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-03 08:55:11,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-03 08:55:11,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-10-03 08:55:11,843 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-10-03 08:55:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:12,322 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-03 08:55:12,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-03 08:55:12,323 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-10-03 08:55:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:12,324 INFO L225 Difference]: With dead ends: 66 [2018-10-03 08:55:12,324 INFO L226 Difference]: Without dead ends: 65 [2018-10-03 08:55:12,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=467, Invalid=865, Unknown=0, NotChecked=0, Total=1332 [2018-10-03 08:55:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-03 08:55:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-10-03 08:55:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-03 08:55:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-03 08:55:12,335 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2018-10-03 08:55:12,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:12,336 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-03 08:55:12,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-03 08:55:12,336 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-03 08:55:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-03 08:55:12,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:12,337 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2018-10-03 08:55:12,337 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:12,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:12,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2018-10-03 08:55:12,338 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:12,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:12,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:12,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:12,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:12,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:12,866 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:12,873 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:55:12,955 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-03 08:55:12,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:12,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:12,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:12,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:12,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:12,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:13,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:13,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-03 08:55:13,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-03 08:55:13,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-03 08:55:13,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-10-03 08:55:13,263 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2018-10-03 08:55:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:13,785 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-03 08:55:13,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-03 08:55:13,787 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-10-03 08:55:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:13,788 INFO L225 Difference]: With dead ends: 71 [2018-10-03 08:55:13,788 INFO L226 Difference]: Without dead ends: 70 [2018-10-03 08:55:13,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=545, Invalid=1015, Unknown=0, NotChecked=0, Total=1560 [2018-10-03 08:55:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-03 08:55:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-10-03 08:55:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-03 08:55:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-03 08:55:13,799 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2018-10-03 08:55:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:13,800 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-03 08:55:13,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-03 08:55:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-03 08:55:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-03 08:55:13,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:13,801 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2018-10-03 08:55:13,801 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:13,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:13,801 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2018-10-03 08:55:13,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:13,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:13,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:13,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:13,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:14,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:14,107 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:14,118 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:55:14,175 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-03 08:55:14,175 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:14,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:14,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:14,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:14,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:14,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:14,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:14,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-03 08:55:14,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-03 08:55:14,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-03 08:55:14,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2018-10-03 08:55:14,485 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2018-10-03 08:55:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:14,994 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-03 08:55:14,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 08:55:14,994 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-10-03 08:55:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:14,995 INFO L225 Difference]: With dead ends: 76 [2018-10-03 08:55:14,995 INFO L226 Difference]: Without dead ends: 75 [2018-10-03 08:55:14,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=629, Invalid=1177, Unknown=0, NotChecked=0, Total=1806 [2018-10-03 08:55:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-03 08:55:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-10-03 08:55:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-03 08:55:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-03 08:55:15,007 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2018-10-03 08:55:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:15,008 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-03 08:55:15,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-03 08:55:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-03 08:55:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-03 08:55:15,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:15,010 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2018-10-03 08:55:15,010 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:15,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:15,010 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2018-10-03 08:55:15,010 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:15,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:15,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:15,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:15,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:15,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:15,428 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:15,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:15,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:15,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:15,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:15,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:15,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:15,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:15,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-03 08:55:15,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-03 08:55:15,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-03 08:55:15,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-10-03 08:55:15,869 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2018-10-03 08:55:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:16,533 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-03 08:55:16,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-03 08:55:16,533 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-10-03 08:55:16,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:16,534 INFO L225 Difference]: With dead ends: 81 [2018-10-03 08:55:16,534 INFO L226 Difference]: Without dead ends: 80 [2018-10-03 08:55:16,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=719, Invalid=1351, Unknown=0, NotChecked=0, Total=2070 [2018-10-03 08:55:16,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-03 08:55:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-10-03 08:55:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-03 08:55:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-03 08:55:16,546 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2018-10-03 08:55:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:16,546 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-03 08:55:16,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-03 08:55:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-03 08:55:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-03 08:55:16,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:16,547 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2018-10-03 08:55:16,548 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:16,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:16,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2018-10-03 08:55:16,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:16,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:16,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:16,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:16,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:16,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:16,946 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:16,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:55:17,010 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:55:17,011 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:17,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:17,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:17,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:17,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:17,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:17,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:17,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-03 08:55:17,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-03 08:55:17,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-03 08:55:17,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2018-10-03 08:55:17,386 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2018-10-03 08:55:17,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:17,904 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-03 08:55:17,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-03 08:55:17,905 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2018-10-03 08:55:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:17,906 INFO L225 Difference]: With dead ends: 86 [2018-10-03 08:55:17,906 INFO L226 Difference]: Without dead ends: 85 [2018-10-03 08:55:17,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=815, Invalid=1537, Unknown=0, NotChecked=0, Total=2352 [2018-10-03 08:55:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-03 08:55:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-10-03 08:55:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-03 08:55:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-03 08:55:17,916 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2018-10-03 08:55:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:17,916 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-03 08:55:17,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-03 08:55:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-03 08:55:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-03 08:55:17,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:17,917 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2018-10-03 08:55:17,917 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:17,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:17,918 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2018-10-03 08:55:17,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:17,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:17,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:17,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:18,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:18,653 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:18,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:55:18,749 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-03 08:55:18,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:18,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:18,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:18,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:18,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:18,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:19,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:19,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-03 08:55:19,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-03 08:55:19,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-03 08:55:19,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2018-10-03 08:55:19,398 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2018-10-03 08:55:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:19,990 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-03 08:55:19,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-03 08:55:19,990 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2018-10-03 08:55:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:19,992 INFO L225 Difference]: With dead ends: 91 [2018-10-03 08:55:19,992 INFO L226 Difference]: Without dead ends: 90 [2018-10-03 08:55:19,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=917, Invalid=1735, Unknown=0, NotChecked=0, Total=2652 [2018-10-03 08:55:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-03 08:55:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-10-03 08:55:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-03 08:55:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-03 08:55:20,008 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2018-10-03 08:55:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:20,008 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-03 08:55:20,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-03 08:55:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-03 08:55:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-03 08:55:20,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:20,009 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2018-10-03 08:55:20,009 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:20,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2018-10-03 08:55:20,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:20,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:20,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:20,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:20,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:21,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:21,530 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:21,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:55:21,603 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:55:21,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:21,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:21,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:21,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:21,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:21,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:22,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:22,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-03 08:55:22,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-03 08:55:22,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-03 08:55:22,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2018-10-03 08:55:22,212 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2018-10-03 08:55:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:22,800 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-03 08:55:22,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-03 08:55:22,801 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2018-10-03 08:55:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:22,802 INFO L225 Difference]: With dead ends: 96 [2018-10-03 08:55:22,802 INFO L226 Difference]: Without dead ends: 95 [2018-10-03 08:55:22,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1025, Invalid=1945, Unknown=0, NotChecked=0, Total=2970 [2018-10-03 08:55:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-03 08:55:22,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-10-03 08:55:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-03 08:55:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-03 08:55:22,815 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2018-10-03 08:55:22,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:22,816 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-03 08:55:22,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-03 08:55:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-03 08:55:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-03 08:55:22,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:22,817 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2018-10-03 08:55:22,817 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:22,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:22,817 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2018-10-03 08:55:22,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:22,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:22,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:22,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:22,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:23,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:23,198 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:23,207 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:55:23,290 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-03 08:55:23,290 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:23,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:23,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:23,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:23,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:23,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:23,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:23,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-03 08:55:23,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-03 08:55:23,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-03 08:55:23,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2018-10-03 08:55:23,661 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2018-10-03 08:55:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:24,295 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-03 08:55:24,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-03 08:55:24,295 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2018-10-03 08:55:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:24,296 INFO L225 Difference]: With dead ends: 101 [2018-10-03 08:55:24,296 INFO L226 Difference]: Without dead ends: 100 [2018-10-03 08:55:24,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1139, Invalid=2167, Unknown=0, NotChecked=0, Total=3306 [2018-10-03 08:55:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-03 08:55:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-10-03 08:55:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-03 08:55:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-03 08:55:24,308 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2018-10-03 08:55:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:24,309 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-03 08:55:24,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-03 08:55:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-03 08:55:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-03 08:55:24,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:24,310 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2018-10-03 08:55:24,310 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:24,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:24,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2018-10-03 08:55:24,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:24,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:24,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:24,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:24,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:24,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:24,721 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:24,728 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:55:24,857 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-03 08:55:24,857 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:24,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:24,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:24,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:24,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:24,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:25,309 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:25,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:25,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-03 08:55:25,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-03 08:55:25,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-03 08:55:25,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2018-10-03 08:55:25,331 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2018-10-03 08:55:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:26,070 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-03 08:55:26,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-03 08:55:26,071 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2018-10-03 08:55:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:26,072 INFO L225 Difference]: With dead ends: 106 [2018-10-03 08:55:26,072 INFO L226 Difference]: Without dead ends: 105 [2018-10-03 08:55:26,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1259, Invalid=2401, Unknown=0, NotChecked=0, Total=3660 [2018-10-03 08:55:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-03 08:55:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-10-03 08:55:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-03 08:55:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-03 08:55:26,084 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2018-10-03 08:55:26,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:26,085 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-03 08:55:26,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-03 08:55:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-03 08:55:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-03 08:55:26,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:26,086 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2018-10-03 08:55:26,086 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:26,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:26,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2018-10-03 08:55:26,086 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:26,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:26,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:26,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:26,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:27,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:27,330 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:27,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:27,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:27,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:27,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:27,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:27,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:27,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:27,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-03 08:55:27,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-03 08:55:27,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-03 08:55:27,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2018-10-03 08:55:27,835 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2018-10-03 08:55:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:28,525 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-03 08:55:28,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 08:55:28,526 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2018-10-03 08:55:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:28,527 INFO L225 Difference]: With dead ends: 111 [2018-10-03 08:55:28,527 INFO L226 Difference]: Without dead ends: 110 [2018-10-03 08:55:28,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1385, Invalid=2647, Unknown=0, NotChecked=0, Total=4032 [2018-10-03 08:55:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-03 08:55:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2018-10-03 08:55:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-03 08:55:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-03 08:55:28,540 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2018-10-03 08:55:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:28,541 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-03 08:55:28,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-03 08:55:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-03 08:55:28,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-03 08:55:28,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:28,541 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2018-10-03 08:55:28,542 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:28,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:28,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2018-10-03 08:55:28,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:28,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:28,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:28,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:28,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:28,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:28,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:28,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:55:29,026 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:55:29,027 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:29,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:29,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:29,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:29,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:29,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:30,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:30,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-03 08:55:30,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-03 08:55:30,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-03 08:55:30,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2018-10-03 08:55:30,839 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2018-10-03 08:55:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:31,619 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-03 08:55:31,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-03 08:55:31,620 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2018-10-03 08:55:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:31,621 INFO L225 Difference]: With dead ends: 116 [2018-10-03 08:55:31,621 INFO L226 Difference]: Without dead ends: 115 [2018-10-03 08:55:31,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1517, Invalid=2905, Unknown=0, NotChecked=0, Total=4422 [2018-10-03 08:55:31,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-03 08:55:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-10-03 08:55:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-03 08:55:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-03 08:55:31,637 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2018-10-03 08:55:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:31,638 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-03 08:55:31,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-03 08:55:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-03 08:55:31,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-03 08:55:31,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:31,639 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2018-10-03 08:55:31,639 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:31,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:31,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2018-10-03 08:55:31,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:31,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:31,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:31,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:31,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:32,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:32,402 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:32,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:55:32,573 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-03 08:55:32,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:32,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:32,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:32,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:32,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:32,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:33,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:33,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-03 08:55:33,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-03 08:55:33,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-03 08:55:33,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2018-10-03 08:55:33,226 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2018-10-03 08:55:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:34,181 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-03 08:55:34,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-03 08:55:34,182 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2018-10-03 08:55:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:34,183 INFO L225 Difference]: With dead ends: 121 [2018-10-03 08:55:34,183 INFO L226 Difference]: Without dead ends: 120 [2018-10-03 08:55:34,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1655, Invalid=3175, Unknown=0, NotChecked=0, Total=4830 [2018-10-03 08:55:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-03 08:55:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-10-03 08:55:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-03 08:55:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-03 08:55:34,200 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2018-10-03 08:55:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:34,200 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-03 08:55:34,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-03 08:55:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-03 08:55:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-03 08:55:34,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:34,201 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2018-10-03 08:55:34,201 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:34,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:34,201 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2018-10-03 08:55:34,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:34,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:34,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:34,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:34,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:35,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:35,280 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:35,288 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:55:35,371 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:55:35,371 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:35,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:35,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:35,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:35,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:35,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:35,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:35,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-03 08:55:35,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-03 08:55:35,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-03 08:55:35,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2018-10-03 08:55:35,920 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2018-10-03 08:55:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:36,891 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-03 08:55:36,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-03 08:55:36,891 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2018-10-03 08:55:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:36,892 INFO L225 Difference]: With dead ends: 126 [2018-10-03 08:55:36,892 INFO L226 Difference]: Without dead ends: 125 [2018-10-03 08:55:36,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1799, Invalid=3457, Unknown=0, NotChecked=0, Total=5256 [2018-10-03 08:55:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-03 08:55:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-10-03 08:55:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-03 08:55:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-03 08:55:36,908 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2018-10-03 08:55:36,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:36,908 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-03 08:55:36,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-03 08:55:36,908 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-03 08:55:36,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-03 08:55:36,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:36,909 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2018-10-03 08:55:36,909 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:36,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:36,909 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2018-10-03 08:55:36,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:36,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:36,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:36,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:36,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:37,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:37,481 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:37,488 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:55:37,608 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-03 08:55:37,608 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:37,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:37,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:37,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:37,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:37,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:38,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:38,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-03 08:55:38,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-03 08:55:38,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-03 08:55:38,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2018-10-03 08:55:38,273 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2018-10-03 08:55:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:39,289 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-03 08:55:39,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-03 08:55:39,290 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2018-10-03 08:55:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:39,290 INFO L225 Difference]: With dead ends: 131 [2018-10-03 08:55:39,290 INFO L226 Difference]: Without dead ends: 130 [2018-10-03 08:55:39,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1949, Invalid=3751, Unknown=0, NotChecked=0, Total=5700 [2018-10-03 08:55:39,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-03 08:55:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-10-03 08:55:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-03 08:55:39,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-03 08:55:39,306 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2018-10-03 08:55:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:39,306 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-03 08:55:39,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-03 08:55:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-03 08:55:39,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-03 08:55:39,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:39,307 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2018-10-03 08:55:39,307 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:39,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:39,307 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2018-10-03 08:55:39,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:39,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:39,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:39,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:39,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:40,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:40,042 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:40,050 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:55:40,178 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-03 08:55:40,179 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:40,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:40,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:40,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:40,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:40,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:40,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:40,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-03 08:55:40,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-03 08:55:40,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-03 08:55:40,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2018-10-03 08:55:40,774 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2018-10-03 08:55:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:41,719 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-03 08:55:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-03 08:55:41,719 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2018-10-03 08:55:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:41,720 INFO L225 Difference]: With dead ends: 136 [2018-10-03 08:55:41,720 INFO L226 Difference]: Without dead ends: 135 [2018-10-03 08:55:41,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2105, Invalid=4057, Unknown=0, NotChecked=0, Total=6162 [2018-10-03 08:55:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-03 08:55:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-10-03 08:55:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-03 08:55:41,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-03 08:55:41,741 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2018-10-03 08:55:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:41,741 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-03 08:55:41,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-03 08:55:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-03 08:55:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-03 08:55:41,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:41,742 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2018-10-03 08:55:41,743 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:41,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:41,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2018-10-03 08:55:41,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:41,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:41,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:42,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:42,650 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:42,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:42,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:42,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:42,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:42,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:42,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:43,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:43,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-03 08:55:43,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-03 08:55:43,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-03 08:55:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1136, Invalid=1944, Unknown=0, NotChecked=0, Total=3080 [2018-10-03 08:55:43,364 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2018-10-03 08:55:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:44,459 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-03 08:55:44,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-03 08:55:44,460 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2018-10-03 08:55:44,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:44,461 INFO L225 Difference]: With dead ends: 141 [2018-10-03 08:55:44,461 INFO L226 Difference]: Without dead ends: 140 [2018-10-03 08:55:44,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2267, Invalid=4375, Unknown=0, NotChecked=0, Total=6642 [2018-10-03 08:55:44,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-03 08:55:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-10-03 08:55:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-03 08:55:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-03 08:55:44,485 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2018-10-03 08:55:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:44,486 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-03 08:55:44,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-03 08:55:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-03 08:55:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-03 08:55:44,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:44,487 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2018-10-03 08:55:44,487 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:44,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2018-10-03 08:55:44,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:44,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:44,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:44,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:55:44,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:45,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:45,146 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:45,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:55:45,243 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:55:45,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:45,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:45,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:45,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:45,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:45,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:46,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:46,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-03 08:55:46,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-03 08:55:46,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-03 08:55:46,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1220, Invalid=2086, Unknown=0, NotChecked=0, Total=3306 [2018-10-03 08:55:46,982 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2018-10-03 08:55:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:48,238 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-03 08:55:48,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-03 08:55:48,239 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2018-10-03 08:55:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:48,240 INFO L225 Difference]: With dead ends: 146 [2018-10-03 08:55:48,240 INFO L226 Difference]: Without dead ends: 145 [2018-10-03 08:55:48,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2435, Invalid=4705, Unknown=0, NotChecked=0, Total=7140 [2018-10-03 08:55:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-03 08:55:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2018-10-03 08:55:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-03 08:55:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-03 08:55:48,267 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2018-10-03 08:55:48,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:48,268 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-03 08:55:48,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-03 08:55:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-03 08:55:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-03 08:55:48,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:48,269 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2018-10-03 08:55:48,269 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:48,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2018-10-03 08:55:48,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:48,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:48,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:48,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:48,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:48,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:48,859 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:48,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:55:49,019 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-03 08:55:49,019 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:49,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:49,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:49,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:49,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:49,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:49,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:49,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-03 08:55:49,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-03 08:55:49,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-03 08:55:49,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1307, Invalid=2233, Unknown=0, NotChecked=0, Total=3540 [2018-10-03 08:55:49,734 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2018-10-03 08:55:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:50,931 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-03 08:55:50,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-03 08:55:50,933 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2018-10-03 08:55:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:50,934 INFO L225 Difference]: With dead ends: 151 [2018-10-03 08:55:50,934 INFO L226 Difference]: Without dead ends: 150 [2018-10-03 08:55:50,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2609, Invalid=5047, Unknown=0, NotChecked=0, Total=7656 [2018-10-03 08:55:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-03 08:55:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-10-03 08:55:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-03 08:55:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-03 08:55:50,963 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2018-10-03 08:55:50,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:50,963 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-03 08:55:50,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-03 08:55:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-03 08:55:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-03 08:55:50,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:50,965 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2018-10-03 08:55:50,965 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:50,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:50,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2018-10-03 08:55:50,965 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:50,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:50,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:50,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:50,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:51,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:51,678 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:51,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:55:51,789 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:55:51,790 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:51,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:51,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:51,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:51,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:51,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:52,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:52,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-03 08:55:52,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-03 08:55:52,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-03 08:55:52,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=2385, Unknown=0, NotChecked=0, Total=3782 [2018-10-03 08:55:52,923 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2018-10-03 08:55:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:54,193 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-03 08:55:54,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-03 08:55:54,194 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2018-10-03 08:55:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:54,195 INFO L225 Difference]: With dead ends: 156 [2018-10-03 08:55:54,195 INFO L226 Difference]: Without dead ends: 155 [2018-10-03 08:55:54,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2789, Invalid=5401, Unknown=0, NotChecked=0, Total=8190 [2018-10-03 08:55:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-03 08:55:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-10-03 08:55:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-03 08:55:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-03 08:55:54,216 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2018-10-03 08:55:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:54,216 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-03 08:55:54,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-03 08:55:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-03 08:55:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-03 08:55:54,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:54,217 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2018-10-03 08:55:54,217 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:54,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:54,217 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2018-10-03 08:55:54,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:54,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:54,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:54,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:54,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:55,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:55,208 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:55,220 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:55:55,367 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-03 08:55:55,367 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:55,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:55,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:55,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:55,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:55,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:56,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:56,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-03 08:55:56,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-03 08:55:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-03 08:55:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=2542, Unknown=0, NotChecked=0, Total=4032 [2018-10-03 08:55:56,422 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2018-10-03 08:55:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:55:57,969 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-03 08:55:57,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-03 08:55:57,969 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2018-10-03 08:55:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:55:57,970 INFO L225 Difference]: With dead ends: 161 [2018-10-03 08:55:57,970 INFO L226 Difference]: Without dead ends: 160 [2018-10-03 08:55:57,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2975, Invalid=5767, Unknown=0, NotChecked=0, Total=8742 [2018-10-03 08:55:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-03 08:55:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2018-10-03 08:55:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-03 08:55:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-03 08:55:57,998 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2018-10-03 08:55:57,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:55:57,999 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-03 08:55:57,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-03 08:55:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-03 08:55:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-03 08:55:58,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:55:58,000 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2018-10-03 08:55:58,000 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:55:58,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:55:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2018-10-03 08:55:58,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:55:58,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:55:58,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:58,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:55:58,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:55:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:55:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:58,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:55:58,808 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:55:58,816 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:55:58,989 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-03 08:55:58,989 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:55:58,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:55:58,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:55:58,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:55:59,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:55:59,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:55:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:55:59,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:55:59,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-03 08:55:59,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-03 08:55:59,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-03 08:55:59,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1586, Invalid=2704, Unknown=0, NotChecked=0, Total=4290 [2018-10-03 08:55:59,781 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2018-10-03 08:56:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:01,143 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-03 08:56:01,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-03 08:56:01,143 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2018-10-03 08:56:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:01,144 INFO L225 Difference]: With dead ends: 166 [2018-10-03 08:56:01,144 INFO L226 Difference]: Without dead ends: 165 [2018-10-03 08:56:01,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3167, Invalid=6145, Unknown=0, NotChecked=0, Total=9312 [2018-10-03 08:56:01,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-03 08:56:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2018-10-03 08:56:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-03 08:56:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-03 08:56:01,171 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2018-10-03 08:56:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:01,171 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-03 08:56:01,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-03 08:56:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-03 08:56:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-03 08:56:01,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:01,172 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2018-10-03 08:56:01,173 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:56:01,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:01,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2018-10-03 08:56:01,173 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:01,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:01,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:01,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:01,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:02,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:02,140 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:56:02,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:56:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:02,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:02,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:02,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:02,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:02,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:03,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:03,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-03 08:56:03,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-03 08:56:03,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-03 08:56:03,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=2871, Unknown=0, NotChecked=0, Total=4556 [2018-10-03 08:56:03,443 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2018-10-03 08:56:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:05,438 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-03 08:56:05,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-03 08:56:05,438 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2018-10-03 08:56:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:05,439 INFO L225 Difference]: With dead ends: 171 [2018-10-03 08:56:05,439 INFO L226 Difference]: Without dead ends: 170 [2018-10-03 08:56:05,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3365, Invalid=6535, Unknown=0, NotChecked=0, Total=9900 [2018-10-03 08:56:05,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-03 08:56:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2018-10-03 08:56:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-03 08:56:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-03 08:56:05,473 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2018-10-03 08:56:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:05,474 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-03 08:56:05,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-03 08:56:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-03 08:56:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-03 08:56:05,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:05,475 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2018-10-03 08:56:05,476 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:56:05,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:05,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2018-10-03 08:56:05,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:05,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:05,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:05,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:56:05,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:07,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:07,247 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:56:07,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:56:07,366 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:56:07,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:07,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:07,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:07,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:07,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:07,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:08,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:08,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-03 08:56:08,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-03 08:56:08,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-03 08:56:08,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1787, Invalid=3043, Unknown=0, NotChecked=0, Total=4830 [2018-10-03 08:56:08,528 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2018-10-03 08:56:10,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:10,043 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-03 08:56:10,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-03 08:56:10,043 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2018-10-03 08:56:10,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:10,045 INFO L225 Difference]: With dead ends: 176 [2018-10-03 08:56:10,045 INFO L226 Difference]: Without dead ends: 175 [2018-10-03 08:56:10,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3569, Invalid=6937, Unknown=0, NotChecked=0, Total=10506 [2018-10-03 08:56:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-03 08:56:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2018-10-03 08:56:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-03 08:56:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-10-03 08:56:10,080 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2018-10-03 08:56:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:10,081 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-10-03 08:56:10,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-03 08:56:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-10-03 08:56:10,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-03 08:56:10,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:10,082 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2018-10-03 08:56:10,082 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:56:10,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:10,082 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2018-10-03 08:56:10,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:10,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:10,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:10,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:10,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:10,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:10,972 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:56:10,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:56:11,182 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-03 08:56:11,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:11,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:11,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:11,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:11,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:11,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:12,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:12,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-03 08:56:12,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-03 08:56:12,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-03 08:56:12,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=3220, Unknown=0, NotChecked=0, Total=5112 [2018-10-03 08:56:12,099 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2018-10-03 08:56:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:13,752 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-03 08:56:13,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-03 08:56:13,752 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2018-10-03 08:56:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:13,753 INFO L225 Difference]: With dead ends: 181 [2018-10-03 08:56:13,753 INFO L226 Difference]: Without dead ends: 180 [2018-10-03 08:56:13,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3779, Invalid=7351, Unknown=0, NotChecked=0, Total=11130 [2018-10-03 08:56:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-03 08:56:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2018-10-03 08:56:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-03 08:56:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-03 08:56:13,785 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2018-10-03 08:56:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:13,785 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-03 08:56:13,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-03 08:56:13,785 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-03 08:56:13,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-03 08:56:13,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:13,786 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2018-10-03 08:56:13,786 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:56:13,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2018-10-03 08:56:13,787 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:13,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:13,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:13,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:13,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:15,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:15,700 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:56:15,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:56:15,830 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:56:15,830 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:15,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:15,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:15,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:15,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:15,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:16,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:16,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-03 08:56:16,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-03 08:56:16,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-03 08:56:16,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2000, Invalid=3402, Unknown=0, NotChecked=0, Total=5402 [2018-10-03 08:56:16,960 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2018-10-03 08:56:17,554 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-03 08:56:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:19,472 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-10-03 08:56:19,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-03 08:56:19,473 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2018-10-03 08:56:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:19,474 INFO L225 Difference]: With dead ends: 186 [2018-10-03 08:56:19,474 INFO L226 Difference]: Without dead ends: 185 [2018-10-03 08:56:19,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3995, Invalid=7777, Unknown=0, NotChecked=0, Total=11772 [2018-10-03 08:56:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-03 08:56:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-10-03 08:56:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-03 08:56:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-03 08:56:19,505 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2018-10-03 08:56:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:19,505 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-03 08:56:19,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-03 08:56:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-03 08:56:19,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-03 08:56:19,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:19,507 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2018-10-03 08:56:19,507 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:56:19,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:19,507 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2018-10-03 08:56:19,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:19,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:19,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:19,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:19,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:20,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:20,410 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:56:20,417 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:56:20,610 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-03 08:56:20,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:20,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:20,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:20,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:20,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:20,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:21,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:21,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-03 08:56:21,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-03 08:56:21,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-03 08:56:21,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=3589, Unknown=0, NotChecked=0, Total=5700 [2018-10-03 08:56:21,992 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2018-10-03 08:56:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:23,831 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-03 08:56:23,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-03 08:56:23,831 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2018-10-03 08:56:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:23,832 INFO L225 Difference]: With dead ends: 191 [2018-10-03 08:56:23,833 INFO L226 Difference]: Without dead ends: 190 [2018-10-03 08:56:23,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4217, Invalid=8215, Unknown=0, NotChecked=0, Total=12432 [2018-10-03 08:56:23,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-03 08:56:23,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-10-03 08:56:23,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-03 08:56:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-03 08:56:23,864 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2018-10-03 08:56:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:23,864 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-03 08:56:23,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-03 08:56:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-03 08:56:23,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-03 08:56:23,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:23,865 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2018-10-03 08:56:23,865 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:56:23,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:23,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2018-10-03 08:56:23,866 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:23,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:23,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:23,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:23,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:24,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:24,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:56:24,869 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:56:25,130 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-03 08:56:25,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:25,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:25,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:25,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:25,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:25,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:27,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:27,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-03 08:56:27,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-03 08:56:27,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-03 08:56:27,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2225, Invalid=3781, Unknown=0, NotChecked=0, Total=6006 [2018-10-03 08:56:27,486 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2018-10-03 08:56:29,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:29,348 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-03 08:56:29,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-03 08:56:29,348 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2018-10-03 08:56:29,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:29,349 INFO L225 Difference]: With dead ends: 196 [2018-10-03 08:56:29,349 INFO L226 Difference]: Without dead ends: 195 [2018-10-03 08:56:29,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4445, Invalid=8665, Unknown=0, NotChecked=0, Total=13110 [2018-10-03 08:56:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-03 08:56:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-10-03 08:56:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-03 08:56:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-03 08:56:29,390 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2018-10-03 08:56:29,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:29,390 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-03 08:56:29,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-03 08:56:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-03 08:56:29,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-03 08:56:29,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:29,391 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2018-10-03 08:56:29,392 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:56:29,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:29,392 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2018-10-03 08:56:29,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:29,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:29,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:29,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:29,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:30,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:30,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:30,610 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:56:30,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:56:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:30,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:30,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:30,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:30,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:30,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:31,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:31,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-03 08:56:31,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-03 08:56:31,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-03 08:56:31,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2342, Invalid=3978, Unknown=0, NotChecked=0, Total=6320 [2018-10-03 08:56:31,981 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2018-10-03 08:56:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:33,961 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-03 08:56:33,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-03 08:56:33,961 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2018-10-03 08:56:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:33,962 INFO L225 Difference]: With dead ends: 201 [2018-10-03 08:56:33,963 INFO L226 Difference]: Without dead ends: 200 [2018-10-03 08:56:33,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4679, Invalid=9127, Unknown=0, NotChecked=0, Total=13806 [2018-10-03 08:56:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-03 08:56:33,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-10-03 08:56:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-03 08:56:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-03 08:56:33,996 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2018-10-03 08:56:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:33,996 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-03 08:56:33,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-03 08:56:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-03 08:56:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-03 08:56:33,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:33,997 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2018-10-03 08:56:33,997 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:56:33,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:33,998 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2018-10-03 08:56:33,998 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:33,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:33,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:33,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:56:33,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:35,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:35,031 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:56:35,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:56:35,181 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:56:35,181 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:35,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:35,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:35,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:35,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:35,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:36,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:36,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-03 08:56:36,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-03 08:56:36,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-03 08:56:36,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2462, Invalid=4180, Unknown=0, NotChecked=0, Total=6642 [2018-10-03 08:56:36,430 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2018-10-03 08:56:38,985 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-03 08:56:39,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:39,122 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-03 08:56:39,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-03 08:56:39,122 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2018-10-03 08:56:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:39,123 INFO L225 Difference]: With dead ends: 206 [2018-10-03 08:56:39,123 INFO L226 Difference]: Without dead ends: 205 [2018-10-03 08:56:39,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4919, Invalid=9601, Unknown=0, NotChecked=0, Total=14520 [2018-10-03 08:56:39,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-03 08:56:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2018-10-03 08:56:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-03 08:56:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-10-03 08:56:39,156 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2018-10-03 08:56:39,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:39,157 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-10-03 08:56:39,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-03 08:56:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-10-03 08:56:39,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-03 08:56:39,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:39,158 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2018-10-03 08:56:39,158 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:56:39,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:39,158 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2018-10-03 08:56:39,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:39,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:39,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:39,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:39,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:40,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:40,345 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:56:40,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:56:40,637 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-03 08:56:40,637 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:40,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:40,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:40,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:40,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:40,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:41,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:41,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-03 08:56:41,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-03 08:56:41,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-03 08:56:41,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2585, Invalid=4387, Unknown=0, NotChecked=0, Total=6972 [2018-10-03 08:56:41,848 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2018-10-03 08:56:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:43,864 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-03 08:56:43,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-03 08:56:43,864 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2018-10-03 08:56:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:43,865 INFO L225 Difference]: With dead ends: 211 [2018-10-03 08:56:43,865 INFO L226 Difference]: Without dead ends: 210 [2018-10-03 08:56:43,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5165, Invalid=10087, Unknown=0, NotChecked=0, Total=15252 [2018-10-03 08:56:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-03 08:56:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-10-03 08:56:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-03 08:56:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-03 08:56:43,900 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2018-10-03 08:56:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:43,900 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-03 08:56:43,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-03 08:56:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-03 08:56:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-03 08:56:43,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:43,901 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2018-10-03 08:56:43,901 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:56:43,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:43,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2018-10-03 08:56:43,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:43,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:43,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:43,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:43,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:45,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:45,044 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:56:45,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:56:45,205 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:56:45,206 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:45,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:45,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:45,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:45,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:45,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:46,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:46,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-03 08:56:46,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-03 08:56:46,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-03 08:56:46,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=4599, Unknown=0, NotChecked=0, Total=7310 [2018-10-03 08:56:46,707 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2018-10-03 08:56:48,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:48,814 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-03 08:56:48,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-03 08:56:48,814 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2018-10-03 08:56:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:48,815 INFO L225 Difference]: With dead ends: 216 [2018-10-03 08:56:48,815 INFO L226 Difference]: Without dead ends: 215 [2018-10-03 08:56:48,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5417, Invalid=10585, Unknown=0, NotChecked=0, Total=16002 [2018-10-03 08:56:48,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-03 08:56:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2018-10-03 08:56:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-03 08:56:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-10-03 08:56:48,850 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2018-10-03 08:56:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:48,851 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-10-03 08:56:48,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-03 08:56:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-10-03 08:56:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-03 08:56:48,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:48,852 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2018-10-03 08:56:48,852 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:56:48,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:48,852 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2018-10-03 08:56:48,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:48,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:48,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:48,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:50,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:50,019 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:56:50,027 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:56:50,285 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-03 08:56:50,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:50,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:50,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:50,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:50,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:50,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:51,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:51,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-03 08:56:51,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-03 08:56:51,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-03 08:56:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2840, Invalid=4816, Unknown=0, NotChecked=0, Total=7656 [2018-10-03 08:56:51,672 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2018-10-03 08:56:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:53,848 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-03 08:56:53,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-03 08:56:53,849 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2018-10-03 08:56:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:53,850 INFO L225 Difference]: With dead ends: 221 [2018-10-03 08:56:53,850 INFO L226 Difference]: Without dead ends: 220 [2018-10-03 08:56:53,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5675, Invalid=11095, Unknown=0, NotChecked=0, Total=16770 [2018-10-03 08:56:53,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-03 08:56:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-10-03 08:56:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-03 08:56:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-03 08:56:53,900 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2018-10-03 08:56:53,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:53,901 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-03 08:56:53,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-03 08:56:53,901 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-03 08:56:53,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-03 08:56:53,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:53,902 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2018-10-03 08:56:53,902 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:56:53,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:53,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2018-10-03 08:56:53,902 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:53,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:53,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:53,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:53,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:56:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:55,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:56:55,208 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:56:55,215 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:56:55,483 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-03 08:56:55,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:56:55,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:56:55,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:56:55,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:56:55,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:56:55,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:56:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:56:56,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:56:56,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-10-03 08:56:56,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-03 08:56:56,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-03 08:56:56,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=5038, Unknown=0, NotChecked=0, Total=8010 [2018-10-03 08:56:56,837 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2018-10-03 08:56:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:56:59,099 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-03 08:56:59,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-03 08:56:59,099 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2018-10-03 08:56:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:56:59,100 INFO L225 Difference]: With dead ends: 226 [2018-10-03 08:56:59,100 INFO L226 Difference]: Without dead ends: 225 [2018-10-03 08:56:59,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5939, Invalid=11617, Unknown=0, NotChecked=0, Total=17556 [2018-10-03 08:56:59,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-03 08:56:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-10-03 08:56:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-03 08:56:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-03 08:56:59,142 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2018-10-03 08:56:59,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:56:59,142 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-03 08:56:59,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-03 08:56:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-03 08:56:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-03 08:56:59,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:56:59,144 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2018-10-03 08:56:59,144 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:56:59,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:56:59,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2018-10-03 08:56:59,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:56:59,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:56:59,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:59,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:56:59,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:56:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:00,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:00,740 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:57:00,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:57:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:00,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:00,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:00,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:00,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:00,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:02,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:02,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-10-03 08:57:02,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-03 08:57:02,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-03 08:57:02,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3107, Invalid=5265, Unknown=0, NotChecked=0, Total=8372 [2018-10-03 08:57:02,925 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2018-10-03 08:57:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:05,498 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-03 08:57:05,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-03 08:57:05,498 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2018-10-03 08:57:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:05,499 INFO L225 Difference]: With dead ends: 231 [2018-10-03 08:57:05,499 INFO L226 Difference]: Without dead ends: 230 [2018-10-03 08:57:05,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6209, Invalid=12151, Unknown=0, NotChecked=0, Total=18360 [2018-10-03 08:57:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-03 08:57:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-10-03 08:57:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-03 08:57:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-03 08:57:05,557 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2018-10-03 08:57:05,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:05,558 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-03 08:57:05,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-03 08:57:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-03 08:57:05,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-03 08:57:05,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:05,559 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2018-10-03 08:57:05,560 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:57:05,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:05,560 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2018-10-03 08:57:05,560 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:05,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:05,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:05,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:57:05,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:07,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:07,028 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:57:07,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:57:07,185 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:57:07,185 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:07,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:07,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:07,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:07,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:07,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:08,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:08,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:08,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-10-03 08:57:08,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-03 08:57:08,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-03 08:57:08,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=5497, Unknown=0, NotChecked=0, Total=8742 [2018-10-03 08:57:08,637 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2018-10-03 08:57:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:11,285 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-03 08:57:11,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-03 08:57:11,286 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2018-10-03 08:57:11,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:11,287 INFO L225 Difference]: With dead ends: 236 [2018-10-03 08:57:11,287 INFO L226 Difference]: Without dead ends: 235 [2018-10-03 08:57:11,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6070 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6485, Invalid=12697, Unknown=0, NotChecked=0, Total=19182 [2018-10-03 08:57:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-03 08:57:11,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-10-03 08:57:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-03 08:57:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-10-03 08:57:11,347 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2018-10-03 08:57:11,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:11,347 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-10-03 08:57:11,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-03 08:57:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-10-03 08:57:11,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-03 08:57:11,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:11,349 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2018-10-03 08:57:11,349 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:57:11,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:11,350 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2018-10-03 08:57:11,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:11,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:11,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:11,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:11,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:12,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:12,935 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:57:12,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:57:13,256 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-03 08:57:13,256 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:13,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:13,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:13,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:13,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:13,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:15,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:15,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-10-03 08:57:15,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-03 08:57:15,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-03 08:57:15,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3386, Invalid=5734, Unknown=0, NotChecked=0, Total=9120 [2018-10-03 08:57:15,248 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2018-10-03 08:57:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:17,677 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-03 08:57:17,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-03 08:57:17,677 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2018-10-03 08:57:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:17,679 INFO L225 Difference]: With dead ends: 241 [2018-10-03 08:57:17,679 INFO L226 Difference]: Without dead ends: 240 [2018-10-03 08:57:17,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6767, Invalid=13255, Unknown=0, NotChecked=0, Total=20022 [2018-10-03 08:57:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-03 08:57:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2018-10-03 08:57:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-03 08:57:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-03 08:57:17,738 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2018-10-03 08:57:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:17,738 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-03 08:57:17,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-03 08:57:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-03 08:57:17,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-03 08:57:17,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:17,740 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2018-10-03 08:57:17,740 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:57:17,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:17,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2018-10-03 08:57:17,741 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:17,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:17,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:17,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:17,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:19,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:19,036 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:57:19,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:57:19,211 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:57:19,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:19,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:19,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:19,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:19,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:19,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:21,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:21,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-10-03 08:57:21,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-03 08:57:21,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-03 08:57:21,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3530, Invalid=5976, Unknown=0, NotChecked=0, Total=9506 [2018-10-03 08:57:21,117 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2018-10-03 08:57:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:23,667 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-10-03 08:57:23,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-03 08:57:23,668 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2018-10-03 08:57:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:23,669 INFO L225 Difference]: With dead ends: 246 [2018-10-03 08:57:23,669 INFO L226 Difference]: Without dead ends: 245 [2018-10-03 08:57:23,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7055, Invalid=13825, Unknown=0, NotChecked=0, Total=20880 [2018-10-03 08:57:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-03 08:57:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2018-10-03 08:57:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-03 08:57:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-10-03 08:57:23,720 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2018-10-03 08:57:23,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:23,721 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-10-03 08:57:23,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-03 08:57:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-10-03 08:57:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-03 08:57:23,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:23,722 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2018-10-03 08:57:23,722 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:57:23,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:23,722 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2018-10-03 08:57:23,722 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:23,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:23,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:23,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:23,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:25,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:25,372 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:57:25,378 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:57:25,652 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-03 08:57:25,653 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:25,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:25,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:25,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:25,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:25,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:27,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:27,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-10-03 08:57:27,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-03 08:57:27,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-03 08:57:27,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3677, Invalid=6223, Unknown=0, NotChecked=0, Total=9900 [2018-10-03 08:57:27,345 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2018-10-03 08:57:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:30,112 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-03 08:57:30,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-03 08:57:30,112 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2018-10-03 08:57:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:30,113 INFO L225 Difference]: With dead ends: 251 [2018-10-03 08:57:30,113 INFO L226 Difference]: Without dead ends: 250 [2018-10-03 08:57:30,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7349, Invalid=14407, Unknown=0, NotChecked=0, Total=21756 [2018-10-03 08:57:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-03 08:57:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2018-10-03 08:57:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-03 08:57:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-03 08:57:30,169 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2018-10-03 08:57:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:30,169 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-03 08:57:30,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-03 08:57:30,169 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-03 08:57:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-03 08:57:30,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:30,170 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2018-10-03 08:57:30,171 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:57:30,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:30,171 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2018-10-03 08:57:30,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:30,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:30,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:30,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:30,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:31,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:31,547 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:57:31,555 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:57:31,913 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-03 08:57:31,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:31,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:31,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:31,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:31,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:31,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:33,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:33,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-10-03 08:57:33,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-03 08:57:33,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-03 08:57:33,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3827, Invalid=6475, Unknown=0, NotChecked=0, Total=10302 [2018-10-03 08:57:33,827 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2018-10-03 08:57:36,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:36,685 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-03 08:57:36,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-03 08:57:36,685 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2018-10-03 08:57:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:36,687 INFO L225 Difference]: With dead ends: 256 [2018-10-03 08:57:36,687 INFO L226 Difference]: Without dead ends: 255 [2018-10-03 08:57:36,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7649, Invalid=15001, Unknown=0, NotChecked=0, Total=22650 [2018-10-03 08:57:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-03 08:57:36,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2018-10-03 08:57:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-03 08:57:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-03 08:57:36,752 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2018-10-03 08:57:36,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:36,752 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-03 08:57:36,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-03 08:57:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-03 08:57:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-03 08:57:36,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:36,754 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2018-10-03 08:57:36,754 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:57:36,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:36,755 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2018-10-03 08:57:36,755 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:36,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:36,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:36,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:36,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:38,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:38,178 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:57:38,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:57:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:38,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:38,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:38,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:38,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:38,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:40,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:40,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-10-03 08:57:40,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-03 08:57:40,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-03 08:57:40,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3980, Invalid=6732, Unknown=0, NotChecked=0, Total=10712 [2018-10-03 08:57:40,413 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2018-10-03 08:57:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:43,286 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-03 08:57:43,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-03 08:57:43,286 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2018-10-03 08:57:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:43,288 INFO L225 Difference]: With dead ends: 261 [2018-10-03 08:57:43,288 INFO L226 Difference]: Without dead ends: 260 [2018-10-03 08:57:43,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7955, Invalid=15607, Unknown=0, NotChecked=0, Total=23562 [2018-10-03 08:57:43,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-03 08:57:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2018-10-03 08:57:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-03 08:57:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-03 08:57:43,352 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2018-10-03 08:57:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:43,352 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-03 08:57:43,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-03 08:57:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-03 08:57:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-03 08:57:43,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:43,354 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2018-10-03 08:57:43,354 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:57:43,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:43,355 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2018-10-03 08:57:43,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:43,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:43,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:43,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:57:43,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:44,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:44,822 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:57:44,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:57:44,998 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:57:44,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:45,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:45,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:45,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:45,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:45,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:46,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:46,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 105 [2018-10-03 08:57:46,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-03 08:57:46,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-03 08:57:46,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4136, Invalid=6994, Unknown=0, NotChecked=0, Total=11130 [2018-10-03 08:57:46,975 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2018-10-03 08:57:50,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:50,011 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-10-03 08:57:50,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-03 08:57:50,011 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2018-10-03 08:57:50,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:50,012 INFO L225 Difference]: With dead ends: 266 [2018-10-03 08:57:50,012 INFO L226 Difference]: Without dead ends: 265 [2018-10-03 08:57:50,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8267, Invalid=16225, Unknown=0, NotChecked=0, Total=24492 [2018-10-03 08:57:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-03 08:57:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2018-10-03 08:57:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-03 08:57:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-10-03 08:57:50,067 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2018-10-03 08:57:50,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:50,067 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-10-03 08:57:50,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-03 08:57:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-10-03 08:57:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-03 08:57:50,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:50,068 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2018-10-03 08:57:50,068 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:57:50,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2018-10-03 08:57:50,069 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:50,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:50,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:51,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:51,718 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:57:51,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:57:52,171 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-03 08:57:52,171 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:52,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:52,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:52,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:52,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:52,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:57:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:54,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:57:54,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 107 [2018-10-03 08:57:54,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-03 08:57:54,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-03 08:57:54,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4295, Invalid=7261, Unknown=0, NotChecked=0, Total=11556 [2018-10-03 08:57:54,058 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2018-10-03 08:57:57,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:57:57,307 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-03 08:57:57,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-03 08:57:57,308 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2018-10-03 08:57:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:57:57,309 INFO L225 Difference]: With dead ends: 271 [2018-10-03 08:57:57,309 INFO L226 Difference]: Without dead ends: 270 [2018-10-03 08:57:57,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8107 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8585, Invalid=16855, Unknown=0, NotChecked=0, Total=25440 [2018-10-03 08:57:57,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-03 08:57:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2018-10-03 08:57:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-03 08:57:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-03 08:57:57,370 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2018-10-03 08:57:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:57:57,371 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-03 08:57:57,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-03 08:57:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-03 08:57:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-03 08:57:57,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:57:57,372 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2018-10-03 08:57:57,372 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:57:57,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:57:57,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2018-10-03 08:57:57,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:57:57,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:57:57,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:57,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:57:57,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:57:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:57:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:57:59,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:57:59,148 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:57:59,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:57:59,346 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:57:59,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:57:59,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:57:59,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:57:59,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:57:59,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:57:59,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:01,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:01,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 109 [2018-10-03 08:58:01,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-03 08:58:01,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-03 08:58:01,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4457, Invalid=7533, Unknown=0, NotChecked=0, Total=11990 [2018-10-03 08:58:01,487 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2018-10-03 08:58:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:58:04,533 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-10-03 08:58:04,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-03 08:58:04,533 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2018-10-03 08:58:04,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:58:04,534 INFO L225 Difference]: With dead ends: 276 [2018-10-03 08:58:04,534 INFO L226 Difference]: Without dead ends: 275 [2018-10-03 08:58:04,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8909, Invalid=17497, Unknown=0, NotChecked=0, Total=26406 [2018-10-03 08:58:04,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-03 08:58:04,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2018-10-03 08:58:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-03 08:58:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-03 08:58:04,605 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2018-10-03 08:58:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:58:04,605 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-03 08:58:04,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-03 08:58:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-03 08:58:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-03 08:58:04,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:58:04,607 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2018-10-03 08:58:04,607 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:58:04,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:58:04,608 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2018-10-03 08:58:04,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:58:04,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:58:04,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:04,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:58:04,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:06,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:06,548 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:06,556 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:58:06,899 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-03 08:58:06,900 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:58:06,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:06,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:06,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:06,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:06,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:08,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:08,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 111 [2018-10-03 08:58:08,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-03 08:58:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-03 08:58:08,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4622, Invalid=7810, Unknown=0, NotChecked=0, Total=12432 [2018-10-03 08:58:08,865 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2018-10-03 08:58:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:58:12,258 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-03 08:58:12,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-03 08:58:12,258 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2018-10-03 08:58:12,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:58:12,259 INFO L225 Difference]: With dead ends: 281 [2018-10-03 08:58:12,259 INFO L226 Difference]: Without dead ends: 280 [2018-10-03 08:58:12,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8743 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9239, Invalid=18151, Unknown=0, NotChecked=0, Total=27390 [2018-10-03 08:58:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-03 08:58:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2018-10-03 08:58:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-03 08:58:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-03 08:58:12,332 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2018-10-03 08:58:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:58:12,332 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-03 08:58:12,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-03 08:58:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-03 08:58:12,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-03 08:58:12,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:58:12,334 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2018-10-03 08:58:12,334 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:58:12,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:58:12,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2018-10-03 08:58:12,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:58:12,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:58:12,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:12,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:58:12,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:14,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:14,077 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:14,110 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-03 08:58:14,544 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-03 08:58:14,544 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:58:14,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:14,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:14,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:14,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:14,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:16,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:16,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 113 [2018-10-03 08:58:16,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-03 08:58:16,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-03 08:58:16,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4790, Invalid=8092, Unknown=0, NotChecked=0, Total=12882 [2018-10-03 08:58:16,949 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2018-10-03 08:58:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:58:20,098 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-03 08:58:20,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-03 08:58:20,098 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2018-10-03 08:58:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:58:20,099 INFO L225 Difference]: With dead ends: 286 [2018-10-03 08:58:20,099 INFO L226 Difference]: Without dead ends: 285 [2018-10-03 08:58:20,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9070 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9575, Invalid=18817, Unknown=0, NotChecked=0, Total=28392 [2018-10-03 08:58:20,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-03 08:58:20,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2018-10-03 08:58:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-03 08:58:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-03 08:58:20,162 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2018-10-03 08:58:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:58:20,163 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-03 08:58:20,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-03 08:58:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-03 08:58:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-03 08:58:20,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:58:20,164 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2018-10-03 08:58:20,164 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:58:20,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:58:20,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2018-10-03 08:58:20,165 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:58:20,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:58:20,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:20,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:58:20,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:21,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:21,890 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:21,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:58:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:22,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:22,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:22,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:22,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:22,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:24,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:24,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 115 [2018-10-03 08:58:24,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-03 08:58:24,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-03 08:58:24,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4961, Invalid=8379, Unknown=0, NotChecked=0, Total=13340 [2018-10-03 08:58:24,190 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2018-10-03 08:58:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:58:27,437 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-03 08:58:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-03 08:58:27,437 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2018-10-03 08:58:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:58:27,439 INFO L225 Difference]: With dead ends: 291 [2018-10-03 08:58:27,439 INFO L226 Difference]: Without dead ends: 290 [2018-10-03 08:58:27,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9917, Invalid=19495, Unknown=0, NotChecked=0, Total=29412 [2018-10-03 08:58:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-03 08:58:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2018-10-03 08:58:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-03 08:58:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-03 08:58:27,504 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2018-10-03 08:58:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:58:27,504 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-03 08:58:27,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-03 08:58:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-03 08:58:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-03 08:58:27,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:58:27,506 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2018-10-03 08:58:27,506 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:58:27,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:58:27,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2018-10-03 08:58:27,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:58:27,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:58:27,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:27,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:58:27,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:29,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:29,236 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:29,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 08:58:29,425 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 08:58:29,425 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:58:29,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:29,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:29,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:29,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:29,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:31,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:31,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 117 [2018-10-03 08:58:31,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-03 08:58:31,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-03 08:58:31,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5135, Invalid=8671, Unknown=0, NotChecked=0, Total=13806 [2018-10-03 08:58:31,701 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2018-10-03 08:58:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:58:34,948 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-10-03 08:58:34,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-03 08:58:34,949 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2018-10-03 08:58:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:58:34,950 INFO L225 Difference]: With dead ends: 296 [2018-10-03 08:58:34,950 INFO L226 Difference]: Without dead ends: 295 [2018-10-03 08:58:34,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10265, Invalid=20185, Unknown=0, NotChecked=0, Total=30450 [2018-10-03 08:58:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-03 08:58:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2018-10-03 08:58:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-03 08:58:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-10-03 08:58:35,022 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2018-10-03 08:58:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:58:35,022 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-10-03 08:58:35,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-03 08:58:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-10-03 08:58:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-03 08:58:35,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:58:35,024 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2018-10-03 08:58:35,024 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:58:35,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:58:35,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2018-10-03 08:58:35,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:58:35,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:58:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:35,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:58:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:36,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:36,907 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:36,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 08:58:37,345 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-03 08:58:37,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:58:37,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:37,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:37,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:37,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:37,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:39,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:39,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 119 [2018-10-03 08:58:39,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-03 08:58:39,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-03 08:58:39,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5312, Invalid=8968, Unknown=0, NotChecked=0, Total=14280 [2018-10-03 08:58:39,592 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2018-10-03 08:58:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:58:42,973 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-03 08:58:42,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-03 08:58:42,973 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2018-10-03 08:58:42,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:58:42,974 INFO L225 Difference]: With dead ends: 301 [2018-10-03 08:58:42,975 INFO L226 Difference]: Without dead ends: 300 [2018-10-03 08:58:42,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10619, Invalid=20887, Unknown=0, NotChecked=0, Total=31506 [2018-10-03 08:58:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-03 08:58:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2018-10-03 08:58:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-03 08:58:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-03 08:58:43,048 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2018-10-03 08:58:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:58:43,048 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-03 08:58:43,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-03 08:58:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-03 08:58:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-03 08:58:43,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:58:43,050 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2018-10-03 08:58:43,050 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:58:43,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:58:43,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2018-10-03 08:58:43,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:58:43,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:58:43,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:43,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:58:43,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:44,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:44,916 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:44,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-03 08:58:45,127 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-03 08:58:45,128 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:58:45,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:45,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:45,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:45,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:45,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:47,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:47,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 121 [2018-10-03 08:58:47,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-03 08:58:47,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-03 08:58:47,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5492, Invalid=9270, Unknown=0, NotChecked=0, Total=14762 [2018-10-03 08:58:47,459 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2018-10-03 08:58:50,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:58:50,782 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-10-03 08:58:50,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-03 08:58:50,782 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2018-10-03 08:58:50,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:58:50,783 INFO L225 Difference]: With dead ends: 306 [2018-10-03 08:58:50,783 INFO L226 Difference]: Without dead ends: 305 [2018-10-03 08:58:50,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10979, Invalid=21601, Unknown=0, NotChecked=0, Total=32580 [2018-10-03 08:58:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-03 08:58:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2018-10-03 08:58:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-03 08:58:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-03 08:58:50,860 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2018-10-03 08:58:50,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:58:50,860 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-03 08:58:50,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-03 08:58:50,860 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-03 08:58:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-03 08:58:50,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:58:50,861 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2018-10-03 08:58:50,861 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-03 08:58:50,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:58:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2018-10-03 08:58:50,862 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:58:50,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:58:50,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:50,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 08:58:50,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:58:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:58:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:52,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:58:52,763 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:58:52,770 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-03 08:58:53,179 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-03 08:58:53,179 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 08:58:53,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:58:53,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-03 08:58:53,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-03 08:58:53,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-03 08:58:53,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-03 08:58:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 08:58:55,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:58:55,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 123 [2018-10-03 08:58:55,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-03 08:58:55,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-03 08:58:55,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5675, Invalid=9577, Unknown=0, NotChecked=0, Total=15252 [2018-10-03 08:58:55,519 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. Received shutdown request... [2018-10-03 08:58:57,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-03 08:58:57,106 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-03 08:58:57,110 WARN L205 ceAbstractionStarter]: Timeout [2018-10-03 08:58:57,110 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 08:58:57 BoogieIcfgContainer [2018-10-03 08:58:57,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 08:58:57,111 INFO L168 Benchmark]: Toolchain (without parser) took 237275.17 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 246.6 MB. Max. memory is 7.1 GB. [2018-10-03 08:58:57,111 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:58:57,112 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:58:57,112 INFO L168 Benchmark]: Boogie Preprocessor took 34.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 08:58:57,112 INFO L168 Benchmark]: RCFGBuilder took 382.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-03 08:58:57,113 INFO L168 Benchmark]: TraceAbstraction took 236779.95 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 225.4 MB. Max. memory is 7.1 GB. [2018-10-03 08:58:57,115 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 382.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236779.95 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 3.5 GB in the end (delta: -2.1 GB). Peak memory consumption was 225.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (302states) and FLOYD_HOARE automaton (currently 39 states, 124 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 160 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (302states) and FLOYD_HOARE automaton (currently 39 states, 124 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 160 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 2 error locations. TIMEOUT Result, 236.7s OverallTime, 62 OverallIterations, 60 TraceHistogramMax, 96.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 206 SDtfs, 11103 SDslu, 2204 SDs, 0 SdLazy, 16084 SolverSat, 5565 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12909 GetRequests, 7320 SyntacticMatches, 0 SemanticMatches, 5588 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218924 ImplicationChecksByTransitivity, 177.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=61, 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: 1.8s AutomataMinimizationTime, 61 MinimizatonAttempts, 182 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.6s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 122.3s InterpolantComputationTime, 18428 NumberOfCodeBlocks, 18428 NumberOfCodeBlocksAsserted, 1031 NumberOfCheckSat, 18307 ConstructedInterpolants, 0 QuantifiedInterpolants, 29560497 SizeOfPredicates, 639 NumberOfNonLiveVariables, 39471 ConjunctsInSsa, 6411 ConjunctsInUnsatCore, 121 InterpolantComputations, 3 PerfectInterpolantSequences, 2/356362 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_08-58-57-127.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_08-58-57-127.csv Completed graceful shutdown