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-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:00:58,630 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:00:58,632 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:00:58,649 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:00:58,649 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:00:58,651 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:00:58,652 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:00:58,655 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:00:58,657 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:00:58,659 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:00:58,660 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:00:58,662 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:00:58,663 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:00:58,664 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:00:58,667 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:00:58,668 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:00:58,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:00:58,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:00:58,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:00:58,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:00:58,675 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:00:58,676 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:00:58,679 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:00:58,679 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:00:58,679 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:00:58,680 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:00:58,681 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:00:58,682 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:00:58,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:00:58,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:00:58,684 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:00:58,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:00:58,685 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:00:58,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:00:58,686 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:00:58,687 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:00:58,687 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-01 00:00:58,703 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:00:58,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:00:58,704 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:00:58,704 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:00:58,705 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:00:58,705 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:00:58,705 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:00:58,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:00:58,706 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:00:58,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:00:58,706 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:00:58,706 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:00:58,706 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:00:58,706 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:00:58,707 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:00:58,707 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:00:58,707 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:00:58,707 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:00:58,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:00:58,708 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:00:58,708 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:00:58,708 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:00:58,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:00:58,709 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:00:58,709 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:00:58,709 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:00:58,709 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:00:58,709 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:00:58,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:00:58,710 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:00:58,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:00:58,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:00:58,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:00:58,794 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:00:58,794 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:00:58,795 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2018-10-01 00:00:58,795 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2018-10-01 00:00:58,847 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:00:58,851 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:00:58,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:00:58,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:00:58,852 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:00:58,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:00:58" (1/1) ... [2018-10-01 00:00:58,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:00:58" (1/1) ... [2018-10-01 00:00:58,893 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-01 00:00:58,894 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-01 00:00:58,894 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-01 00:00:58,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:00:58,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:00:58,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:00:58,912 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:00:58,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:00:58" (1/1) ... [2018-10-01 00:00:58,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:00:58" (1/1) ... [2018-10-01 00:00:58,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:00:58" (1/1) ... [2018-10-01 00:00:58,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:00:58" (1/1) ... [2018-10-01 00:00:58,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:00:58" (1/1) ... [2018-10-01 00:00:58,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:00:58" (1/1) ... [2018-10-01 00:00:58,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:00:58" (1/1) ... [2018-10-01 00:00:58,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:00:58,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:00:58,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:00:58,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:00:58,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:00:58" (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-01 00:00:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-01 00:00:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-01 00:00:59,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-01 00:00:59,014 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-10-01 00:00:59,310 INFO L345 CfgBuilder]: Using library mode [2018-10-01 00:00:59,311 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:00:59 BoogieIcfgContainer [2018-10-01 00:00:59,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:00:59,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:00:59,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:00:59,316 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:00:59,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:00:58" (1/2) ... [2018-10-01 00:00:59,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ec7f85 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:00:59, skipping insertion in model container [2018-10-01 00:00:59,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:00:59" (2/2) ... [2018-10-01 00:00:59,319 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2018-10-01 00:00:59,329 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:00:59,338 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-10-01 00:00:59,388 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:00:59,389 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:00:59,389 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:00:59,390 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:00:59,390 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:00:59,390 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:00:59,390 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:00:59,390 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:00:59,391 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:00:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-10-01 00:00:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 00:00:59,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:00:59,413 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-01 00:00:59,414 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:00:59,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:00:59,420 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-10-01 00:00:59,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:00:59,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:00:59,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:00:59,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:00:59,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:00:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:00:59,701 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-01 00:00:59,704 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:00:59,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:00:59,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:00:59,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:00:59,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-01 00:00:59,728 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2018-10-01 00:00:59,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:00:59,892 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-10-01 00:00:59,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:00:59,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-01 00:00:59,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:00:59,912 INFO L225 Difference]: With dead ends: 20 [2018-10-01 00:00:59,913 INFO L226 Difference]: Without dead ends: 10 [2018-10-01 00:00:59,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-01 00:00:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-01 00:00:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2018-10-01 00:00:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-01 00:00:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-10-01 00:00:59,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-10-01 00:00:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:00:59,953 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-10-01 00:00:59,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:00:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-10-01 00:00:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:00:59,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:00:59,954 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-01 00:00:59,954 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:00:59,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:00:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2018-10-01 00:00:59,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:00:59,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:00:59,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:00:59,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:00:59,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:00:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:00,295 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-01 00:01:00,296 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:01:00,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:01:00,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:01:00,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:01:00,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-01 00:01:00,300 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-10-01 00:01:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:00,535 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-10-01 00:01:00,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:01:00,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-01 00:01:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:00,537 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:01:00,537 INFO L226 Difference]: Without dead ends: 16 [2018-10-01 00:01:00,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-01 00:01:00,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-01 00:01:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-10-01 00:01:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:01:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-10-01 00:01:00,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2018-10-01 00:01:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:00,545 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-10-01 00:01:00,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:01:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-10-01 00:01:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:01:00,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:00,546 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-10-01 00:01:00,547 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:00,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:00,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2018-10-01 00:01:00,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:00,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:00,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:00,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:00,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:00,598 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-01 00:01:00,599 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:01:00,599 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-01 00:01:00,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:01:00,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:01:00,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-01 00:01:00,600 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2018-10-01 00:01:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:00,655 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-10-01 00:01:00,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:01:00,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-10-01 00:01:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:00,656 INFO L225 Difference]: With dead ends: 18 [2018-10-01 00:01:00,656 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:01:00,657 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-01 00:01:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:01:00,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 00:01:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:01:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-01 00:01:00,661 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-01 00:01:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:00,661 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-01 00:01:00,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:01:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-01 00:01:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:01:00,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:00,662 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2018-10-01 00:01:00,662 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:00,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:00,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2018-10-01 00:01:00,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:00,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:00,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:00,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:00,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:00,831 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-01 00:01:00,831 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:00,831 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-01 00:01:00,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:00,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:00,964 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-01 00:01:00,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:00,988 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-01 00:01:00,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:01,131 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-01 00:01:01,152 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:01,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-10-01 00:01:01,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:01:01,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:01:01,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-01 00:01:01,154 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-10-01 00:01:01,274 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-01 00:01:01,430 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-10-01 00:01:01,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:01,531 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-01 00:01:01,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:01:01,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-01 00:01:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:01,533 INFO L225 Difference]: With dead ends: 20 [2018-10-01 00:01:01,534 INFO L226 Difference]: Without dead ends: 19 [2018-10-01 00:01:01,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-01 00:01:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-01 00:01:01,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-10-01 00:01:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-01 00:01:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-01 00:01:01,540 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-10-01 00:01:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:01,540 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-01 00:01:01,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:01:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-01 00:01:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:01:01,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:01,541 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-10-01 00:01:01,541 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:01,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:01,542 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2018-10-01 00:01:01,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:01,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:01,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:01,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:01,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:01,746 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-01 00:01:01,746 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:01,746 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-01 00:01:01,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:01:01,788 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:01:01,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:01,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:01,809 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-01 00:01:01,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:01,819 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-01 00:01:01,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:02,197 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-01 00:01:02,219 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:02,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-01 00:01:02,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:01:02,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:01:02,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-10-01 00:01:02,221 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2018-10-01 00:01:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:02,487 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-01 00:01:02,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:01:02,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-10-01 00:01:02,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:02,492 INFO L225 Difference]: With dead ends: 25 [2018-10-01 00:01:02,492 INFO L226 Difference]: Without dead ends: 24 [2018-10-01 00:01:02,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-01 00:01:02,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-01 00:01:02,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-10-01 00:01:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-01 00:01:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-01 00:01:02,498 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-10-01 00:01:02,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:02,499 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-01 00:01:02,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:01:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-01 00:01:02,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:01:02,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:02,500 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2018-10-01 00:01:02,500 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:02,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:02,501 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2018-10-01 00:01:02,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:02,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:02,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:02,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:02,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:02,742 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-01 00:01:02,742 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:02,742 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-01 00:01:02,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:01:02,788 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-01 00:01:02,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:02,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:02,806 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-01 00:01:02,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:02,820 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-01 00:01:02,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:02,927 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-01 00:01:02,947 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:02,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-10-01 00:01:02,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:01:02,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:01:02,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-01 00:01:02,949 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-10-01 00:01:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:03,256 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-01 00:01:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:01:03,258 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-10-01 00:01:03,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:03,259 INFO L225 Difference]: With dead ends: 30 [2018-10-01 00:01:03,259 INFO L226 Difference]: Without dead ends: 29 [2018-10-01 00:01:03,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-10-01 00:01:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-01 00:01:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-01 00:01:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-01 00:01:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-01 00:01:03,266 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-10-01 00:01:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:03,267 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-01 00:01:03,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:01:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-01 00:01:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-01 00:01:03,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:03,268 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2018-10-01 00:01:03,268 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:03,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:03,269 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2018-10-01 00:01:03,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:03,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:03,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:03,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:03,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:03,423 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-01 00:01:03,423 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:03,423 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-01 00:01:03,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:01:03,476 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:01:03,477 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:03,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:03,492 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-01 00:01:03,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:03,503 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-01 00:01:03,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:03,606 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-01 00:01:03,627 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:03,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-01 00:01:03,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:01:03,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:01:03,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-10-01 00:01:03,628 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-10-01 00:01:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:03,909 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-01 00:01:03,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:01:03,911 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-10-01 00:01:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:03,913 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:01:03,913 INFO L226 Difference]: Without dead ends: 34 [2018-10-01 00:01:03,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2018-10-01 00:01:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-01 00:01:03,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-10-01 00:01:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-01 00:01:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-01 00:01:03,920 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-10-01 00:01:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:03,920 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-01 00:01:03,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:01:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-01 00:01:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:01:03,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:03,921 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2018-10-01 00:01:03,922 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:03,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:03,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2018-10-01 00:01:03,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:03,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:03,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:03,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:03,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:04,079 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-01 00:01:04,079 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:04,079 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-01 00:01:04,087 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:01:04,120 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-01 00:01:04,121 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:04,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:04,133 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-01 00:01:04,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:04,145 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-01 00:01:04,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:04,428 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-01 00:01:04,448 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:04,448 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-10-01 00:01:04,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:01:04,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:01:04,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-10-01 00:01:04,450 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-10-01 00:01:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:04,956 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-01 00:01:04,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:01:04,960 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-10-01 00:01:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:04,961 INFO L225 Difference]: With dead ends: 40 [2018-10-01 00:01:04,961 INFO L226 Difference]: Without dead ends: 39 [2018-10-01 00:01:04,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2018-10-01 00:01:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-01 00:01:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-10-01 00:01:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-01 00:01:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-01 00:01:04,970 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-10-01 00:01:04,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:04,970 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-01 00:01:04,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:01:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-01 00:01:04,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-01 00:01:04,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:04,972 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2018-10-01 00:01:04,972 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:04,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:04,973 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2018-10-01 00:01:04,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:04,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:04,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:04,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:04,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:05,358 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-01 00:01:05,358 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:05,359 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-01 00:01:05,366 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:01:05,407 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-01 00:01:05,407 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:05,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:05,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-01 00:01:05,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:05,432 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-01 00:01:05,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:05,733 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-01 00:01:05,762 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:05,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-10-01 00:01:05,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:01:05,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:01:05,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2018-10-01 00:01:05,764 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2018-10-01 00:01:06,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:06,093 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-01 00:01:06,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:01:06,095 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-10-01 00:01:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:06,096 INFO L225 Difference]: With dead ends: 45 [2018-10-01 00:01:06,097 INFO L226 Difference]: Without dead ends: 44 [2018-10-01 00:01:06,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-10-01 00:01:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-01 00:01:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-10-01 00:01:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-01 00:01:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-01 00:01:06,105 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-10-01 00:01:06,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:06,106 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-01 00:01:06,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:01:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-01 00:01:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-01 00:01:06,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:06,108 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2018-10-01 00:01:06,108 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:06,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:06,108 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2018-10-01 00:01:06,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:06,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:06,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:06,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:06,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:06,324 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-01 00:01:06,325 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:06,325 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-01 00:01:06,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:06,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:06,384 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-01 00:01:06,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:06,395 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-01 00:01:06,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:06,768 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-01 00:01:06,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:06,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-10-01 00:01:06,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:01:06,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:01:06,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-10-01 00:01:06,792 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2018-10-01 00:01:07,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:07,117 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-01 00:01:07,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:01:07,117 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-10-01 00:01:07,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:07,119 INFO L225 Difference]: With dead ends: 50 [2018-10-01 00:01:07,119 INFO L226 Difference]: Without dead ends: 49 [2018-10-01 00:01:07,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=280, Invalid=532, Unknown=0, NotChecked=0, Total=812 [2018-10-01 00:01:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-01 00:01:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-10-01 00:01:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-01 00:01:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-01 00:01:07,128 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-10-01 00:01:07,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:07,129 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-01 00:01:07,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:01:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-01 00:01:07,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-01 00:01:07,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:07,130 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2018-10-01 00:01:07,130 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:07,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:07,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2018-10-01 00:01:07,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:07,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:07,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:07,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:07,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:07,967 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-01 00:01:07,968 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:07,968 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-01 00:01:07,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:01:08,009 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:01:08,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:08,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:08,030 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-01 00:01:08,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:08,079 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-01 00:01:08,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:08,234 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-01 00:01:08,262 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:08,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-10-01 00:01:08,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:01:08,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:01:08,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2018-10-01 00:01:08,263 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2018-10-01 00:01:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:08,784 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-01 00:01:08,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:01:08,785 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-10-01 00:01:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:08,786 INFO L225 Difference]: With dead ends: 55 [2018-10-01 00:01:08,786 INFO L226 Difference]: Without dead ends: 54 [2018-10-01 00:01:08,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2018-10-01 00:01:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-01 00:01:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-10-01 00:01:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-01 00:01:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-01 00:01:08,796 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-10-01 00:01:08,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:08,796 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-01 00:01:08,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:01:08,797 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-01 00:01:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-01 00:01:08,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:08,798 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2018-10-01 00:01:08,798 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:08,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:08,799 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2018-10-01 00:01:08,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:08,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:08,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:08,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:08,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:09,024 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-01 00:01:09,024 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:09,024 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-01 00:01:09,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:01:09,200 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-01 00:01:09,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:09,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:09,237 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-01 00:01:09,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:09,278 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-01 00:01:09,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:09,633 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-01 00:01:09,655 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:09,655 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-10-01 00:01:09,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-01 00:01:09,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-01 00:01:09,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2018-10-01 00:01:09,656 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2018-10-01 00:01:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:10,198 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-01 00:01:10,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:01:10,202 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-10-01 00:01:10,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:10,203 INFO L225 Difference]: With dead ends: 60 [2018-10-01 00:01:10,203 INFO L226 Difference]: Without dead ends: 59 [2018-10-01 00:01:10,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=408, Invalid=782, Unknown=0, NotChecked=0, Total=1190 [2018-10-01 00:01:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-01 00:01:10,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-10-01 00:01:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-01 00:01:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-01 00:01:10,213 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-10-01 00:01:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:10,213 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-01 00:01:10,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-01 00:01:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-01 00:01:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-01 00:01:10,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:10,214 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2018-10-01 00:01:10,215 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:10,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:10,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2018-10-01 00:01:10,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:10,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:10,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:10,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:10,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:10,730 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-01 00:01:10,730 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:10,730 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-01 00:01:10,741 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:01:10,782 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:01:10,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:10,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:10,793 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-01 00:01:10,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:10,804 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-01 00:01:10,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:11,051 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-01 00:01:11,073 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:11,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-10-01 00:01:11,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-01 00:01:11,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-01 00:01:11,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2018-10-01 00:01:11,075 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2018-10-01 00:01:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:11,509 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-01 00:01:11,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:01:11,510 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-10-01 00:01:11,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:11,511 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:01:11,511 INFO L226 Difference]: Without dead ends: 64 [2018-10-01 00:01:11,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=481, Invalid=925, Unknown=0, NotChecked=0, Total=1406 [2018-10-01 00:01:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-01 00:01:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-10-01 00:01:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-01 00:01:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-01 00:01:11,521 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-10-01 00:01:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:11,522 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-01 00:01:11,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-01 00:01:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-01 00:01:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-01 00:01:11,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:11,523 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2018-10-01 00:01:11,523 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:11,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:11,523 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2018-10-01 00:01:11,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:11,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:11,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:11,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:11,806 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-01 00:01:11,806 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:11,806 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-01 00:01:11,813 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:01:11,880 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-01 00:01:11,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:11,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:11,902 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-01 00:01:11,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:11,911 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-01 00:01:11,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:12,158 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-01 00:01:12,180 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:12,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-10-01 00:01:12,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-01 00:01:12,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-01 00:01:12,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=493, Unknown=0, NotChecked=0, Total=756 [2018-10-01 00:01:12,181 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-10-01 00:01:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:12,713 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-01 00:01:12,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:01:12,713 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-10-01 00:01:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:12,714 INFO L225 Difference]: With dead ends: 70 [2018-10-01 00:01:12,714 INFO L226 Difference]: Without dead ends: 69 [2018-10-01 00:01:12,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=560, Invalid=1080, Unknown=0, NotChecked=0, Total=1640 [2018-10-01 00:01:12,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-01 00:01:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-10-01 00:01:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-01 00:01:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-01 00:01:12,725 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-10-01 00:01:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:12,726 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-01 00:01:12,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-01 00:01:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-01 00:01:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-01 00:01:12,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:12,727 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2018-10-01 00:01:12,727 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:12,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:12,728 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2018-10-01 00:01:12,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:12,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:12,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:12,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:12,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:13,080 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-01 00:01:13,081 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:13,081 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-01 00:01:13,093 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:01:13,151 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-01 00:01:13,151 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:13,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:13,180 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-01 00:01:13,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:13,190 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-01 00:01:13,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:13,424 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-01 00:01:13,445 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:13,445 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-10-01 00:01:13,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-01 00:01:13,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-01 00:01:13,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2018-10-01 00:01:13,447 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2018-10-01 00:01:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:13,970 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-01 00:01:13,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:01:13,970 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2018-10-01 00:01:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:13,971 INFO L225 Difference]: With dead ends: 75 [2018-10-01 00:01:13,971 INFO L226 Difference]: Without dead ends: 74 [2018-10-01 00:01:13,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=645, Invalid=1247, Unknown=0, NotChecked=0, Total=1892 [2018-10-01 00:01:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-01 00:01:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-10-01 00:01:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-01 00:01:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-01 00:01:13,986 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-10-01 00:01:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:13,987 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-01 00:01:13,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-01 00:01:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-01 00:01:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-01 00:01:13,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:13,988 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2018-10-01 00:01:13,988 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:13,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:13,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2018-10-01 00:01:13,989 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:13,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:13,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:13,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:13,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:14,334 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-01 00:01:14,334 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:14,334 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-01 00:01:14,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:14,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:14,409 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-01 00:01:14,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:14,419 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-01 00:01:14,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:14,963 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-01 00:01:14,983 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:14,984 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-10-01 00:01:14,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-01 00:01:14,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-01 00:01:14,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=644, Unknown=0, NotChecked=0, Total=992 [2018-10-01 00:01:14,985 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2018-10-01 00:01:15,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:15,740 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-01 00:01:15,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:01:15,740 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2018-10-01 00:01:15,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:15,742 INFO L225 Difference]: With dead ends: 80 [2018-10-01 00:01:15,742 INFO L226 Difference]: Without dead ends: 79 [2018-10-01 00:01:15,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=736, Invalid=1426, Unknown=0, NotChecked=0, Total=2162 [2018-10-01 00:01:15,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-01 00:01:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-10-01 00:01:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-01 00:01:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-01 00:01:15,754 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-10-01 00:01:15,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:15,754 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-01 00:01:15,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-01 00:01:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-01 00:01:15,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-01 00:01:15,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:15,755 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2018-10-01 00:01:15,756 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:15,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:15,756 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2018-10-01 00:01:15,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:15,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:15,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:15,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:15,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:16,220 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-01 00:01:16,220 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:16,221 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-01 00:01:16,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:01:16,285 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:01:16,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:16,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:16,304 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-01 00:01:16,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:16,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-01 00:01:16,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:16,614 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-01 00:01:16,634 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:16,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-10-01 00:01:16,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-01 00:01:16,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-01 00:01:16,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-10-01 00:01:16,636 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2018-10-01 00:01:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:17,200 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-01 00:01:17,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:01:17,200 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-10-01 00:01:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:17,201 INFO L225 Difference]: With dead ends: 85 [2018-10-01 00:01:17,201 INFO L226 Difference]: Without dead ends: 84 [2018-10-01 00:01:17,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=833, Invalid=1617, Unknown=0, NotChecked=0, Total=2450 [2018-10-01 00:01:17,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-01 00:01:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-10-01 00:01:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-01 00:01:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-01 00:01:17,215 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-10-01 00:01:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:17,216 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-01 00:01:17,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-01 00:01:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-01 00:01:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-01 00:01:17,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:17,217 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2018-10-01 00:01:17,217 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:17,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:17,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2018-10-01 00:01:17,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:17,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:17,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:17,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:17,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:18,151 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-01 00:01:18,152 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:18,152 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-01 00:01:18,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:01:18,235 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-01 00:01:18,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:18,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:18,259 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-01 00:01:18,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:18,268 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-01 00:01:18,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:18,597 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-01 00:01:18,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:18,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-10-01 00:01:18,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-01 00:01:18,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-01 00:01:18,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=815, Unknown=0, NotChecked=0, Total=1260 [2018-10-01 00:01:18,619 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2018-10-01 00:01:19,517 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-01 00:01:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:19,825 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-01 00:01:19,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:01:19,826 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2018-10-01 00:01:19,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:19,827 INFO L225 Difference]: With dead ends: 90 [2018-10-01 00:01:19,827 INFO L226 Difference]: Without dead ends: 89 [2018-10-01 00:01:19,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=936, Invalid=1820, Unknown=0, NotChecked=0, Total=2756 [2018-10-01 00:01:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-01 00:01:19,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-10-01 00:01:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-01 00:01:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-01 00:01:19,841 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-10-01 00:01:19,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:19,841 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-01 00:01:19,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-01 00:01:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-01 00:01:19,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-01 00:01:19,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:19,842 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2018-10-01 00:01:19,843 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:19,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2018-10-01 00:01:19,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:19,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:19,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:19,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:19,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:20,180 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-01 00:01:20,180 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:20,180 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-01 00:01:20,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:01:20,245 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:01:20,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:20,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:20,256 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-01 00:01:20,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:20,268 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-01 00:01:20,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:20,669 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-01 00:01:20,690 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:20,690 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-10-01 00:01:20,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-01 00:01:20,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-01 00:01:20,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=908, Unknown=0, NotChecked=0, Total=1406 [2018-10-01 00:01:20,691 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2018-10-01 00:01:21,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:21,288 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-01 00:01:21,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:01:21,288 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2018-10-01 00:01:21,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:21,290 INFO L225 Difference]: With dead ends: 95 [2018-10-01 00:01:21,290 INFO L226 Difference]: Without dead ends: 94 [2018-10-01 00:01:21,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1045, Invalid=2035, Unknown=0, NotChecked=0, Total=3080 [2018-10-01 00:01:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-01 00:01:21,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-01 00:01:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-01 00:01:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-01 00:01:21,302 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-10-01 00:01:21,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:21,302 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-01 00:01:21,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-01 00:01:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-01 00:01:21,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-01 00:01:21,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:21,303 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2018-10-01 00:01:21,303 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:21,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:21,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2018-10-01 00:01:21,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:21,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:21,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:21,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:21,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:21,996 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-01 00:01:21,997 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:21,997 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-01 00:01:22,004 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:01:22,084 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-01 00:01:22,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:22,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:22,092 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-01 00:01:22,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:22,100 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-01 00:01:22,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:22,477 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-01 00:01:22,498 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:22,499 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-10-01 00:01:22,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-01 00:01:22,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-01 00:01:22,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1006, Unknown=0, NotChecked=0, Total=1560 [2018-10-01 00:01:22,500 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2018-10-01 00:01:23,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:23,164 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-01 00:01:23,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:01:23,165 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2018-10-01 00:01:23,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:23,166 INFO L225 Difference]: With dead ends: 100 [2018-10-01 00:01:23,166 INFO L226 Difference]: Without dead ends: 99 [2018-10-01 00:01:23,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1160, Invalid=2262, Unknown=0, NotChecked=0, Total=3422 [2018-10-01 00:01:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-01 00:01:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-10-01 00:01:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-01 00:01:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-01 00:01:23,179 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-10-01 00:01:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:23,179 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-01 00:01:23,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-01 00:01:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-01 00:01:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-01 00:01:23,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:23,180 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2018-10-01 00:01:23,181 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:23,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:23,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2018-10-01 00:01:23,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:23,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:23,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:23,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:23,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:23,573 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-01 00:01:23,573 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:23,573 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-01 00:01:23,580 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:01:23,668 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-01 00:01:23,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:23,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:23,681 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-01 00:01:23,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:23,690 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-01 00:01:23,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:24,022 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-01 00:01:24,044 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:24,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-10-01 00:01:24,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-01 00:01:24,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-01 00:01:24,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=1109, Unknown=0, NotChecked=0, Total=1722 [2018-10-01 00:01:24,046 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2018-10-01 00:01:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:24,755 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-01 00:01:24,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:01:24,756 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2018-10-01 00:01:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:24,758 INFO L225 Difference]: With dead ends: 105 [2018-10-01 00:01:24,758 INFO L226 Difference]: Without dead ends: 104 [2018-10-01 00:01:24,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1281, Invalid=2501, Unknown=0, NotChecked=0, Total=3782 [2018-10-01 00:01:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-01 00:01:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-10-01 00:01:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-01 00:01:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-01 00:01:24,774 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-10-01 00:01:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:24,774 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-01 00:01:24,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-01 00:01:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-01 00:01:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-01 00:01:24,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:24,775 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2018-10-01 00:01:24,775 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:24,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:24,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2018-10-01 00:01:24,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:24,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:24,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:24,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:24,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:25,277 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-01 00:01:25,278 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:25,278 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-01 00:01:25,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:25,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:25,380 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-01 00:01:25,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:25,389 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-01 00:01:25,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:25,746 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-01 00:01:25,768 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:25,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-10-01 00:01:25,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-01 00:01:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-01 00:01:25,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1217, Unknown=0, NotChecked=0, Total=1892 [2018-10-01 00:01:25,770 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2018-10-01 00:01:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:26,519 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-01 00:01:26,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:01:26,523 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2018-10-01 00:01:26,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:26,524 INFO L225 Difference]: With dead ends: 110 [2018-10-01 00:01:26,524 INFO L226 Difference]: Without dead ends: 109 [2018-10-01 00:01:26,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1408, Invalid=2752, Unknown=0, NotChecked=0, Total=4160 [2018-10-01 00:01:26,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-01 00:01:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-10-01 00:01:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-01 00:01:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-01 00:01:26,538 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-10-01 00:01:26,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:26,538 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-01 00:01:26,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-01 00:01:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-01 00:01:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-01 00:01:26,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:26,539 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2018-10-01 00:01:26,539 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:26,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2018-10-01 00:01:26,540 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:26,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:26,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:26,973 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-01 00:01:26,974 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:26,974 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-01 00:01:26,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:01:27,054 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:01:27,054 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:27,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:27,062 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-01 00:01:27,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:27,070 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-01 00:01:27,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:28,826 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-01 00:01:28,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:28,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-10-01 00:01:28,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-01 00:01:28,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-01 00:01:28,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=740, Invalid=1330, Unknown=0, NotChecked=0, Total=2070 [2018-10-01 00:01:28,849 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2018-10-01 00:01:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:29,733 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-01 00:01:29,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:01:29,734 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2018-10-01 00:01:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:29,735 INFO L225 Difference]: With dead ends: 115 [2018-10-01 00:01:29,735 INFO L226 Difference]: Without dead ends: 114 [2018-10-01 00:01:29,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1541, Invalid=3015, Unknown=0, NotChecked=0, Total=4556 [2018-10-01 00:01:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-01 00:01:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-10-01 00:01:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-01 00:01:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-01 00:01:29,748 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-10-01 00:01:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:29,748 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-01 00:01:29,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-01 00:01:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-01 00:01:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-01 00:01:29,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:29,749 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2018-10-01 00:01:29,750 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:29,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:29,750 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2018-10-01 00:01:29,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:29,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:29,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:30,328 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-01 00:01:30,328 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:30,328 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-01 00:01:30,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:01:30,455 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-01 00:01:30,455 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:30,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:30,464 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-01 00:01:30,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:30,476 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-01 00:01:30,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:30,948 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-01 00:01:30,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:30,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-10-01 00:01:30,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-01 00:01:30,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-01 00:01:30,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=808, Invalid=1448, Unknown=0, NotChecked=0, Total=2256 [2018-10-01 00:01:30,970 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2018-10-01 00:01:31,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:31,834 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-01 00:01:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 00:01:31,834 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2018-10-01 00:01:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:31,836 INFO L225 Difference]: With dead ends: 120 [2018-10-01 00:01:31,836 INFO L226 Difference]: Without dead ends: 119 [2018-10-01 00:01:31,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1680, Invalid=3290, Unknown=0, NotChecked=0, Total=4970 [2018-10-01 00:01:31,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-01 00:01:31,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-10-01 00:01:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-01 00:01:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-01 00:01:31,854 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-10-01 00:01:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:31,854 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-01 00:01:31,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-01 00:01:31,854 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-01 00:01:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-01 00:01:31,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:31,855 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2018-10-01 00:01:31,855 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:31,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:31,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2018-10-01 00:01:31,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:31,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:31,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:31,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:31,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:32,905 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-01 00:01:32,905 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:32,905 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-01 00:01:32,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:01:32,990 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:01:32,990 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:32,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:33,015 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-01 00:01:33,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:33,105 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-01 00:01:33,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:33,633 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-01 00:01:33,653 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:33,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-10-01 00:01:33,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-01 00:01:33,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-01 00:01:33,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=1571, Unknown=0, NotChecked=0, Total=2450 [2018-10-01 00:01:33,655 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2018-10-01 00:01:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:34,546 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-01 00:01:34,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:01:34,547 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2018-10-01 00:01:34,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:34,548 INFO L225 Difference]: With dead ends: 125 [2018-10-01 00:01:34,548 INFO L226 Difference]: Without dead ends: 124 [2018-10-01 00:01:34,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1825, Invalid=3577, Unknown=0, NotChecked=0, Total=5402 [2018-10-01 00:01:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-01 00:01:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-10-01 00:01:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-01 00:01:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-01 00:01:34,567 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-10-01 00:01:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:34,567 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-01 00:01:34,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-01 00:01:34,568 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-01 00:01:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-01 00:01:34,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:34,569 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2018-10-01 00:01:34,569 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:34,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:34,569 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2018-10-01 00:01:34,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:34,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:34,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:34,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:34,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:35,753 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-01 00:01:35,753 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:35,753 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-01 00:01:35,760 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:01:35,879 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-01 00:01:35,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:35,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:35,892 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-01 00:01:35,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:35,900 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-01 00:01:35,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:36,369 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-01 00:01:36,389 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:36,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-10-01 00:01:36,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-01 00:01:36,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-01 00:01:36,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1699, Unknown=0, NotChecked=0, Total=2652 [2018-10-01 00:01:36,391 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2018-10-01 00:01:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:37,454 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-01 00:01:37,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:01:37,455 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2018-10-01 00:01:37,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:37,455 INFO L225 Difference]: With dead ends: 130 [2018-10-01 00:01:37,455 INFO L226 Difference]: Without dead ends: 129 [2018-10-01 00:01:37,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1976, Invalid=3876, Unknown=0, NotChecked=0, Total=5852 [2018-10-01 00:01:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-01 00:01:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-10-01 00:01:37,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-01 00:01:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-01 00:01:37,473 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-10-01 00:01:37,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:37,473 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-01 00:01:37,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-01 00:01:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-01 00:01:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-01 00:01:37,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:37,474 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2018-10-01 00:01:37,474 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:37,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:37,475 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2018-10-01 00:01:37,475 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:37,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:37,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:37,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:37,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:37,981 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-01 00:01:37,981 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:37,981 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-01 00:01:37,989 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:01:38,118 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-01 00:01:38,118 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:38,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:38,147 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-01 00:01:38,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:38,159 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-01 00:01:38,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:38,673 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-01 00:01:38,694 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:38,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-10-01 00:01:38,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-01 00:01:38,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-01 00:01:38,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1030, Invalid=1832, Unknown=0, NotChecked=0, Total=2862 [2018-10-01 00:01:38,696 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2018-10-01 00:01:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:39,697 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-01 00:01:39,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:01:39,698 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2018-10-01 00:01:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:39,699 INFO L225 Difference]: With dead ends: 135 [2018-10-01 00:01:39,699 INFO L226 Difference]: Without dead ends: 134 [2018-10-01 00:01:39,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1919 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2133, Invalid=4187, Unknown=0, NotChecked=0, Total=6320 [2018-10-01 00:01:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-01 00:01:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-10-01 00:01:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-01 00:01:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-01 00:01:39,722 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-10-01 00:01:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:39,723 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-01 00:01:39,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-01 00:01:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-01 00:01:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-01 00:01:39,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:39,724 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2018-10-01 00:01:39,724 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:39,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:39,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2018-10-01 00:01:39,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:39,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:39,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:40,572 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-01 00:01:40,572 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:40,572 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-01 00:01:40,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:40,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:40,711 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-01 00:01:40,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:40,719 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-01 00:01:40,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:41,243 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-01 00:01:41,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:41,264 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-10-01 00:01:41,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-01 00:01:41,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-01 00:01:41,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1110, Invalid=1970, Unknown=0, NotChecked=0, Total=3080 [2018-10-01 00:01:41,265 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2018-10-01 00:01:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:42,346 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-10-01 00:01:42,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:01:42,347 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2018-10-01 00:01:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:42,351 INFO L225 Difference]: With dead ends: 140 [2018-10-01 00:01:42,351 INFO L226 Difference]: Without dead ends: 139 [2018-10-01 00:01:42,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2296, Invalid=4510, Unknown=0, NotChecked=0, Total=6806 [2018-10-01 00:01:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-01 00:01:42,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-10-01 00:01:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-01 00:01:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-01 00:01:42,374 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-10-01 00:01:42,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:42,374 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-01 00:01:42,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-01 00:01:42,374 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-01 00:01:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-01 00:01:42,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:42,375 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2018-10-01 00:01:42,375 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:42,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:42,375 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2018-10-01 00:01:42,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:42,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:42,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:42,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:01:42,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:43,048 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-01 00:01:43,048 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:43,048 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-01 00:01:43,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:01:43,144 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:01:43,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:43,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:43,169 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-01 00:01:43,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:43,264 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-01 00:01:43,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:44,794 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-01 00:01:44,814 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:44,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-10-01 00:01:44,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-01 00:01:44,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-01 00:01:44,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=2113, Unknown=0, NotChecked=0, Total=3306 [2018-10-01 00:01:44,816 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2018-10-01 00:01:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:46,042 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-01 00:01:46,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:01:46,043 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2018-10-01 00:01:46,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:46,044 INFO L225 Difference]: With dead ends: 145 [2018-10-01 00:01:46,044 INFO L226 Difference]: Without dead ends: 144 [2018-10-01 00:01:46,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2465, Invalid=4845, Unknown=0, NotChecked=0, Total=7310 [2018-10-01 00:01:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-01 00:01:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-10-01 00:01:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-01 00:01:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-01 00:01:46,071 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-10-01 00:01:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:46,072 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-01 00:01:46,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-01 00:01:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-01 00:01:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-01 00:01:46,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:46,073 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2018-10-01 00:01:46,073 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:46,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:46,073 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2018-10-01 00:01:46,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:46,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:46,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:46,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:46,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:46,695 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-01 00:01:46,695 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:46,695 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-01 00:01:46,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:01:46,873 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-01 00:01:46,873 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:46,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:46,899 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-01 00:01:46,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:46,909 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-01 00:01:46,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:47,701 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-01 00:01:47,723 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:47,724 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-10-01 00:01:47,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-01 00:01:47,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-01 00:01:47,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=2261, Unknown=0, NotChecked=0, Total=3540 [2018-10-01 00:01:47,725 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2018-10-01 00:01:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:49,022 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-01 00:01:49,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:01:49,023 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2018-10-01 00:01:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:49,024 INFO L225 Difference]: With dead ends: 150 [2018-10-01 00:01:49,024 INFO L226 Difference]: Without dead ends: 149 [2018-10-01 00:01:49,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2640, Invalid=5192, Unknown=0, NotChecked=0, Total=7832 [2018-10-01 00:01:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-01 00:01:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-10-01 00:01:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-01 00:01:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-01 00:01:49,044 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-10-01 00:01:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:49,044 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-01 00:01:49,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-01 00:01:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-01 00:01:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-01 00:01:49,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:49,045 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2018-10-01 00:01:49,046 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:49,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2018-10-01 00:01:49,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:49,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:49,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:49,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:49,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:49,758 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-01 00:01:49,758 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:49,758 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-01 00:01:49,766 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:01:49,862 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:01:49,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:49,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:49,870 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-01 00:01:49,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:49,880 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-01 00:01:49,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:50,920 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-01 00:01:50,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:50,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-10-01 00:01:50,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-01 00:01:50,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-01 00:01:50,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=2414, Unknown=0, NotChecked=0, Total=3782 [2018-10-01 00:01:50,943 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2018-10-01 00:01:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:52,328 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-01 00:01:52,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 00:01:52,329 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2018-10-01 00:01:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:52,330 INFO L225 Difference]: With dead ends: 155 [2018-10-01 00:01:52,330 INFO L226 Difference]: Without dead ends: 154 [2018-10-01 00:01:52,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2575 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2821, Invalid=5551, Unknown=0, NotChecked=0, Total=8372 [2018-10-01 00:01:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-01 00:01:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-10-01 00:01:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-01 00:01:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-01 00:01:52,358 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-10-01 00:01:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:52,358 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-01 00:01:52,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-01 00:01:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-01 00:01:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-01 00:01:52,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:52,360 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2018-10-01 00:01:52,360 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:52,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:52,360 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2018-10-01 00:01:52,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:52,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:52,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:52,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:52,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:53,395 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-01 00:01:53,395 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:53,395 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-01 00:01:53,404 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:01:53,550 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-01 00:01:53,550 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:53,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:53,558 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-01 00:01:53,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:53,570 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-01 00:01:53,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:54,400 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-01 00:01:54,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:54,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-10-01 00:01:54,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-01 00:01:54,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-01 00:01:54,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1460, Invalid=2572, Unknown=0, NotChecked=0, Total=4032 [2018-10-01 00:01:54,423 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2018-10-01 00:01:55,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:55,833 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-01 00:01:55,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:01:55,833 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2018-10-01 00:01:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:55,835 INFO L225 Difference]: With dead ends: 160 [2018-10-01 00:01:55,835 INFO L226 Difference]: Without dead ends: 159 [2018-10-01 00:01:55,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3008, Invalid=5922, Unknown=0, NotChecked=0, Total=8930 [2018-10-01 00:01:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-01 00:01:55,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-10-01 00:01:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-01 00:01:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-01 00:01:55,861 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-10-01 00:01:55,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:55,862 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-01 00:01:55,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-01 00:01:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-01 00:01:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-01 00:01:55,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:55,863 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2018-10-01 00:01:55,863 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:55,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:55,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2018-10-01 00:01:55,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:55,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:55,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:55,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:56,686 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-01 00:01:56,686 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:56,686 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-01 00:01:56,694 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:01:56,901 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-01 00:01:56,901 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:01:56,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:01:56,909 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-01 00:01:56,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:01:56,920 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-01 00:01:56,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:01:57,623 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-01 00:01:57,644 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:01:57,644 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-10-01 00:01:57,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-01 00:01:57,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-01 00:01:57,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1555, Invalid=2735, Unknown=0, NotChecked=0, Total=4290 [2018-10-01 00:01:57,646 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2018-10-01 00:01:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:01:59,133 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-01 00:01:59,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:01:59,133 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2018-10-01 00:01:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:01:59,134 INFO L225 Difference]: With dead ends: 165 [2018-10-01 00:01:59,134 INFO L226 Difference]: Without dead ends: 164 [2018-10-01 00:01:59,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2939 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3201, Invalid=6305, Unknown=0, NotChecked=0, Total=9506 [2018-10-01 00:01:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-01 00:01:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-10-01 00:01:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-01 00:01:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-01 00:01:59,161 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-10-01 00:01:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:01:59,161 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-01 00:01:59,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-01 00:01:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-01 00:01:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-01 00:01:59,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:01:59,162 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2018-10-01 00:01:59,163 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:01:59,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:01:59,163 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2018-10-01 00:01:59,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:01:59,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:01:59,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:59,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:01:59,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:01:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:01:59,997 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-01 00:01:59,998 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:01:59,998 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-01 00:02:00,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:00,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:00,116 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-01 00:02:00,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:00,126 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-01 00:02:00,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:01,175 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-01 00:02:01,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:01,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-10-01 00:02:01,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-01 00:02:01,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-01 00:02:01,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=2903, Unknown=0, NotChecked=0, Total=4556 [2018-10-01 00:02:01,197 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2018-10-01 00:02:01,875 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-01 00:02:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:03,057 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-01 00:02:03,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:02:03,058 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2018-10-01 00:02:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:03,059 INFO L225 Difference]: With dead ends: 170 [2018-10-01 00:02:03,059 INFO L226 Difference]: Without dead ends: 169 [2018-10-01 00:02:03,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3130 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3400, Invalid=6700, Unknown=0, NotChecked=0, Total=10100 [2018-10-01 00:02:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-01 00:02:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-10-01 00:02:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-01 00:02:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-01 00:02:03,083 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-10-01 00:02:03,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:03,083 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-01 00:02:03,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-01 00:02:03,083 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-01 00:02:03,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-01 00:02:03,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:03,084 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2018-10-01 00:02:03,084 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:03,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2018-10-01 00:02:03,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:03,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:03,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:03,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:03,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:03,928 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-01 00:02:03,929 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:03,929 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-01 00:02:03,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:02:04,044 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:02:04,044 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:04,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:04,064 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-01 00:02:04,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:04,076 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-01 00:02:04,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:04,924 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-01 00:02:04,945 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:04,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-10-01 00:02:04,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-01 00:02:04,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-01 00:02:04,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1754, Invalid=3076, Unknown=0, NotChecked=0, Total=4830 [2018-10-01 00:02:04,947 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2018-10-01 00:02:06,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:06,814 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-01 00:02:06,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:02:06,815 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2018-10-01 00:02:06,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:06,816 INFO L225 Difference]: With dead ends: 175 [2018-10-01 00:02:06,816 INFO L226 Difference]: Without dead ends: 174 [2018-10-01 00:02:06,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3327 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3605, Invalid=7107, Unknown=0, NotChecked=0, Total=10712 [2018-10-01 00:02:06,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-01 00:02:06,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-10-01 00:02:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-01 00:02:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-01 00:02:06,849 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-10-01 00:02:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:06,849 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-01 00:02:06,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-01 00:02:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-01 00:02:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-01 00:02:06,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:06,850 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2018-10-01 00:02:06,851 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:06,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:06,851 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2018-10-01 00:02:06,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:06,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:06,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:06,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:06,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:07,778 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-01 00:02:07,778 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:07,778 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-01 00:02:07,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:02:07,978 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-01 00:02:07,978 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:07,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:07,990 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-01 00:02:07,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:08,001 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-01 00:02:08,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:08,902 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-01 00:02:08,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:08,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-10-01 00:02:08,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-01 00:02:08,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-01 00:02:08,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=3254, Unknown=0, NotChecked=0, Total=5112 [2018-10-01 00:02:08,924 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2018-10-01 00:02:10,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:10,466 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-10-01 00:02:10,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-01 00:02:10,466 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2018-10-01 00:02:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:10,467 INFO L225 Difference]: With dead ends: 180 [2018-10-01 00:02:10,467 INFO L226 Difference]: Without dead ends: 179 [2018-10-01 00:02:10,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3530 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3816, Invalid=7526, Unknown=0, NotChecked=0, Total=11342 [2018-10-01 00:02:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-01 00:02:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-10-01 00:02:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-01 00:02:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-01 00:02:10,495 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-10-01 00:02:10,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:10,496 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-01 00:02:10,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-01 00:02:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-01 00:02:10,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-01 00:02:10,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:10,497 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2018-10-01 00:02:10,497 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:10,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:10,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2018-10-01 00:02:10,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:10,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:10,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:10,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:10,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:11,688 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-01 00:02:11,689 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:11,689 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-01 00:02:11,697 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:02:11,818 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:02:11,818 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:11,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:11,855 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-01 00:02:11,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:11,946 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-01 00:02:11,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:12,900 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-01 00:02:12,921 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:12,921 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-10-01 00:02:12,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-01 00:02:12,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-01 00:02:12,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1965, Invalid=3437, Unknown=0, NotChecked=0, Total=5402 [2018-10-01 00:02:12,924 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2018-10-01 00:02:14,447 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-01 00:02:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:15,411 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-01 00:02:15,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:02:15,411 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2018-10-01 00:02:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:15,412 INFO L225 Difference]: With dead ends: 185 [2018-10-01 00:02:15,412 INFO L226 Difference]: Without dead ends: 184 [2018-10-01 00:02:15,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4033, Invalid=7957, Unknown=0, NotChecked=0, Total=11990 [2018-10-01 00:02:15,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-01 00:02:15,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-10-01 00:02:15,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-01 00:02:15,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-01 00:02:15,451 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-10-01 00:02:15,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:15,452 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-01 00:02:15,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-01 00:02:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-01 00:02:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-01 00:02:15,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:15,453 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2018-10-01 00:02:15,453 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:15,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:15,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2018-10-01 00:02:15,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:15,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:15,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:15,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:15,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:16,746 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-01 00:02:16,746 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:16,747 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-01 00:02:16,754 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:02:16,938 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-01 00:02:16,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:16,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:16,971 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-01 00:02:16,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:17,061 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-01 00:02:17,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:18,154 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-01 00:02:18,175 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:18,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-10-01 00:02:18,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-01 00:02:18,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-01 00:02:18,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2075, Invalid=3625, Unknown=0, NotChecked=0, Total=5700 [2018-10-01 00:02:18,177 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2018-10-01 00:02:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:19,819 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-01 00:02:19,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-01 00:02:19,819 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2018-10-01 00:02:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:19,820 INFO L225 Difference]: With dead ends: 190 [2018-10-01 00:02:19,820 INFO L226 Difference]: Without dead ends: 189 [2018-10-01 00:02:19,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3954 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4256, Invalid=8400, Unknown=0, NotChecked=0, Total=12656 [2018-10-01 00:02:19,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-01 00:02:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-10-01 00:02:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-01 00:02:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-01 00:02:19,851 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-10-01 00:02:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:19,851 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-01 00:02:19,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-01 00:02:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-01 00:02:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-01 00:02:19,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:19,852 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2018-10-01 00:02:19,852 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:19,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:19,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2018-10-01 00:02:19,853 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:19,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:19,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:19,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:19,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:20,885 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-01 00:02:20,885 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:20,886 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-01 00:02:20,893 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:02:21,110 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-01 00:02:21,110 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:21,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:21,134 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-01 00:02:21,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:21,233 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-01 00:02:21,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:23,483 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-01 00:02:23,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:23,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-10-01 00:02:23,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-01 00:02:23,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-01 00:02:23,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2188, Invalid=3818, Unknown=0, NotChecked=0, Total=6006 [2018-10-01 00:02:23,505 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2018-10-01 00:02:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:25,199 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-01 00:02:25,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-01 00:02:25,200 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2018-10-01 00:02:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:25,201 INFO L225 Difference]: With dead ends: 195 [2018-10-01 00:02:25,201 INFO L226 Difference]: Without dead ends: 194 [2018-10-01 00:02:25,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4175 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4485, Invalid=8855, Unknown=0, NotChecked=0, Total=13340 [2018-10-01 00:02:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-01 00:02:25,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-10-01 00:02:25,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-01 00:02:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-01 00:02:25,237 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-10-01 00:02:25,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:25,237 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-01 00:02:25,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-01 00:02:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-01 00:02:25,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-01 00:02:25,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:25,238 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2018-10-01 00:02:25,239 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:25,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:25,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2018-10-01 00:02:25,239 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:25,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:25,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:26,140 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-01 00:02:26,141 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:26,141 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-01 00:02:26,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:26,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:26,282 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-01 00:02:26,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:26,295 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-01 00:02:26,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:27,416 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-01 00:02:27,436 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:27,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-10-01 00:02:27,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-01 00:02:27,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-01 00:02:27,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2304, Invalid=4016, Unknown=0, NotChecked=0, Total=6320 [2018-10-01 00:02:27,438 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2018-10-01 00:02:29,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:29,209 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-10-01 00:02:29,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-01 00:02:29,209 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2018-10-01 00:02:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:29,210 INFO L225 Difference]: With dead ends: 200 [2018-10-01 00:02:29,211 INFO L226 Difference]: Without dead ends: 199 [2018-10-01 00:02:29,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4720, Invalid=9322, Unknown=0, NotChecked=0, Total=14042 [2018-10-01 00:02:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-01 00:02:29,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-10-01 00:02:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-01 00:02:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-10-01 00:02:29,252 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-10-01 00:02:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:29,252 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-10-01 00:02:29,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-01 00:02:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-10-01 00:02:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-01 00:02:29,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:29,253 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2018-10-01 00:02:29,253 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:29,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:29,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2018-10-01 00:02:29,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:29,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:29,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:29,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:30,946 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-01 00:02:30,947 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:30,947 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-01 00:02:30,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:02:31,091 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:02:31,092 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:31,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:31,110 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-01 00:02:31,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:31,119 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-01 00:02:31,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:32,529 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-01 00:02:32,549 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:32,550 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-10-01 00:02:32,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-01 00:02:32,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-01 00:02:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2423, Invalid=4219, Unknown=0, NotChecked=0, Total=6642 [2018-10-01 00:02:32,551 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2018-10-01 00:02:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:34,515 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-01 00:02:34,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-01 00:02:34,516 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2018-10-01 00:02:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:34,517 INFO L225 Difference]: With dead ends: 205 [2018-10-01 00:02:34,517 INFO L226 Difference]: Without dead ends: 204 [2018-10-01 00:02:34,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4635 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4961, Invalid=9801, Unknown=0, NotChecked=0, Total=14762 [2018-10-01 00:02:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-01 00:02:34,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-10-01 00:02:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-01 00:02:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-01 00:02:34,550 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-10-01 00:02:34,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:34,550 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-01 00:02:34,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-01 00:02:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-01 00:02:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-01 00:02:34,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:34,551 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2018-10-01 00:02:34,551 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:34,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:34,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2018-10-01 00:02:34,551 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:34,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:34,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:34,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:34,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:35,861 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-01 00:02:35,862 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:35,862 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-01 00:02:35,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:02:36,162 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-01 00:02:36,163 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:36,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:36,172 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-01 00:02:36,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:36,183 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-01 00:02:36,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:37,552 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-01 00:02:37,574 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:37,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-10-01 00:02:37,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-01 00:02:37,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-01 00:02:37,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2545, Invalid=4427, Unknown=0, NotChecked=0, Total=6972 [2018-10-01 00:02:37,575 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2018-10-01 00:02:39,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:39,466 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-10-01 00:02:39,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-01 00:02:39,466 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2018-10-01 00:02:39,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:39,467 INFO L225 Difference]: With dead ends: 210 [2018-10-01 00:02:39,467 INFO L226 Difference]: Without dead ends: 209 [2018-10-01 00:02:39,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4874 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5208, Invalid=10292, Unknown=0, NotChecked=0, Total=15500 [2018-10-01 00:02:39,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-01 00:02:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-10-01 00:02:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-01 00:02:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-01 00:02:39,508 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-10-01 00:02:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:39,508 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-01 00:02:39,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-01 00:02:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-01 00:02:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-01 00:02:39,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:39,509 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2018-10-01 00:02:39,510 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:39,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:39,510 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2018-10-01 00:02:39,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:39,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:39,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:39,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:39,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:40,590 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-01 00:02:40,590 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:40,590 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-01 00:02:40,599 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:02:40,735 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:02:40,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:40,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:40,749 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-01 00:02:40,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:40,757 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-01 00:02:40,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:42,150 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-01 00:02:42,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:42,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-10-01 00:02:42,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-01 00:02:42,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-01 00:02:42,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2670, Invalid=4640, Unknown=0, NotChecked=0, Total=7310 [2018-10-01 00:02:42,173 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2018-10-01 00:02:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:44,152 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-01 00:02:44,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-01 00:02:44,153 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2018-10-01 00:02:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:44,154 INFO L225 Difference]: With dead ends: 215 [2018-10-01 00:02:44,154 INFO L226 Difference]: Without dead ends: 214 [2018-10-01 00:02:44,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5119 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5461, Invalid=10795, Unknown=0, NotChecked=0, Total=16256 [2018-10-01 00:02:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-01 00:02:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-10-01 00:02:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-01 00:02:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-01 00:02:44,192 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-10-01 00:02:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:44,192 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-01 00:02:44,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-01 00:02:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-01 00:02:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-01 00:02:44,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:44,193 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2018-10-01 00:02:44,193 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:44,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:44,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2018-10-01 00:02:44,194 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:44,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:44,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:44,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:44,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:45,244 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-01 00:02:45,244 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:45,244 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-01 00:02:45,254 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:02:45,687 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-01 00:02:45,687 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:45,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:45,711 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-01 00:02:45,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:45,736 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-01 00:02:45,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:47,342 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-01 00:02:47,363 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:47,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-10-01 00:02:47,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-01 00:02:47,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-01 00:02:47,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2798, Invalid=4858, Unknown=0, NotChecked=0, Total=7656 [2018-10-01 00:02:47,365 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2018-10-01 00:02:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:49,447 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-01 00:02:49,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-01 00:02:49,448 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2018-10-01 00:02:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:49,449 INFO L225 Difference]: With dead ends: 220 [2018-10-01 00:02:49,449 INFO L226 Difference]: Without dead ends: 219 [2018-10-01 00:02:49,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5370 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5720, Invalid=11310, Unknown=0, NotChecked=0, Total=17030 [2018-10-01 00:02:49,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-01 00:02:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-10-01 00:02:49,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-01 00:02:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-01 00:02:49,495 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-10-01 00:02:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:49,495 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-01 00:02:49,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-01 00:02:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-01 00:02:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-01 00:02:49,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:49,496 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2018-10-01 00:02:49,496 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:49,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:49,497 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2018-10-01 00:02:49,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:49,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:49,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:49,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:49,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:50,615 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-01 00:02:50,615 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:50,615 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-01 00:02:50,624 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:02:50,894 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-01 00:02:50,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:02:50,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:50,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-01 00:02:50,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:50,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-01 00:02:50,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:52,386 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-01 00:02:52,408 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:52,408 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-10-01 00:02:52,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-01 00:02:52,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-01 00:02:52,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=5081, Unknown=0, NotChecked=0, Total=8010 [2018-10-01 00:02:52,410 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2018-10-01 00:02:52,764 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-01 00:02:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:02:55,111 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-01 00:02:55,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 00:02:55,111 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2018-10-01 00:02:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:02:55,112 INFO L225 Difference]: With dead ends: 225 [2018-10-01 00:02:55,112 INFO L226 Difference]: Without dead ends: 224 [2018-10-01 00:02:55,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5627 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5985, Invalid=11837, Unknown=0, NotChecked=0, Total=17822 [2018-10-01 00:02:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-01 00:02:55,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-10-01 00:02:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-01 00:02:55,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-01 00:02:55,152 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-10-01 00:02:55,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:02:55,152 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-01 00:02:55,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-01 00:02:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-01 00:02:55,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-01 00:02:55,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:02:55,153 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2018-10-01 00:02:55,153 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:02:55,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:02:55,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2018-10-01 00:02:55,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:02:55,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:02:55,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:55,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:02:55,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:02:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:56,333 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-01 00:02:56,333 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:02:56,333 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-01 00:02:56,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:02:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:02:56,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:02:56,496 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-01 00:02:56,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:02:56,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-01 00:02:56,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:02:58,072 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-01 00:02:58,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:02:58,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-10-01 00:02:58,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-01 00:02:58,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-01 00:02:58,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3063, Invalid=5309, Unknown=0, NotChecked=0, Total=8372 [2018-10-01 00:02:58,096 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2018-10-01 00:03:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:00,302 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-10-01 00:03:00,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-01 00:03:00,303 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2018-10-01 00:03:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:00,304 INFO L225 Difference]: With dead ends: 230 [2018-10-01 00:03:00,304 INFO L226 Difference]: Without dead ends: 229 [2018-10-01 00:03:00,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5890 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6256, Invalid=12376, Unknown=0, NotChecked=0, Total=18632 [2018-10-01 00:03:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-01 00:03:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-10-01 00:03:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-01 00:03:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-10-01 00:03:00,359 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-10-01 00:03:00,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:00,359 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-10-01 00:03:00,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-01 00:03:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-10-01 00:03:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-01 00:03:00,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:00,360 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2018-10-01 00:03:00,360 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:00,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:00,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2018-10-01 00:03:00,360 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:00,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:00,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:00,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:03:00,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:01,569 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-01 00:03:01,570 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:01,570 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-01 00:03:01,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:03:01,721 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:03:01,722 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:01,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:01,731 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-01 00:03:01,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:01,742 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-01 00:03:01,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:03,403 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-01 00:03:03,423 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:03,424 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-10-01 00:03:03,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-01 00:03:03,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-01 00:03:03,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3200, Invalid=5542, Unknown=0, NotChecked=0, Total=8742 [2018-10-01 00:03:03,425 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2018-10-01 00:03:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:05,867 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-01 00:03:05,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-01 00:03:05,867 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2018-10-01 00:03:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:05,868 INFO L225 Difference]: With dead ends: 235 [2018-10-01 00:03:05,868 INFO L226 Difference]: Without dead ends: 234 [2018-10-01 00:03:05,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6159 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6533, Invalid=12927, Unknown=0, NotChecked=0, Total=19460 [2018-10-01 00:03:05,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-01 00:03:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-10-01 00:03:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-01 00:03:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-01 00:03:05,928 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-10-01 00:03:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:05,928 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-01 00:03:05,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-01 00:03:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-01 00:03:05,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-01 00:03:05,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:05,930 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2018-10-01 00:03:05,930 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:05,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:05,930 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2018-10-01 00:03:05,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:05,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:05,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:05,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:05,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:07,814 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-01 00:03:07,814 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:07,815 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-01 00:03:07,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:03:08,133 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-01 00:03:08,133 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:08,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:08,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-01 00:03:08,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:08,155 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-01 00:03:08,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:09,596 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-01 00:03:09,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:09,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-10-01 00:03:09,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-01 00:03:09,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-01 00:03:09,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3340, Invalid=5780, Unknown=0, NotChecked=0, Total=9120 [2018-10-01 00:03:09,621 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2018-10-01 00:03:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:12,015 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-10-01 00:03:12,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-01 00:03:12,015 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2018-10-01 00:03:12,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:12,017 INFO L225 Difference]: With dead ends: 240 [2018-10-01 00:03:12,017 INFO L226 Difference]: Without dead ends: 239 [2018-10-01 00:03:12,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6434 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6816, Invalid=13490, Unknown=0, NotChecked=0, Total=20306 [2018-10-01 00:03:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-01 00:03:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-10-01 00:03:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-01 00:03:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-01 00:03:12,075 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-10-01 00:03:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:12,075 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-01 00:03:12,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-01 00:03:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-01 00:03:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-01 00:03:12,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:12,077 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2018-10-01 00:03:12,077 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:12,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:12,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2018-10-01 00:03:12,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:12,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:12,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:12,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:12,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:13,676 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-01 00:03:13,676 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:13,676 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-01 00:03:13,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:03:13,843 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:03:13,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:13,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:13,868 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-01 00:03:13,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:13,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-01 00:03:13,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:15,436 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-01 00:03:15,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:15,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-10-01 00:03:15,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-01 00:03:15,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-01 00:03:15,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3483, Invalid=6023, Unknown=0, NotChecked=0, Total=9506 [2018-10-01 00:03:15,459 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2018-10-01 00:03:18,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:18,221 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-01 00:03:18,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-01 00:03:18,222 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2018-10-01 00:03:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:18,223 INFO L225 Difference]: With dead ends: 245 [2018-10-01 00:03:18,223 INFO L226 Difference]: Without dead ends: 244 [2018-10-01 00:03:18,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6715 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7105, Invalid=14065, Unknown=0, NotChecked=0, Total=21170 [2018-10-01 00:03:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-01 00:03:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-10-01 00:03:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-01 00:03:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-01 00:03:18,284 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-10-01 00:03:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:18,285 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-01 00:03:18,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-01 00:03:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-01 00:03:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-01 00:03:18,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:18,286 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2018-10-01 00:03:18,286 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:18,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:18,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2018-10-01 00:03:18,287 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:18,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:18,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:18,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:18,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:19,873 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-01 00:03:19,873 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:19,873 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-01 00:03:19,880 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:03:20,179 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-01 00:03:20,179 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:20,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:20,191 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-01 00:03:20,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:20,199 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-01 00:03:20,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:21,743 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-01 00:03:21,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:21,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-10-01 00:03:21,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-01 00:03:21,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-01 00:03:21,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3629, Invalid=6271, Unknown=0, NotChecked=0, Total=9900 [2018-10-01 00:03:21,767 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2018-10-01 00:03:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:24,498 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-10-01 00:03:24,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 00:03:24,498 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2018-10-01 00:03:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:24,499 INFO L225 Difference]: With dead ends: 250 [2018-10-01 00:03:24,499 INFO L226 Difference]: Without dead ends: 249 [2018-10-01 00:03:24,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7002 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7400, Invalid=14652, Unknown=0, NotChecked=0, Total=22052 [2018-10-01 00:03:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-01 00:03:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-10-01 00:03:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-01 00:03:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-01 00:03:24,548 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-10-01 00:03:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:24,548 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-01 00:03:24,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-01 00:03:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-01 00:03:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-01 00:03:24,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:24,549 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2018-10-01 00:03:24,550 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:24,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:24,550 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2018-10-01 00:03:24,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:24,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:24,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:24,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:24,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:25,918 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-01 00:03:25,919 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:25,919 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-01 00:03:25,927 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:03:26,264 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-01 00:03:26,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:26,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:26,277 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-01 00:03:26,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:26,287 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-01 00:03:26,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:28,328 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-01 00:03:28,349 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:28,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-10-01 00:03:28,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-01 00:03:28,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-01 00:03:28,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3778, Invalid=6524, Unknown=0, NotChecked=0, Total=10302 [2018-10-01 00:03:28,352 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2018-10-01 00:03:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:31,205 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-10-01 00:03:31,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 00:03:31,206 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2018-10-01 00:03:31,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:31,207 INFO L225 Difference]: With dead ends: 255 [2018-10-01 00:03:31,207 INFO L226 Difference]: Without dead ends: 254 [2018-10-01 00:03:31,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7295 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7701, Invalid=15251, Unknown=0, NotChecked=0, Total=22952 [2018-10-01 00:03:31,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-01 00:03:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-10-01 00:03:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-01 00:03:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-01 00:03:31,277 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-10-01 00:03:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:31,277 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-01 00:03:31,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-01 00:03:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-01 00:03:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-01 00:03:31,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:31,279 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2018-10-01 00:03:31,279 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:31,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:31,280 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2018-10-01 00:03:31,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:31,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:31,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:31,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:31,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:32,729 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-01 00:03:32,730 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:32,730 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-01 00:03:32,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:03:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:32,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:32,907 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-01 00:03:32,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:32,918 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-01 00:03:32,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:34,780 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-01 00:03:34,803 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:34,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-10-01 00:03:34,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-01 00:03:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-01 00:03:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3930, Invalid=6782, Unknown=0, NotChecked=0, Total=10712 [2018-10-01 00:03:34,805 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2018-10-01 00:03:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:37,568 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-10-01 00:03:37,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-01 00:03:37,569 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2018-10-01 00:03:37,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:37,570 INFO L225 Difference]: With dead ends: 260 [2018-10-01 00:03:37,570 INFO L226 Difference]: Without dead ends: 259 [2018-10-01 00:03:37,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7594 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8008, Invalid=15862, Unknown=0, NotChecked=0, Total=23870 [2018-10-01 00:03:37,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-01 00:03:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-10-01 00:03:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-01 00:03:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-10-01 00:03:37,627 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-10-01 00:03:37,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:37,628 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-10-01 00:03:37,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-01 00:03:37,628 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-10-01 00:03:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-01 00:03:37,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:37,629 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2018-10-01 00:03:37,629 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:37,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:37,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2018-10-01 00:03:37,630 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:37,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:37,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:37,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:03:37,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:39,609 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-01 00:03:39,609 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:39,609 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-01 00:03:39,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:03:39,785 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:03:39,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:39,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:39,796 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-01 00:03:39,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:39,814 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-01 00:03:39,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:41,542 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-01 00:03:41,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:41,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-10-01 00:03:41,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-01 00:03:41,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-01 00:03:41,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4085, Invalid=7045, Unknown=0, NotChecked=0, Total=11130 [2018-10-01 00:03:41,567 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2018-10-01 00:03:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:44,613 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-01 00:03:44,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-01 00:03:44,613 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2018-10-01 00:03:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:44,614 INFO L225 Difference]: With dead ends: 265 [2018-10-01 00:03:44,614 INFO L226 Difference]: Without dead ends: 264 [2018-10-01 00:03:44,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7899 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8321, Invalid=16485, Unknown=0, NotChecked=0, Total=24806 [2018-10-01 00:03:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-01 00:03:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-10-01 00:03:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-01 00:03:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-01 00:03:44,672 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-10-01 00:03:44,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:44,672 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-01 00:03:44,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-01 00:03:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-01 00:03:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-01 00:03:44,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:44,673 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2018-10-01 00:03:44,674 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:44,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:44,674 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2018-10-01 00:03:44,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:44,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:44,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:44,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:44,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:46,320 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-01 00:03:46,320 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:46,320 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-01 00:03:46,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:03:46,697 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-01 00:03:46,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:46,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:46,715 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-01 00:03:46,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:46,723 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-01 00:03:46,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:48,725 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-01 00:03:48,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:48,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-10-01 00:03:48,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-01 00:03:48,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-01 00:03:48,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4243, Invalid=7313, Unknown=0, NotChecked=0, Total=11556 [2018-10-01 00:03:48,750 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2018-10-01 00:03:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:51,648 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-10-01 00:03:51,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-01 00:03:51,648 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2018-10-01 00:03:51,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:51,649 INFO L225 Difference]: With dead ends: 270 [2018-10-01 00:03:51,649 INFO L226 Difference]: Without dead ends: 269 [2018-10-01 00:03:51,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8210 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8640, Invalid=17120, Unknown=0, NotChecked=0, Total=25760 [2018-10-01 00:03:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-01 00:03:51,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-10-01 00:03:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-01 00:03:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-10-01 00:03:51,712 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-10-01 00:03:51,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:51,712 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-10-01 00:03:51,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-01 00:03:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-10-01 00:03:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-01 00:03:51,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:51,713 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2018-10-01 00:03:51,713 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:51,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2018-10-01 00:03:51,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:51,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:51,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:51,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:51,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:03:53,808 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-01 00:03:53,809 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:03:53,809 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-01 00:03:53,818 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:03:53,999 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:03:53,999 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:03:54,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:03:54,012 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-01 00:03:54,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:03:54,020 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-01 00:03:54,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:03:55,854 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-01 00:03:55,876 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:03:55,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-10-01 00:03:55,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-01 00:03:55,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-01 00:03:55,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4404, Invalid=7586, Unknown=0, NotChecked=0, Total=11990 [2018-10-01 00:03:55,878 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2018-10-01 00:03:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:03:59,107 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-01 00:03:59,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-01 00:03:59,108 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2018-10-01 00:03:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:03:59,109 INFO L225 Difference]: With dead ends: 275 [2018-10-01 00:03:59,109 INFO L226 Difference]: Without dead ends: 274 [2018-10-01 00:03:59,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8527 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8965, Invalid=17767, Unknown=0, NotChecked=0, Total=26732 [2018-10-01 00:03:59,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-01 00:03:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-10-01 00:03:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-01 00:03:59,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-01 00:03:59,167 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2018-10-01 00:03:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:03:59,168 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-01 00:03:59,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-01 00:03:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-01 00:03:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-01 00:03:59,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:03:59,169 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2018-10-01 00:03:59,169 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:03:59,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:03:59,170 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2018-10-01 00:03:59,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:03:59,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:03:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:59,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:03:59,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:03:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:00,894 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-01 00:04:00,895 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:00,895 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-01 00:04:00,902 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:04:01,269 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-01 00:04:01,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:01,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:01,282 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-01 00:04:01,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:01,294 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-01 00:04:01,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:03,201 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-01 00:04:03,223 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:03,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-10-01 00:04:03,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-01 00:04:03,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-01 00:04:03,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4568, Invalid=7864, Unknown=0, NotChecked=0, Total=12432 [2018-10-01 00:04:03,225 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2018-10-01 00:04:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:06,487 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-10-01 00:04:06,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-01 00:04:06,487 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2018-10-01 00:04:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:06,488 INFO L225 Difference]: With dead ends: 280 [2018-10-01 00:04:06,488 INFO L226 Difference]: Without dead ends: 279 [2018-10-01 00:04:06,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8850 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9296, Invalid=18426, Unknown=0, NotChecked=0, Total=27722 [2018-10-01 00:04:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-01 00:04:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2018-10-01 00:04:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-01 00:04:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-10-01 00:04:06,555 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2018-10-01 00:04:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:06,555 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-10-01 00:04:06,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-01 00:04:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-10-01 00:04:06,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-01 00:04:06,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:06,557 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2018-10-01 00:04:06,557 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:06,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:06,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2018-10-01 00:04:06,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:06,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:06,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:06,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:06,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:08,175 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-01 00:04:08,175 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:08,175 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-01 00:04:08,183 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:04:08,619 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-01 00:04:08,620 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:08,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:08,632 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-01 00:04:08,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:08,642 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-01 00:04:08,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:10,826 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-01 00:04:10,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:10,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-10-01 00:04:10,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-01 00:04:10,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-01 00:04:10,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4735, Invalid=8147, Unknown=0, NotChecked=0, Total=12882 [2018-10-01 00:04:10,850 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2018-10-01 00:04:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:14,238 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-10-01 00:04:14,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-01 00:04:14,238 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2018-10-01 00:04:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:14,239 INFO L225 Difference]: With dead ends: 285 [2018-10-01 00:04:14,239 INFO L226 Difference]: Without dead ends: 284 [2018-10-01 00:04:14,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9633, Invalid=19097, Unknown=0, NotChecked=0, Total=28730 [2018-10-01 00:04:14,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-01 00:04:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2018-10-01 00:04:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-01 00:04:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-01 00:04:14,302 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2018-10-01 00:04:14,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:14,302 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-01 00:04:14,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-01 00:04:14,302 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-01 00:04:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-01 00:04:14,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:14,303 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2018-10-01 00:04:14,304 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:14,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:14,304 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2018-10-01 00:04:14,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:14,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:14,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:14,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:14,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:15,963 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-01 00:04:15,964 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:15,964 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-01 00:04:15,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:04:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:16,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:16,161 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-01 00:04:16,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:16,175 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-01 00:04:16,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:18,304 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-01 00:04:18,325 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:18,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-10-01 00:04:18,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-01 00:04:18,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-01 00:04:18,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4905, Invalid=8435, Unknown=0, NotChecked=0, Total=13340 [2018-10-01 00:04:18,327 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2018-10-01 00:04:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:21,836 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-10-01 00:04:21,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-01 00:04:21,837 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2018-10-01 00:04:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:21,838 INFO L225 Difference]: With dead ends: 290 [2018-10-01 00:04:21,838 INFO L226 Difference]: Without dead ends: 289 [2018-10-01 00:04:21,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9514 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9976, Invalid=19780, Unknown=0, NotChecked=0, Total=29756 [2018-10-01 00:04:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-01 00:04:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2018-10-01 00:04:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-01 00:04:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-10-01 00:04:21,899 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2018-10-01 00:04:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:21,899 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-10-01 00:04:21,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-01 00:04:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-10-01 00:04:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-01 00:04:21,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:21,900 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2018-10-01 00:04:21,901 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:21,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:21,901 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2018-10-01 00:04:21,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:21,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:21,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:21,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:04:21,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:23,684 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-01 00:04:23,684 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:23,685 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-01 00:04:23,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:04:23,874 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:04:23,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:23,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:23,897 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-01 00:04:23,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:23,905 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-01 00:04:23,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:26,347 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-01 00:04:26,368 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:26,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-10-01 00:04:26,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-01 00:04:26,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-01 00:04:26,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5078, Invalid=8728, Unknown=0, NotChecked=0, Total=13806 [2018-10-01 00:04:26,370 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2018-10-01 00:04:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:29,886 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-01 00:04:29,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-01 00:04:29,886 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2018-10-01 00:04:29,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:29,887 INFO L225 Difference]: With dead ends: 295 [2018-10-01 00:04:29,887 INFO L226 Difference]: Without dead ends: 294 [2018-10-01 00:04:29,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9855 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10325, Invalid=20475, Unknown=0, NotChecked=0, Total=30800 [2018-10-01 00:04:29,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-01 00:04:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2018-10-01 00:04:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-01 00:04:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-01 00:04:29,954 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2018-10-01 00:04:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:29,954 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-01 00:04:29,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-01 00:04:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-01 00:04:29,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-01 00:04:29,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:29,956 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2018-10-01 00:04:29,956 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:29,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2018-10-01 00:04:29,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:29,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:29,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:29,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:29,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:31,738 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-01 00:04:31,738 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:31,738 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-01 00:04:31,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:04:32,196 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-01 00:04:32,197 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:32,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:32,210 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-01 00:04:32,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:32,219 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-01 00:04:32,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:34,691 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-01 00:04:34,713 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:34,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-10-01 00:04:34,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-01 00:04:34,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-01 00:04:34,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5254, Invalid=9026, Unknown=0, NotChecked=0, Total=14280 [2018-10-01 00:04:34,715 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2018-10-01 00:04:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:38,187 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-10-01 00:04:38,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-01 00:04:38,188 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2018-10-01 00:04:38,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:38,189 INFO L225 Difference]: With dead ends: 300 [2018-10-01 00:04:38,189 INFO L226 Difference]: Without dead ends: 299 [2018-10-01 00:04:38,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10202 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10680, Invalid=21182, Unknown=0, NotChecked=0, Total=31862 [2018-10-01 00:04:38,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-01 00:04:38,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-10-01 00:04:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-01 00:04:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-10-01 00:04:38,263 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2018-10-01 00:04:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:38,263 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-10-01 00:04:38,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-01 00:04:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-10-01 00:04:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-01 00:04:38,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:38,265 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2018-10-01 00:04:38,265 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:38,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:38,265 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2018-10-01 00:04:38,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:38,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:38,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:38,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:38,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:40,420 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-01 00:04:40,421 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:40,421 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-01 00:04:40,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:04:40,633 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:04:40,633 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:40,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:40,645 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-01 00:04:40,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:40,656 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-01 00:04:40,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:42,943 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-01 00:04:42,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:42,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-10-01 00:04:42,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-01 00:04:42,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-01 00:04:42,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5433, Invalid=9329, Unknown=0, NotChecked=0, Total=14762 [2018-10-01 00:04:42,967 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2018-10-01 00:04:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:46,726 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-01 00:04:46,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-01 00:04:46,727 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2018-10-01 00:04:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:46,728 INFO L225 Difference]: With dead ends: 305 [2018-10-01 00:04:46,728 INFO L226 Difference]: Without dead ends: 304 [2018-10-01 00:04:46,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10555 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11041, Invalid=21901, Unknown=0, NotChecked=0, Total=32942 [2018-10-01 00:04:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-01 00:04:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2018-10-01 00:04:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-01 00:04:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-01 00:04:46,794 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2018-10-01 00:04:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:46,794 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-01 00:04:46,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-01 00:04:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-01 00:04:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-01 00:04:46,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:46,795 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2018-10-01 00:04:46,796 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:46,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:46,796 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2018-10-01 00:04:46,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:46,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:46,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:46,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:46,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:48,641 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-01 00:04:48,641 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:48,641 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-01 00:04:48,648 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:04:49,063 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-01 00:04:49,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:49,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:49,076 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-01 00:04:49,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:49,087 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-01 00:04:49,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:04:51,727 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-01 00:04:51,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:04:51,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-10-01 00:04:51,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-01 00:04:51,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-01 00:04:51,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5615, Invalid=9637, Unknown=0, NotChecked=0, Total=15252 [2018-10-01 00:04:51,752 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2018-10-01 00:04:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:04:55,698 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-10-01 00:04:55,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-01 00:04:55,698 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2018-10-01 00:04:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:04:55,700 INFO L225 Difference]: With dead ends: 310 [2018-10-01 00:04:55,700 INFO L226 Difference]: Without dead ends: 309 [2018-10-01 00:04:55,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10914 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11408, Invalid=22632, Unknown=0, NotChecked=0, Total=34040 [2018-10-01 00:04:55,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-01 00:04:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2018-10-01 00:04:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-01 00:04:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-10-01 00:04:55,771 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2018-10-01 00:04:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:04:55,772 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-10-01 00:04:55,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-01 00:04:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-10-01 00:04:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-01 00:04:55,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:04:55,773 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2018-10-01 00:04:55,773 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:04:55,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:04:55,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2018-10-01 00:04:55,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:04:55,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:04:55,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:55,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:04:55,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:04:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:04:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:04:57,700 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:04:57,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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:04:57,708 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:04:58,218 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-01 00:04:58,218 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:04:58,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:04:58,236 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-01 00:04:58,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:04:58,245 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-01 00:04:58,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:00,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:00,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-10-01 00:05:00,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-01 00:05:00,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-01 00:05:00,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5800, Invalid=9950, Unknown=0, NotChecked=0, Total=15750 [2018-10-01 00:05:00,817 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2018-10-01 00:05:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:04,538 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-10-01 00:05:04,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-01 00:05:04,539 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2018-10-01 00:05:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:04,540 INFO L225 Difference]: With dead ends: 315 [2018-10-01 00:05:04,540 INFO L226 Difference]: Without dead ends: 314 [2018-10-01 00:05:04,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11279 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11781, Invalid=23375, Unknown=0, NotChecked=0, Total=35156 [2018-10-01 00:05:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-01 00:05:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2018-10-01 00:05:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-01 00:05:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-01 00:05:04,625 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2018-10-01 00:05:04,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:04,625 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-01 00:05:04,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-01 00:05:04,626 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-01 00:05:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-01 00:05:04,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:04,627 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2018-10-01 00:05:04,627 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:05:04,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:04,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2018-10-01 00:05:04,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:04,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:04,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:04,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:04,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:06,881 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:06,881 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:05:06,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:05:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:07,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:07,101 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-01 00:05:07,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:07,111 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-01 00:05:07,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:09,628 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:09,628 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-10-01 00:05:09,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-01 00:05:09,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-01 00:05:09,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5988, Invalid=10268, Unknown=0, NotChecked=0, Total=16256 [2018-10-01 00:05:09,631 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2018-10-01 00:05:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:13,790 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2018-10-01 00:05:13,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-01 00:05:13,790 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2018-10-01 00:05:13,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:13,791 INFO L225 Difference]: With dead ends: 320 [2018-10-01 00:05:13,791 INFO L226 Difference]: Without dead ends: 319 [2018-10-01 00:05:13,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11650 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=12160, Invalid=24130, Unknown=0, NotChecked=0, Total=36290 [2018-10-01 00:05:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-01 00:05:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2018-10-01 00:05:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-01 00:05:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2018-10-01 00:05:13,870 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2018-10-01 00:05:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:13,871 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2018-10-01 00:05:13,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-01 00:05:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2018-10-01 00:05:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-01 00:05:13,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:13,872 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2018-10-01 00:05:13,872 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:05:13,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:13,873 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2018-10-01 00:05:13,873 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:13,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:13,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:05:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:16,162 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:16,162 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:05:16,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:05:16,371 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:05:16,371 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:16,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:16,383 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-01 00:05:16,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:16,394 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-01 00:05:16,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:19,273 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:19,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-10-01 00:05:19,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-01 00:05:19,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-01 00:05:19,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6179, Invalid=10591, Unknown=0, NotChecked=0, Total=16770 [2018-10-01 00:05:19,276 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2018-10-01 00:05:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:23,309 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-10-01 00:05:23,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-01 00:05:23,309 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2018-10-01 00:05:23,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:23,311 INFO L225 Difference]: With dead ends: 325 [2018-10-01 00:05:23,311 INFO L226 Difference]: Without dead ends: 324 [2018-10-01 00:05:23,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12027 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12545, Invalid=24897, Unknown=0, NotChecked=0, Total=37442 [2018-10-01 00:05:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-01 00:05:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2018-10-01 00:05:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-01 00:05:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-10-01 00:05:23,405 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2018-10-01 00:05:23,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:23,405 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-10-01 00:05:23,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-01 00:05:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-10-01 00:05:23,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-01 00:05:23,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:23,407 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2018-10-01 00:05:23,407 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:05:23,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:23,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2018-10-01 00:05:23,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:23,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:23,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:23,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:23,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:25,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:25,522 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:25,522 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:05:25,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:05:26,063 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-01 00:05:26,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:26,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:26,078 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-01 00:05:26,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:26,088 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-01 00:05:26,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:28,787 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:28,787 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-10-01 00:05:28,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-01 00:05:28,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-01 00:05:28,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6373, Invalid=10919, Unknown=0, NotChecked=0, Total=17292 [2018-10-01 00:05:28,790 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2018-10-01 00:05:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:32,974 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-10-01 00:05:32,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-01 00:05:32,975 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2018-10-01 00:05:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:32,976 INFO L225 Difference]: With dead ends: 330 [2018-10-01 00:05:32,976 INFO L226 Difference]: Without dead ends: 329 [2018-10-01 00:05:32,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12410 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12936, Invalid=25676, Unknown=0, NotChecked=0, Total=38612 [2018-10-01 00:05:32,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-01 00:05:33,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2018-10-01 00:05:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-01 00:05:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-10-01 00:05:33,065 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2018-10-01 00:05:33,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:33,065 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-10-01 00:05:33,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-01 00:05:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-10-01 00:05:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-01 00:05:33,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:33,066 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2018-10-01 00:05:33,066 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:05:33,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:33,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2018-10-01 00:05:33,067 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:33,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:33,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:33,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:33,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:35,275 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:35,275 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:05:35,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:05:35,500 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:05:35,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:35,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:35,521 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-01 00:05:35,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:35,532 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-01 00:05:35,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:38,494 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:38,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-10-01 00:05:38,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-01 00:05:38,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-01 00:05:38,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6570, Invalid=11252, Unknown=0, NotChecked=0, Total=17822 [2018-10-01 00:05:38,496 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2018-10-01 00:05:42,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:42,931 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-10-01 00:05:42,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-01 00:05:42,931 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2018-10-01 00:05:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:42,933 INFO L225 Difference]: With dead ends: 335 [2018-10-01 00:05:42,933 INFO L226 Difference]: Without dead ends: 334 [2018-10-01 00:05:42,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12799 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=13333, Invalid=26467, Unknown=0, NotChecked=0, Total=39800 [2018-10-01 00:05:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-10-01 00:05:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2018-10-01 00:05:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-01 00:05:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-10-01 00:05:43,015 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2018-10-01 00:05:43,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:43,015 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-10-01 00:05:43,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-01 00:05:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-10-01 00:05:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-01 00:05:43,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:43,016 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2018-10-01 00:05:43,017 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:05:43,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:43,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2018-10-01 00:05:43,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:43,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:43,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:43,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:43,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:45,249 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:45,249 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:05:45,257 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:05:45,703 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-01 00:05:45,703 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:45,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:45,723 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-01 00:05:45,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:45,731 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-01 00:05:45,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:48,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:48,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-10-01 00:05:48,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-01 00:05:48,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-01 00:05:48,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6770, Invalid=11590, Unknown=0, NotChecked=0, Total=18360 [2018-10-01 00:05:48,823 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2018-10-01 00:05:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:05:53,466 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2018-10-01 00:05:53,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-01 00:05:53,467 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2018-10-01 00:05:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:05:53,468 INFO L225 Difference]: With dead ends: 340 [2018-10-01 00:05:53,468 INFO L226 Difference]: Without dead ends: 339 [2018-10-01 00:05:53,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13194 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13736, Invalid=27270, Unknown=0, NotChecked=0, Total=41006 [2018-10-01 00:05:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-01 00:05:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2018-10-01 00:05:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-01 00:05:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2018-10-01 00:05:53,559 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2018-10-01 00:05:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:05:53,559 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2018-10-01 00:05:53,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-01 00:05:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2018-10-01 00:05:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-10-01 00:05:53,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:05:53,560 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2018-10-01 00:05:53,561 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:05:53,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:05:53,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2018-10-01 00:05:53,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:05:53,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:05:53,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:53,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:05:53,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:05:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:05:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:55,844 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:05:55,844 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:05:55,852 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:05:56,417 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-01 00:05:56,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:05:56,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:05:56,432 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-01 00:05:56,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:05:56,439 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-01 00:05:56,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:05:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:05:59,335 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:05:59,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-10-01 00:05:59,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-01 00:05:59,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-01 00:05:59,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6973, Invalid=11933, Unknown=0, NotChecked=0, Total=18906 [2018-10-01 00:05:59,337 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2018-10-01 00:06:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:04,026 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-10-01 00:06:04,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-01 00:06:04,026 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2018-10-01 00:06:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:04,027 INFO L225 Difference]: With dead ends: 345 [2018-10-01 00:06:04,028 INFO L226 Difference]: Without dead ends: 344 [2018-10-01 00:06:04,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13595 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=14145, Invalid=28085, Unknown=0, NotChecked=0, Total=42230 [2018-10-01 00:06:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-01 00:06:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2018-10-01 00:06:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-01 00:06:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-10-01 00:06:04,116 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2018-10-01 00:06:04,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:04,116 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-10-01 00:06:04,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-01 00:06:04,116 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-10-01 00:06:04,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-10-01 00:06:04,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:04,118 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2018-10-01 00:06:04,118 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:06:04,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:04,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2018-10-01 00:06:04,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:04,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:04,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:04,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:06,516 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:06,517 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:06,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:06:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:06,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:06,769 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-01 00:06:06,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:06,777 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-01 00:06:06,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:09,761 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:09,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-10-01 00:06:09,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-01 00:06:09,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-01 00:06:09,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7179, Invalid=12281, Unknown=0, NotChecked=0, Total=19460 [2018-10-01 00:06:09,764 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2018-10-01 00:06:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:14,418 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2018-10-01 00:06:14,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-01 00:06:14,418 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2018-10-01 00:06:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:14,419 INFO L225 Difference]: With dead ends: 350 [2018-10-01 00:06:14,420 INFO L226 Difference]: Without dead ends: 349 [2018-10-01 00:06:14,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14002 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=14560, Invalid=28912, Unknown=0, NotChecked=0, Total=43472 [2018-10-01 00:06:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-01 00:06:14,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2018-10-01 00:06:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-01 00:06:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2018-10-01 00:06:14,508 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2018-10-01 00:06:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:14,508 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2018-10-01 00:06:14,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-10-01 00:06:14,508 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2018-10-01 00:06:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-01 00:06:14,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:14,510 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2018-10-01 00:06:14,510 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:06:14,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2018-10-01 00:06:14,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:14,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:14,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:14,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:06:14,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:17,230 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:17,230 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:17,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:06:17,486 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:06:17,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:06:17,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:17,506 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-01 00:06:17,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:17,514 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-01 00:06:17,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:20,437 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:20,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-10-01 00:06:20,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-10-01 00:06:20,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-10-01 00:06:20,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7388, Invalid=12634, Unknown=0, NotChecked=0, Total=20022 [2018-10-01 00:06:20,440 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2018-10-01 00:06:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:25,292 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-10-01 00:06:25,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-01 00:06:25,292 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2018-10-01 00:06:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:25,293 INFO L225 Difference]: With dead ends: 355 [2018-10-01 00:06:25,293 INFO L226 Difference]: Without dead ends: 354 [2018-10-01 00:06:25,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14415 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=14981, Invalid=29751, Unknown=0, NotChecked=0, Total=44732 [2018-10-01 00:06:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-01 00:06:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2018-10-01 00:06:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-01 00:06:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-10-01 00:06:25,393 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2018-10-01 00:06:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:25,394 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-10-01 00:06:25,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-10-01 00:06:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-10-01 00:06:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-01 00:06:25,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:25,395 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2018-10-01 00:06:25,395 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:06:25,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:25,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2018-10-01 00:06:25,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:25,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:25,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:25,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:25,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:28,138 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:28,138 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:28,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:06:28,775 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-01 00:06:28,775 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:06:28,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:28,789 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-01 00:06:28,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:28,801 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-01 00:06:28,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:31,847 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:31,847 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-10-01 00:06:31,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-10-01 00:06:31,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-10-01 00:06:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7600, Invalid=12992, Unknown=0, NotChecked=0, Total=20592 [2018-10-01 00:06:31,850 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2018-10-01 00:06:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:36,808 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2018-10-01 00:06:36,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-01 00:06:36,808 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2018-10-01 00:06:36,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:36,809 INFO L225 Difference]: With dead ends: 360 [2018-10-01 00:06:36,810 INFO L226 Difference]: Without dead ends: 359 [2018-10-01 00:06:36,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14834 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=15408, Invalid=30602, Unknown=0, NotChecked=0, Total=46010 [2018-10-01 00:06:36,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-01 00:06:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2018-10-01 00:06:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-01 00:06:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2018-10-01 00:06:36,906 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2018-10-01 00:06:36,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:36,907 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2018-10-01 00:06:36,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-10-01 00:06:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2018-10-01 00:06:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-01 00:06:36,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:36,908 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2018-10-01 00:06:36,908 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:06:36,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:36,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2018-10-01 00:06:36,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:36,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:36,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:36,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:36,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:39,643 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:39,643 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:39,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:06:39,899 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:06:39,900 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:06:39,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:39,915 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-01 00:06:39,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:39,923 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-01 00:06:39,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:43,380 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:43,380 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-10-01 00:06:43,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-10-01 00:06:43,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-10-01 00:06:43,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7815, Invalid=13355, Unknown=0, NotChecked=0, Total=21170 [2018-10-01 00:06:43,384 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2018-10-01 00:06:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:06:48,532 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-01 00:06:48,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-01 00:06:48,533 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2018-10-01 00:06:48,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:06:48,534 INFO L225 Difference]: With dead ends: 365 [2018-10-01 00:06:48,534 INFO L226 Difference]: Without dead ends: 364 [2018-10-01 00:06:48,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15259 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15841, Invalid=31465, Unknown=0, NotChecked=0, Total=47306 [2018-10-01 00:06:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-01 00:06:48,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2018-10-01 00:06:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-01 00:06:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-10-01 00:06:48,636 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2018-10-01 00:06:48,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:06:48,636 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-10-01 00:06:48,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-10-01 00:06:48,636 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-10-01 00:06:48,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-01 00:06:48,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:06:48,637 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2018-10-01 00:06:48,637 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:06:48,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:06:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2018-10-01 00:06:48,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:06:48,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:06:48,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:48,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:06:48,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:06:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:06:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:51,336 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:06:51,336 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:06:51,343 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:06:51,914 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-01 00:06:51,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:06:51,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:06:51,932 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-01 00:06:51,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:06:51,941 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-01 00:06:51,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:06:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:06:55,502 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:06:55,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-10-01 00:06:55,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-10-01 00:06:55,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-10-01 00:06:55,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8033, Invalid=13723, Unknown=0, NotChecked=0, Total=21756 [2018-10-01 00:06:55,506 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2018-10-01 00:07:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:00,708 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2018-10-01 00:07:00,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-01 00:07:00,708 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2018-10-01 00:07:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:00,709 INFO L225 Difference]: With dead ends: 370 [2018-10-01 00:07:00,709 INFO L226 Difference]: Without dead ends: 369 [2018-10-01 00:07:00,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15690 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=16280, Invalid=32340, Unknown=0, NotChecked=0, Total=48620 [2018-10-01 00:07:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-01 00:07:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-10-01 00:07:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-01 00:07:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2018-10-01 00:07:00,815 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2018-10-01 00:07:00,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:00,815 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2018-10-01 00:07:00,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-10-01 00:07:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2018-10-01 00:07:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-01 00:07:00,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:00,817 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2018-10-01 00:07:00,817 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:07:00,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:00,817 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2018-10-01 00:07:00,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:00,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:00,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:00,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:00,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:03,846 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:03,846 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:03,854 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:07:04,517 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-01 00:07:04,517 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:04,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:04,538 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-01 00:07:04,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:04,545 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-01 00:07:04,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:07,950 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:07,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-10-01 00:07:07,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-10-01 00:07:07,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-10-01 00:07:07,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8254, Invalid=14096, Unknown=0, NotChecked=0, Total=22350 [2018-10-01 00:07:07,954 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2018-10-01 00:07:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:13,546 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-10-01 00:07:13,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-01 00:07:13,546 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2018-10-01 00:07:13,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:13,548 INFO L225 Difference]: With dead ends: 375 [2018-10-01 00:07:13,548 INFO L226 Difference]: Without dead ends: 374 [2018-10-01 00:07:13,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16127 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=16725, Invalid=33227, Unknown=0, NotChecked=0, Total=49952 [2018-10-01 00:07:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-10-01 00:07:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2018-10-01 00:07:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-01 00:07:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-10-01 00:07:13,655 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2018-10-01 00:07:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:13,655 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-10-01 00:07:13,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-10-01 00:07:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-10-01 00:07:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-01 00:07:13,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:13,657 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2018-10-01 00:07:13,657 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:07:13,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2018-10-01 00:07:13,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:13,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:13,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:16,437 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:16,437 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:16,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:07:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:16,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:16,698 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-01 00:07:16,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:16,708 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-01 00:07:16,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:20,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:20,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-10-01 00:07:20,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-10-01 00:07:20,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-10-01 00:07:20,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8478, Invalid=14474, Unknown=0, NotChecked=0, Total=22952 [2018-10-01 00:07:20,287 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2018-10-01 00:07:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:25,668 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2018-10-01 00:07:25,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-01 00:07:25,668 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2018-10-01 00:07:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:25,670 INFO L225 Difference]: With dead ends: 380 [2018-10-01 00:07:25,670 INFO L226 Difference]: Without dead ends: 379 [2018-10-01 00:07:25,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16570 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=17176, Invalid=34126, Unknown=0, NotChecked=0, Total=51302 [2018-10-01 00:07:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-01 00:07:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2018-10-01 00:07:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-10-01 00:07:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2018-10-01 00:07:25,778 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2018-10-01 00:07:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:25,778 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2018-10-01 00:07:25,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-10-01 00:07:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2018-10-01 00:07:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-01 00:07:25,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:25,780 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2018-10-01 00:07:25,780 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:07:25,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2018-10-01 00:07:25,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:25,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:25,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:07:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:28,850 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:28,850 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:28,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:07:29,100 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:07:29,100 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:29,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:29,113 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-01 00:07:29,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:29,124 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-01 00:07:29,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:32,660 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:32,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2018-10-01 00:07:32,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-10-01 00:07:32,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-10-01 00:07:32,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8705, Invalid=14857, Unknown=0, NotChecked=0, Total=23562 [2018-10-01 00:07:32,663 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2018-10-01 00:07:38,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:38,291 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-10-01 00:07:38,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-01 00:07:38,291 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2018-10-01 00:07:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:38,293 INFO L225 Difference]: With dead ends: 385 [2018-10-01 00:07:38,293 INFO L226 Difference]: Without dead ends: 384 [2018-10-01 00:07:38,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17019 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=17633, Invalid=35037, Unknown=0, NotChecked=0, Total=52670 [2018-10-01 00:07:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-10-01 00:07:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2018-10-01 00:07:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-01 00:07:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-10-01 00:07:38,406 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2018-10-01 00:07:38,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:38,406 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-10-01 00:07:38,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-10-01 00:07:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-10-01 00:07:38,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-01 00:07:38,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:38,408 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2018-10-01 00:07:38,408 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:07:38,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:38,409 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2018-10-01 00:07:38,409 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:38,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:38,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:38,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:38,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:41,466 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:41,466 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:41,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:07:42,192 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-01 00:07:42,192 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:42,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:42,210 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-01 00:07:42,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:42,218 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-01 00:07:42,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:46,111 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:46,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 154 [2018-10-01 00:07:46,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-10-01 00:07:46,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-10-01 00:07:46,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8935, Invalid=15245, Unknown=0, NotChecked=0, Total=24180 [2018-10-01 00:07:46,114 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2018-10-01 00:07:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:07:51,838 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2018-10-01 00:07:51,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-01 00:07:51,839 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2018-10-01 00:07:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:07:51,840 INFO L225 Difference]: With dead ends: 390 [2018-10-01 00:07:51,840 INFO L226 Difference]: Without dead ends: 389 [2018-10-01 00:07:51,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17474 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=18096, Invalid=35960, Unknown=0, NotChecked=0, Total=54056 [2018-10-01 00:07:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-01 00:07:51,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2018-10-01 00:07:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-01 00:07:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2018-10-01 00:07:51,964 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2018-10-01 00:07:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:07:51,964 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2018-10-01 00:07:51,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-10-01 00:07:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2018-10-01 00:07:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-10-01 00:07:51,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:07:51,966 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2018-10-01 00:07:51,966 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:07:51,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:07:51,966 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2018-10-01 00:07:51,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:07:51,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:07:51,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:51,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:07:51,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:07:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:07:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:55,192 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:07:55,192 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:07:55,198 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:07:55,471 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:07:55,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:07:55,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:07:55,487 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-01 00:07:55,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:07:55,497 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-01 00:07:55,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:07:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:07:59,193 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:07:59,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 156 [2018-10-01 00:07:59,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-10-01 00:07:59,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-10-01 00:07:59,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9168, Invalid=15638, Unknown=0, NotChecked=0, Total=24806 [2018-10-01 00:07:59,197 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2018-10-01 00:08:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:08:05,009 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-10-01 00:08:05,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-01 00:08:05,009 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2018-10-01 00:08:05,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:08:05,011 INFO L225 Difference]: With dead ends: 395 [2018-10-01 00:08:05,011 INFO L226 Difference]: Without dead ends: 394 [2018-10-01 00:08:05,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17935 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=18565, Invalid=36895, Unknown=0, NotChecked=0, Total=55460 [2018-10-01 00:08:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-01 00:08:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2018-10-01 00:08:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-01 00:08:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2018-10-01 00:08:05,129 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2018-10-01 00:08:05,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:08:05,129 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2018-10-01 00:08:05,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-10-01 00:08:05,129 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2018-10-01 00:08:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-10-01 00:08:05,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:08:05,131 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2018-10-01 00:08:05,131 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:08:05,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:08:05,131 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2018-10-01 00:08:05,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:08:05,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:08:05,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:05,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:08:05,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:08,226 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:08,226 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:08,234 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:08:08,889 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-10-01 00:08:08,889 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:08:08,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:08,907 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-01 00:08:08,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:08,919 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-01 00:08:08,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:12,959 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:12,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 158 [2018-10-01 00:08:12,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-10-01 00:08:12,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-10-01 00:08:12,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9404, Invalid=16036, Unknown=0, NotChecked=0, Total=25440 [2018-10-01 00:08:12,963 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2018-10-01 00:08:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:08:19,011 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2018-10-01 00:08:19,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-01 00:08:19,011 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2018-10-01 00:08:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:08:19,012 INFO L225 Difference]: With dead ends: 400 [2018-10-01 00:08:19,012 INFO L226 Difference]: Without dead ends: 399 [2018-10-01 00:08:19,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18402 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=19040, Invalid=37842, Unknown=0, NotChecked=0, Total=56882 [2018-10-01 00:08:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-01 00:08:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2018-10-01 00:08:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-10-01 00:08:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2018-10-01 00:08:19,127 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2018-10-01 00:08:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:08:19,128 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2018-10-01 00:08:19,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-10-01 00:08:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2018-10-01 00:08:19,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-10-01 00:08:19,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:08:19,129 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2018-10-01 00:08:19,129 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:08:19,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:08:19,130 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2018-10-01 00:08:19,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:08:19,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:08:19,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:19,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:08:19,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:22,606 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:22,606 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:22,614 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:08:23,379 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-10-01 00:08:23,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:08:23,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:23,396 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-01 00:08:23,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:23,406 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-01 00:08:23,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:27,628 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:27,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 160 [2018-10-01 00:08:27,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-10-01 00:08:27,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-10-01 00:08:27,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9643, Invalid=16439, Unknown=0, NotChecked=0, Total=26082 [2018-10-01 00:08:27,631 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2018-10-01 00:08:33,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:08:33,550 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-10-01 00:08:33,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-01 00:08:33,550 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2018-10-01 00:08:33,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:08:33,552 INFO L225 Difference]: With dead ends: 405 [2018-10-01 00:08:33,552 INFO L226 Difference]: Without dead ends: 404 [2018-10-01 00:08:33,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18875 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=19521, Invalid=38801, Unknown=0, NotChecked=0, Total=58322 [2018-10-01 00:08:33,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-01 00:08:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2018-10-01 00:08:33,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-01 00:08:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-10-01 00:08:33,676 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2018-10-01 00:08:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:08:33,677 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-10-01 00:08:33,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-10-01 00:08:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-10-01 00:08:33,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-01 00:08:33,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:08:33,678 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2018-10-01 00:08:33,679 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:08:33,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:08:33,679 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2018-10-01 00:08:33,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:08:33,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:08:33,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:33,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:08:33,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:37,137 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:37,137 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:37,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:08:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:37,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:37,418 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-01 00:08:37,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:37,430 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-01 00:08:37,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:41,726 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:41,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 162 [2018-10-01 00:08:41,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-10-01 00:08:41,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-10-01 00:08:41,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9885, Invalid=16847, Unknown=0, NotChecked=0, Total=26732 [2018-10-01 00:08:41,730 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2018-10-01 00:08:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:08:48,109 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2018-10-01 00:08:48,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-01 00:08:48,109 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2018-10-01 00:08:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:08:48,111 INFO L225 Difference]: With dead ends: 410 [2018-10-01 00:08:48,111 INFO L226 Difference]: Without dead ends: 409 [2018-10-01 00:08:48,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19354 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=20008, Invalid=39772, Unknown=0, NotChecked=0, Total=59780 [2018-10-01 00:08:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-10-01 00:08:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2018-10-01 00:08:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-10-01 00:08:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2018-10-01 00:08:48,242 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2018-10-01 00:08:48,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:08:48,243 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2018-10-01 00:08:48,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-10-01 00:08:48,243 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2018-10-01 00:08:48,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-10-01 00:08:48,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:08:48,244 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2018-10-01 00:08:48,244 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:08:48,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:08:48,245 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2018-10-01 00:08:48,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:08:48,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:08:48,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:48,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:08:48,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:08:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:08:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:51,850 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:08:51,850 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:08:51,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:08:52,120 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:08:52,120 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:08:52,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:08:52,138 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-01 00:08:52,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:08:52,146 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-01 00:08:52,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:08:56,429 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:08:56,452 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:08:56,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 164 [2018-10-01 00:08:56,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-10-01 00:08:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-10-01 00:08:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10130, Invalid=17260, Unknown=0, NotChecked=0, Total=27390 [2018-10-01 00:08:56,456 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2018-10-01 00:09:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:09:02,969 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2018-10-01 00:09:02,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-01 00:09:02,970 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2018-10-01 00:09:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:09:02,971 INFO L225 Difference]: With dead ends: 415 [2018-10-01 00:09:02,971 INFO L226 Difference]: Without dead ends: 414 [2018-10-01 00:09:02,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19839 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=20501, Invalid=40755, Unknown=0, NotChecked=0, Total=61256 [2018-10-01 00:09:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-01 00:09:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2018-10-01 00:09:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-01 00:09:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-10-01 00:09:03,110 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2018-10-01 00:09:03,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:09:03,110 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-10-01 00:09:03,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-10-01 00:09:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-10-01 00:09:03,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-01 00:09:03,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:09:03,112 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2018-10-01 00:09:03,112 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:09:03,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:09:03,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2018-10-01 00:09:03,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:09:03,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:09:03,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:03,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:09:03,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:09:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:06,820 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:09:06,820 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:09:06,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:09:07,703 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-10-01 00:09:07,703 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:09:07,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:09:07,720 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-01 00:09:07,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:09:07,728 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-01 00:09:07,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:09:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:12,184 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:09:12,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 166 [2018-10-01 00:09:12,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-10-01 00:09:12,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-10-01 00:09:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10378, Invalid=17678, Unknown=0, NotChecked=0, Total=28056 [2018-10-01 00:09:12,187 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 168 states. [2018-10-01 00:09:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:09:18,651 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2018-10-01 00:09:18,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-01 00:09:18,652 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 410 [2018-10-01 00:09:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:09:18,653 INFO L225 Difference]: With dead ends: 420 [2018-10-01 00:09:18,653 INFO L226 Difference]: Without dead ends: 419 [2018-10-01 00:09:18,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20330 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=21000, Invalid=41750, Unknown=0, NotChecked=0, Total=62750 [2018-10-01 00:09:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-01 00:09:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2018-10-01 00:09:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-01 00:09:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2018-10-01 00:09:18,786 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2018-10-01 00:09:18,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:09:18,786 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2018-10-01 00:09:18,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-10-01 00:09:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2018-10-01 00:09:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-01 00:09:18,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:09:18,788 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2018-10-01 00:09:18,788 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:09:18,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:09:18,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1303415683, now seen corresponding path program 82 times [2018-10-01 00:09:18,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:09:18,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:09:18,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:18,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:09:18,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:09:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:22,539 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:09:22,539 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:09:22,547 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:09:22,841 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:09:22,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:09:22,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:09:22,858 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-01 00:09:22,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:09:22,868 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-01 00:09:22,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:09:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:27,406 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:09:27,407 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 168 [2018-10-01 00:09:27,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-10-01 00:09:27,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-10-01 00:09:27,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10629, Invalid=18101, Unknown=0, NotChecked=0, Total=28730 [2018-10-01 00:09:27,411 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 170 states. [2018-10-01 00:09:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:09:34,236 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-10-01 00:09:34,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-01 00:09:34,236 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 415 [2018-10-01 00:09:34,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:09:34,238 INFO L225 Difference]: With dead ends: 425 [2018-10-01 00:09:34,238 INFO L226 Difference]: Without dead ends: 424 [2018-10-01 00:09:34,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20827 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=21505, Invalid=42757, Unknown=0, NotChecked=0, Total=64262 [2018-10-01 00:09:34,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-10-01 00:09:34,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2018-10-01 00:09:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-01 00:09:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2018-10-01 00:09:34,372 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2018-10-01 00:09:34,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:09:34,373 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2018-10-01 00:09:34,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-10-01 00:09:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2018-10-01 00:09:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-10-01 00:09:34,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:09:34,375 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2018-10-01 00:09:34,375 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:09:34,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:09:34,376 INFO L82 PathProgramCache]: Analyzing trace with hash -734285197, now seen corresponding path program 83 times [2018-10-01 00:09:34,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:09:34,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:09:34,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:34,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:09:34,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:09:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:38,127 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:09:38,128 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:09:38,137 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:09:39,072 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-10-01 00:09:39,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:09:39,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:09:39,089 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-01 00:09:39,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:09:39,100 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-01 00:09:39,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:09:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:43,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:09:43,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 170 [2018-10-01 00:09:43,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-10-01 00:09:43,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-10-01 00:09:43,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10883, Invalid=18529, Unknown=0, NotChecked=0, Total=29412 [2018-10-01 00:09:43,738 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 172 states. [2018-10-01 00:09:50,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:09:50,425 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2018-10-01 00:09:50,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-01 00:09:50,426 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 420 [2018-10-01 00:09:50,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:09:50,427 INFO L225 Difference]: With dead ends: 430 [2018-10-01 00:09:50,428 INFO L226 Difference]: Without dead ends: 429 [2018-10-01 00:09:50,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21330 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=22016, Invalid=43776, Unknown=0, NotChecked=0, Total=65792 [2018-10-01 00:09:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-01 00:09:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2018-10-01 00:09:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-10-01 00:09:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2018-10-01 00:09:50,580 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 420 [2018-10-01 00:09:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:09:50,580 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2018-10-01 00:09:50,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-10-01 00:09:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2018-10-01 00:09:50,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-10-01 00:09:50,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:09:50,582 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1] [2018-10-01 00:09:50,583 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:09:50,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:09:50,583 INFO L82 PathProgramCache]: Analyzing trace with hash 507732355, now seen corresponding path program 84 times [2018-10-01 00:09:50,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:09:50,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:09:50,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:50,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:09:50,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:09:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:09:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:09:54,699 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:09:54,699 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:09:54,745 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:09:55,666 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-10-01 00:09:55,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:09:55,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:09:55,684 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-01 00:09:55,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:09:55,692 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-01 00:09:55,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:10:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:00,327 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:10:00,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 172 [2018-10-01 00:10:00,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-10-01 00:10:00,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-10-01 00:10:00,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11140, Invalid=18962, Unknown=0, NotChecked=0, Total=30102 [2018-10-01 00:10:00,331 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 174 states. [2018-10-01 00:10:07,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:10:07,406 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2018-10-01 00:10:07,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-01 00:10:07,406 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 425 [2018-10-01 00:10:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:10:07,408 INFO L225 Difference]: With dead ends: 435 [2018-10-01 00:10:07,408 INFO L226 Difference]: Without dead ends: 434 [2018-10-01 00:10:07,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21839 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=22533, Invalid=44807, Unknown=0, NotChecked=0, Total=67340 [2018-10-01 00:10:07,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-01 00:10:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2018-10-01 00:10:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-01 00:10:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2018-10-01 00:10:07,566 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 425 [2018-10-01 00:10:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:10:07,566 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2018-10-01 00:10:07,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-10-01 00:10:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2018-10-01 00:10:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-01 00:10:07,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:10:07,568 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1] [2018-10-01 00:10:07,568 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:10:07,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:10:07,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1140941709, now seen corresponding path program 85 times [2018-10-01 00:10:07,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:10:07,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:10:07,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:07,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:10:07,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:10:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:11,220 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:10:11,220 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:10:11,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:10:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:10:11,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:10:11,518 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-01 00:10:11,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:10:11,526 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-01 00:10:11,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:10:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:16,238 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:10:16,238 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 174 [2018-10-01 00:10:16,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-10-01 00:10:16,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-10-01 00:10:16,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11400, Invalid=19400, Unknown=0, NotChecked=0, Total=30800 [2018-10-01 00:10:16,241 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 176 states. [2018-10-01 00:10:23,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:10:23,254 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2018-10-01 00:10:23,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-01 00:10:23,255 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 430 [2018-10-01 00:10:23,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:10:23,256 INFO L225 Difference]: With dead ends: 440 [2018-10-01 00:10:23,256 INFO L226 Difference]: Without dead ends: 439 [2018-10-01 00:10:23,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22354 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=23056, Invalid=45850, Unknown=0, NotChecked=0, Total=68906 [2018-10-01 00:10:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-10-01 00:10:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2018-10-01 00:10:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-01 00:10:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2018-10-01 00:10:23,415 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 430 [2018-10-01 00:10:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:10:23,416 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2018-10-01 00:10:23,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-10-01 00:10:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2018-10-01 00:10:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-10-01 00:10:23,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:10:23,417 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 86, 1, 1] [2018-10-01 00:10:23,418 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:10:23,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:10:23,418 INFO L82 PathProgramCache]: Analyzing trace with hash 230864771, now seen corresponding path program 86 times [2018-10-01 00:10:23,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:10:23,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:10:23,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:23,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:10:23,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:10:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:27,230 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:10:27,230 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:10:27,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:10:27,521 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:10:27,522 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:10:27,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:10:27,538 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-01 00:10:27,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:10:27,547 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-01 00:10:27,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:10:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:32,310 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:10:32,311 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 176 [2018-10-01 00:10:32,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-10-01 00:10:32,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-10-01 00:10:32,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11663, Invalid=19843, Unknown=0, NotChecked=0, Total=31506 [2018-10-01 00:10:32,315 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 178 states. [2018-10-01 00:10:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:10:39,740 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-10-01 00:10:39,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-01 00:10:39,740 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 435 [2018-10-01 00:10:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:10:39,742 INFO L225 Difference]: With dead ends: 445 [2018-10-01 00:10:39,742 INFO L226 Difference]: Without dead ends: 444 [2018-10-01 00:10:39,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22875 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=23585, Invalid=46905, Unknown=0, NotChecked=0, Total=70490 [2018-10-01 00:10:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-10-01 00:10:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 441. [2018-10-01 00:10:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-10-01 00:10:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 441 transitions. [2018-10-01 00:10:39,901 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 441 transitions. Word has length 435 [2018-10-01 00:10:39,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:10:39,901 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 441 transitions. [2018-10-01 00:10:39,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-10-01 00:10:39,901 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 441 transitions. [2018-10-01 00:10:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-01 00:10:39,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:10:39,903 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 87, 87, 1, 1] [2018-10-01 00:10:39,903 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:10:39,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:10:39,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1688536691, now seen corresponding path program 87 times [2018-10-01 00:10:39,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:10:39,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:10:39,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:39,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:10:39,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:10:43,953 INFO L134 CoverageAnalysis]: Checked inductivity of 19053 backedges. 0 proven. 19053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:43,954 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:10:43,954 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:10:43,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:10:44,963 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-10-01 00:10:44,963 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:10:44,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:10:44,981 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-01 00:10:44,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:10:44,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-01 00:10:44,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:10:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 19053 backedges. 0 proven. 19053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:10:49,960 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:10:49,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 178 [2018-10-01 00:10:49,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-10-01 00:10:49,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-10-01 00:10:49,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11929, Invalid=20291, Unknown=0, NotChecked=0, Total=32220 [2018-10-01 00:10:49,963 INFO L87 Difference]: Start difference. First operand 441 states and 441 transitions. Second operand 180 states. [2018-10-01 00:10:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:10:57,203 INFO L93 Difference]: Finished difference Result 450 states and 450 transitions. [2018-10-01 00:10:57,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-01 00:10:57,203 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 440 [2018-10-01 00:10:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:10:57,205 INFO L225 Difference]: With dead ends: 450 [2018-10-01 00:10:57,205 INFO L226 Difference]: Without dead ends: 449 [2018-10-01 00:10:57,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23402 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=24120, Invalid=47972, Unknown=0, NotChecked=0, Total=72092 [2018-10-01 00:10:57,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-01 00:10:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 446. [2018-10-01 00:10:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-10-01 00:10:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 446 transitions. [2018-10-01 00:10:57,372 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 446 transitions. Word has length 440 [2018-10-01 00:10:57,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:10:57,372 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 446 transitions. [2018-10-01 00:10:57,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-10-01 00:10:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 446 transitions. [2018-10-01 00:10:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-10-01 00:10:57,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:10:57,374 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 88, 88, 1, 1] [2018-10-01 00:10:57,375 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:10:57,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:10:57,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1097953917, now seen corresponding path program 88 times [2018-10-01 00:10:57,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:10:57,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:10:57,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:57,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:10:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:10:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:11:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 19492 backedges. 0 proven. 19492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:01,610 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:11:01,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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:11:01,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:11:01,934 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:11:01,935 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:11:01,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:11:01,952 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-01 00:11:01,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:11:01,960 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-01 00:11:01,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:11:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 19492 backedges. 0 proven. 19492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:06,998 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:11:06,999 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 180 [2018-10-01 00:11:06,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-10-01 00:11:07,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-10-01 00:11:07,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12198, Invalid=20744, Unknown=0, NotChecked=0, Total=32942 [2018-10-01 00:11:07,003 INFO L87 Difference]: Start difference. First operand 446 states and 446 transitions. Second operand 182 states. [2018-10-01 00:11:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:11:14,587 INFO L93 Difference]: Finished difference Result 455 states and 455 transitions. [2018-10-01 00:11:14,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-01 00:11:14,587 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 445 [2018-10-01 00:11:14,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:11:14,589 INFO L225 Difference]: With dead ends: 455 [2018-10-01 00:11:14,589 INFO L226 Difference]: Without dead ends: 454 [2018-10-01 00:11:14,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23935 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=24661, Invalid=49051, Unknown=0, NotChecked=0, Total=73712 [2018-10-01 00:11:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-10-01 00:11:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 451. [2018-10-01 00:11:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-01 00:11:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-10-01 00:11:14,744 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 445 [2018-10-01 00:11:14,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:11:14,745 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-10-01 00:11:14,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-10-01 00:11:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-10-01 00:11:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-01 00:11:14,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:11:14,746 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 89, 89, 1, 1] [2018-10-01 00:11:14,747 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:11:14,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:11:14,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1479610253, now seen corresponding path program 89 times [2018-10-01 00:11:14,747 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:11:14,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:11:14,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:11:14,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:11:14,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:11:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:11:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 19936 backedges. 0 proven. 19936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:18,708 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:11:18,708 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:11:18,715 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:11:19,647 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2018-10-01 00:11:19,647 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:11:19,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:11:19,667 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-01 00:11:19,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:11:19,677 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-01 00:11:19,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:11:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 19936 backedges. 0 proven. 19936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:24,649 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:11:24,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 182 [2018-10-01 00:11:24,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-10-01 00:11:24,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-10-01 00:11:24,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12470, Invalid=21202, Unknown=0, NotChecked=0, Total=33672 [2018-10-01 00:11:24,653 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 184 states. [2018-10-01 00:11:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:11:31,779 INFO L93 Difference]: Finished difference Result 460 states and 460 transitions. [2018-10-01 00:11:31,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-01 00:11:31,779 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 450 [2018-10-01 00:11:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:11:31,781 INFO L225 Difference]: With dead ends: 460 [2018-10-01 00:11:31,781 INFO L226 Difference]: Without dead ends: 459 [2018-10-01 00:11:31,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24474 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=25208, Invalid=50142, Unknown=0, NotChecked=0, Total=75350 [2018-10-01 00:11:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-01 00:11:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 456. [2018-10-01 00:11:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-10-01 00:11:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 456 transitions. [2018-10-01 00:11:31,941 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 456 transitions. Word has length 450 [2018-10-01 00:11:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:11:31,942 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 456 transitions. [2018-10-01 00:11:31,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-10-01 00:11:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 456 transitions. [2018-10-01 00:11:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2018-10-01 00:11:31,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:11:31,944 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 90, 90, 1, 1] [2018-10-01 00:11:31,944 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:11:31,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:11:31,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1527178115, now seen corresponding path program 90 times [2018-10-01 00:11:31,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:11:31,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:11:31,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:11:31,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:11:31,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:11:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:11:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 20385 backedges. 0 proven. 20385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:35,979 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:11:35,979 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:11:35,987 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:11:36,961 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2018-10-01 00:11:36,961 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:11:36,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:11:36,979 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-01 00:11:36,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:11:36,990 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-01 00:11:36,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:11:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20385 backedges. 0 proven. 20385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:41,922 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:11:41,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 184 [2018-10-01 00:11:41,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-10-01 00:11:41,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-10-01 00:11:41,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12745, Invalid=21665, Unknown=0, NotChecked=0, Total=34410 [2018-10-01 00:11:41,925 INFO L87 Difference]: Start difference. First operand 456 states and 456 transitions. Second operand 186 states. [2018-10-01 00:11:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:11:49,056 INFO L93 Difference]: Finished difference Result 465 states and 465 transitions. [2018-10-01 00:11:49,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-01 00:11:49,057 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 455 [2018-10-01 00:11:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:11:49,058 INFO L225 Difference]: With dead ends: 465 [2018-10-01 00:11:49,058 INFO L226 Difference]: Without dead ends: 464 [2018-10-01 00:11:49,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25019 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=25761, Invalid=51245, Unknown=0, NotChecked=0, Total=77006 [2018-10-01 00:11:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-01 00:11:49,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 461. [2018-10-01 00:11:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-10-01 00:11:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 461 transitions. [2018-10-01 00:11:49,231 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 461 transitions. Word has length 455 [2018-10-01 00:11:49,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:11:49,231 INFO L480 AbstractCegarLoop]: Abstraction has 461 states and 461 transitions. [2018-10-01 00:11:49,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-10-01 00:11:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 461 transitions. [2018-10-01 00:11:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-10-01 00:11:49,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:11:49,233 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 91, 91, 1, 1] [2018-10-01 00:11:49,233 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:11:49,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:11:49,233 INFO L82 PathProgramCache]: Analyzing trace with hash -686007693, now seen corresponding path program 91 times [2018-10-01 00:11:49,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:11:49,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:11:49,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:11:49,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:11:49,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:11:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:11:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 20839 backedges. 0 proven. 20839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:53,427 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:11:53,427 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:11:53,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:11:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:11:53,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:11:53,735 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-01 00:11:53,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:11:53,743 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-01 00:11:53,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:11:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 20839 backedges. 0 proven. 20839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:11:58,893 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:11:58,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 186 [2018-10-01 00:11:58,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-10-01 00:11:58,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-10-01 00:11:58,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13023, Invalid=22133, Unknown=0, NotChecked=0, Total=35156 [2018-10-01 00:11:58,897 INFO L87 Difference]: Start difference. First operand 461 states and 461 transitions. Second operand 188 states. [2018-10-01 00:12:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:12:07,061 INFO L93 Difference]: Finished difference Result 470 states and 470 transitions. [2018-10-01 00:12:07,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-01 00:12:07,062 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 460 [2018-10-01 00:12:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:12:07,063 INFO L225 Difference]: With dead ends: 470 [2018-10-01 00:12:07,064 INFO L226 Difference]: Without dead ends: 469 [2018-10-01 00:12:07,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25570 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=26320, Invalid=52360, Unknown=0, NotChecked=0, Total=78680 [2018-10-01 00:12:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-10-01 00:12:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 466. [2018-10-01 00:12:07,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-10-01 00:12:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 466 transitions. [2018-10-01 00:12:07,234 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 466 transitions. Word has length 460 [2018-10-01 00:12:07,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:12:07,234 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 466 transitions. [2018-10-01 00:12:07,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-10-01 00:12:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 466 transitions. [2018-10-01 00:12:07,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-10-01 00:12:07,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:12:07,236 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 93, 92, 92, 1, 1] [2018-10-01 00:12:07,236 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:12:07,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:12:07,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1786005117, now seen corresponding path program 92 times [2018-10-01 00:12:07,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:12:07,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:12:07,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:07,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:12:07,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:12:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21298 backedges. 0 proven. 21298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:12:11,319 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:12:11,319 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:12:11,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:12:11,649 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:12:11,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:12:11,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:12:11,665 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-01 00:12:11,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:12:11,675 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-01 00:12:11,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:12:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 21298 backedges. 0 proven. 21298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:12:16,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:12:16,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 188 [2018-10-01 00:12:16,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-10-01 00:12:16,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-10-01 00:12:16,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13304, Invalid=22606, Unknown=0, NotChecked=0, Total=35910 [2018-10-01 00:12:16,692 INFO L87 Difference]: Start difference. First operand 466 states and 466 transitions. Second operand 190 states. [2018-10-01 00:12:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:12:24,379 INFO L93 Difference]: Finished difference Result 475 states and 475 transitions. [2018-10-01 00:12:24,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-01 00:12:24,379 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 465 [2018-10-01 00:12:24,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:12:24,381 INFO L225 Difference]: With dead ends: 475 [2018-10-01 00:12:24,381 INFO L226 Difference]: Without dead ends: 474 [2018-10-01 00:12:24,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26127 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=26885, Invalid=53487, Unknown=0, NotChecked=0, Total=80372 [2018-10-01 00:12:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-10-01 00:12:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 471. [2018-10-01 00:12:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-10-01 00:12:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 471 transitions. [2018-10-01 00:12:24,548 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 471 transitions. Word has length 465 [2018-10-01 00:12:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:12:24,548 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 471 transitions. [2018-10-01 00:12:24,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-10-01 00:12:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 471 transitions. [2018-10-01 00:12:24,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-10-01 00:12:24,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:12:24,550 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 93, 93, 1, 1] [2018-10-01 00:12:24,550 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:12:24,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:12:24,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1137884045, now seen corresponding path program 93 times [2018-10-01 00:12:24,551 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:12:24,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:12:24,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:24,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:12:24,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:12:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21762 backedges. 0 proven. 21762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:12:28,988 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:12:28,988 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:12:28,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:12:30,024 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2018-10-01 00:12:30,024 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:12:30,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:12:30,044 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-01 00:12:30,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:12:30,052 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-01 00:12:30,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:12:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 21762 backedges. 0 proven. 21762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:12:35,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:12:35,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 190 [2018-10-01 00:12:35,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-10-01 00:12:35,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-10-01 00:12:35,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13588, Invalid=23084, Unknown=0, NotChecked=0, Total=36672 [2018-10-01 00:12:35,232 INFO L87 Difference]: Start difference. First operand 471 states and 471 transitions. Second operand 192 states. [2018-10-01 00:12:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:12:43,054 INFO L93 Difference]: Finished difference Result 480 states and 480 transitions. [2018-10-01 00:12:43,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-01 00:12:43,054 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 470 [2018-10-01 00:12:43,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:12:43,056 INFO L225 Difference]: With dead ends: 480 [2018-10-01 00:12:43,056 INFO L226 Difference]: Without dead ends: 479 [2018-10-01 00:12:43,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26690 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=27456, Invalid=54626, Unknown=0, NotChecked=0, Total=82082 [2018-10-01 00:12:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-01 00:12:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 476. [2018-10-01 00:12:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-10-01 00:12:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 476 transitions. [2018-10-01 00:12:43,250 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 476 transitions. Word has length 470 [2018-10-01 00:12:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:12:43,250 INFO L480 AbstractCegarLoop]: Abstraction has 476 states and 476 transitions. [2018-10-01 00:12:43,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-10-01 00:12:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 476 transitions. [2018-10-01 00:12:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-10-01 00:12:43,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:12:43,252 INFO L375 BasicCegarLoop]: trace histogram [95, 95, 95, 94, 94, 1, 1] [2018-10-01 00:12:43,252 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:12:43,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:12:43,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1468199037, now seen corresponding path program 94 times [2018-10-01 00:12:43,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:12:43,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:12:43,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:43,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:12:43,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:12:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:12:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 22231 backedges. 0 proven. 22231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:12:47,614 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:12:47,614 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:12:47,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:12:47,953 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:12:47,953 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:12:47,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:12:47,971 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-01 00:12:47,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:12:47,981 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-01 00:12:47,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:12:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 22231 backedges. 0 proven. 22231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:12:53,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:12:53,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 192 [2018-10-01 00:12:53,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-10-01 00:12:53,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-10-01 00:12:53,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13875, Invalid=23567, Unknown=0, NotChecked=0, Total=37442 [2018-10-01 00:12:53,260 INFO L87 Difference]: Start difference. First operand 476 states and 476 transitions. Second operand 194 states. [2018-10-01 00:13:01,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:13:01,033 INFO L93 Difference]: Finished difference Result 485 states and 485 transitions. [2018-10-01 00:13:01,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-01 00:13:01,034 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 475 [2018-10-01 00:13:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:13:01,035 INFO L225 Difference]: With dead ends: 485 [2018-10-01 00:13:01,036 INFO L226 Difference]: Without dead ends: 484 [2018-10-01 00:13:01,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27259 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=28033, Invalid=55777, Unknown=0, NotChecked=0, Total=83810 [2018-10-01 00:13:01,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-01 00:13:01,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 481. [2018-10-01 00:13:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-10-01 00:13:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 481 transitions. [2018-10-01 00:13:01,237 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 481 transitions. Word has length 475 [2018-10-01 00:13:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:13:01,237 INFO L480 AbstractCegarLoop]: Abstraction has 481 states and 481 transitions. [2018-10-01 00:13:01,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-10-01 00:13:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 481 transitions. [2018-10-01 00:13:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-10-01 00:13:01,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:13:01,239 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 96, 95, 95, 1, 1] [2018-10-01 00:13:01,239 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:13:01,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:13:01,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1734234509, now seen corresponding path program 95 times [2018-10-01 00:13:01,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:13:01,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:13:01,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:13:01,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:13:01,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:13:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:13:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 22705 backedges. 0 proven. 22705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:13:05,636 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:13:05,636 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:13:05,646 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:13:06,487 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2018-10-01 00:13:06,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:13:06,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:13:06,506 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-01 00:13:06,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:13:06,510 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-01 00:13:06,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:13:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 22705 backedges. 0 proven. 22705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:13:11,810 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:13:11,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 194 [2018-10-01 00:13:11,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-10-01 00:13:11,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-10-01 00:13:11,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14165, Invalid=24055, Unknown=0, NotChecked=0, Total=38220 [2018-10-01 00:13:11,814 INFO L87 Difference]: Start difference. First operand 481 states and 481 transitions. Second operand 196 states. [2018-10-01 00:13:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:13:19,650 INFO L93 Difference]: Finished difference Result 490 states and 490 transitions. [2018-10-01 00:13:19,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-01 00:13:19,651 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 480 [2018-10-01 00:13:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:13:19,652 INFO L225 Difference]: With dead ends: 490 [2018-10-01 00:13:19,653 INFO L226 Difference]: Without dead ends: 489 [2018-10-01 00:13:19,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27834 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=28616, Invalid=56940, Unknown=0, NotChecked=0, Total=85556 [2018-10-01 00:13:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-10-01 00:13:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2018-10-01 00:13:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-10-01 00:13:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 486 transitions. [2018-10-01 00:13:19,844 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 486 transitions. Word has length 480 [2018-10-01 00:13:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:13:19,844 INFO L480 AbstractCegarLoop]: Abstraction has 486 states and 486 transitions. [2018-10-01 00:13:19,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-10-01 00:13:19,844 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 486 transitions. [2018-10-01 00:13:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-10-01 00:13:19,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:13:19,846 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 97, 96, 96, 1, 1] [2018-10-01 00:13:19,846 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:13:19,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:13:19,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1446700419, now seen corresponding path program 96 times [2018-10-01 00:13:19,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:13:19,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:13:19,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:13:19,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:13:19,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:13:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:13:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 23184 backedges. 0 proven. 23184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:13:24,298 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:13:24,298 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:13:24,305 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:13:25,445 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2018-10-01 00:13:25,446 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:13:25,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:13:25,468 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-01 00:13:25,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:13:25,476 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-01 00:13:25,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:13:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 23184 backedges. 0 proven. 23184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:13:31,059 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:13:31,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 196 [2018-10-01 00:13:31,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-10-01 00:13:31,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-10-01 00:13:31,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14458, Invalid=24548, Unknown=0, NotChecked=0, Total=39006 [2018-10-01 00:13:31,064 INFO L87 Difference]: Start difference. First operand 486 states and 486 transitions. Second operand 198 states. [2018-10-01 00:13:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:13:39,125 INFO L93 Difference]: Finished difference Result 495 states and 495 transitions. [2018-10-01 00:13:39,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-01 00:13:39,132 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 485 [2018-10-01 00:13:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:13:39,133 INFO L225 Difference]: With dead ends: 495 [2018-10-01 00:13:39,133 INFO L226 Difference]: Without dead ends: 494 [2018-10-01 00:13:39,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28415 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=29205, Invalid=58115, Unknown=0, NotChecked=0, Total=87320 [2018-10-01 00:13:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-10-01 00:13:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 491. [2018-10-01 00:13:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-10-01 00:13:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 491 transitions. [2018-10-01 00:13:39,346 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 491 transitions. Word has length 485 [2018-10-01 00:13:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:13:39,346 INFO L480 AbstractCegarLoop]: Abstraction has 491 states and 491 transitions. [2018-10-01 00:13:39,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-10-01 00:13:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 491 transitions. [2018-10-01 00:13:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-10-01 00:13:39,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:13:39,348 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 98, 97, 97, 1, 1] [2018-10-01 00:13:39,348 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-01 00:13:39,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-01 00:13:39,349 INFO L82 PathProgramCache]: Analyzing trace with hash 639211635, now seen corresponding path program 97 times [2018-10-01 00:13:39,349 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:13:39,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:13:39,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:13:39,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:13:39,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:13:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:13:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 23668 backedges. 0 proven. 23668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:13:43,956 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:13:43,956 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:13:43,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:13:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:13:44,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:13:44,283 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-01 00:13:44,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-01 00:13:44,291 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-01 00:13:44,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-01 00:13:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 23668 backedges. 0 proven. 23668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:13:49,798 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:13:49,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 198 [2018-10-01 00:13:49,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-10-01 00:13:49,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-10-01 00:13:49,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14754, Invalid=25046, Unknown=0, NotChecked=0, Total=39800 [2018-10-01 00:13:49,803 INFO L87 Difference]: Start difference. First operand 491 states and 491 transitions. Second operand 200 states. Received shutdown request... [2018-10-01 00:13:52,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-01 00:13:52,624 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-01 00:13:52,629 WARN L206 ceAbstractionStarter]: Timeout [2018-10-01 00:13:52,629 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:13:52 BoogieIcfgContainer [2018-10-01 00:13:52,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:13:52,630 INFO L168 Benchmark]: Toolchain (without parser) took 773781.89 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.8 GB). Free memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: -2.5 GB). Peak memory consumption was 233.3 MB. Max. memory is 7.1 GB. [2018-10-01 00:13:52,632 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:13:52,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:13:52,632 INFO L168 Benchmark]: Boogie Preprocessor took 25.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:13:52,633 INFO L168 Benchmark]: RCFGBuilder took 373.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:13:52,633 INFO L168 Benchmark]: TraceAbstraction took 773316.85 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.8 GB). Free memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: -2.6 GB). Peak memory consumption was 212.2 MB. Max. memory is 7.1 GB. [2018-10-01 00:13:52,634 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.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 373.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 773316.85 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.8 GB). Free memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: -2.6 GB). Peak memory consumption was 212.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (491states) and FLOYD_HOARE automaton (currently 55 states, 200 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 253 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (491states) and FLOYD_HOARE automaton (currently 55 states, 200 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 253 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 2 error locations. TIMEOUT Result, 773.2s OverallTime, 100 OverallIterations, 98 TraceHistogramMax, 327.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 218 SDtfs, 28552 SDslu, 309 SDs, 0 SdLazy, 41467 SolverSat, 14355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34012 GetRequests, 19208 SyntacticMatches, 0 SemanticMatches, 14803 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957968 ImplicationChecksByTransitivity, 610.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491occurred in iteration=99, 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: 6.6s AutomataMinimizationTime, 99 MinimizatonAttempts, 296 StatesRemovedByMinimization, 98 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 4.0s SsaConstructionTime, 30.4s SatisfiabilityAnalysisTime, 390.1s InterpolantComputationTime, 48517 NumberOfCodeBlocks, 48517 NumberOfCodeBlocksAsserted, 2613 NumberOfCheckSat, 48320 ConstructedInterpolants, 0 QuantifiedInterpolants, 127321255 SizeOfPredicates, 1055 NumberOfNonLiveVariables, 103111 ConjunctsInSsa, 16078 ConjunctsInUnsatCore, 197 InterpolantComputations, 3 PerfectInterpolantSequences, 2/1558986 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-simplified01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-13-52-642.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-13-52-642.csv Completed graceful shutdown