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_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 09:03:22,847 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 09:03:22,850 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 09:03:22,861 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 09:03:22,862 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 09:03:22,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 09:03:22,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 09:03:22,866 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 09:03:22,868 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 09:03:22,869 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 09:03:22,870 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 09:03:22,870 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 09:03:22,872 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 09:03:22,873 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 09:03:22,875 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 09:03:22,876 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 09:03:22,877 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 09:03:22,879 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 09:03:22,882 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 09:03:22,883 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 09:03:22,885 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 09:03:22,886 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 09:03:22,889 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 09:03:22,889 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 09:03:22,889 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 09:03:22,890 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 09:03:22,892 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 09:03:22,892 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 09:03:22,893 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 09:03:22,894 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 09:03:22,895 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 09:03:22,896 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 09:03:22,896 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 09:03:22,896 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 09:03:22,897 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 09:03:22,898 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 09:03:22,898 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-03 09:03:22,924 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 09:03:22,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 09:03:22,926 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 09:03:22,926 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 09:03:22,927 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 09:03:22,927 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 09:03:22,927 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 09:03:22,928 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 09:03:22,928 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 09:03:22,928 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 09:03:22,928 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 09:03:22,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 09:03:22,930 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 09:03:22,930 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 09:03:22,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 09:03:22,930 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 09:03:22,932 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 09:03:22,932 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 09:03:22,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 09:03:22,932 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 09:03:22,932 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 09:03:22,933 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 09:03:22,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:03:22,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 09:03:22,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 09:03:22,933 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 09:03:22,934 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 09:03:22,934 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 09:03:22,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 09:03:22,935 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 09:03:22,935 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-03 09:03:23,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 09:03:23,017 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 09:03:23,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 09:03:23,025 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 09:03:23,026 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 09:03:23,027 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl [2018-10-03 09:03:23,027 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithoutIf.bpl' [2018-10-03 09:03:23,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 09:03:23,092 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 09:03:23,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 09:03:23,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 09:03:23,094 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 09:03:23,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:03:23" (1/1) ... [2018-10-03 09:03:23,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:03:23" (1/1) ... [2018-10-03 09:03:23,131 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-03 09:03:23,131 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-03 09:03:23,131 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-03 09:03:23,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 09:03:23,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 09:03:23,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 09:03:23,135 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 09:03:23,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:03:23" (1/1) ... [2018-10-03 09:03:23,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:03:23" (1/1) ... [2018-10-03 09:03:23,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:03:23" (1/1) ... [2018-10-03 09:03:23,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:03:23" (1/1) ... [2018-10-03 09:03:23,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:03:23" (1/1) ... [2018-10-03 09:03:23,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:03:23" (1/1) ... [2018-10-03 09:03:23,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:03:23" (1/1) ... [2018-10-03 09:03:23,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 09:03:23,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 09:03:23,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 09:03:23,157 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 09:03:23,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:03:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:03:23,226 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-03 09:03:23,226 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-03 09:03:23,226 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-03 09:03:23,735 INFO L337 CfgBuilder]: Using library mode [2018-10-03 09:03:23,736 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:03:23 BoogieIcfgContainer [2018-10-03 09:03:23,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 09:03:23,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 09:03:23,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 09:03:23,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 09:03:23,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 09:03:23" (1/2) ... [2018-10-03 09:03:23,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7094b795 and model type threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 09:03:23, skipping insertion in model container [2018-10-03 09:03:23,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithoutIf.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 09:03:23" (2/2) ... [2018-10-03 09:03:23,747 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithoutIf.bpl [2018-10-03 09:03:23,758 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 09:03:23,770 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-03 09:03:23,815 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 09:03:23,816 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 09:03:23,816 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 09:03:23,816 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 09:03:23,817 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 09:03:23,817 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 09:03:23,817 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 09:03:23,817 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 09:03:23,817 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 09:03:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-03 09:03:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-03 09:03:23,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:23,841 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-03 09:03:23,842 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:23,848 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:23,848 INFO L82 PathProgramCache]: Analyzing trace with hash 927686, now seen corresponding path program 1 times [2018-10-03 09:03:23,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:23,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:23,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:23,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:23,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:24,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:24,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:24,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 09:03:24,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 09:03:24,073 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:24,075 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-10-03 09:03:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:24,538 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2018-10-03 09:03:24,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-03 09:03:24,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-03 09:03:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:24,568 INFO L225 Difference]: With dead ends: 32 [2018-10-03 09:03:24,568 INFO L226 Difference]: Without dead ends: 30 [2018-10-03 09:03:24,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-03 09:03:24,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-03 09:03:24,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-10-03 09:03:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-03 09:03:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2018-10-03 09:03:24,614 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 4 [2018-10-03 09:03:24,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:24,614 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2018-10-03 09:03:24,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 09:03:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-10-03 09:03:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-03 09:03:24,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:24,615 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-03 09:03:24,616 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:24,616 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:24,616 INFO L82 PathProgramCache]: Analyzing trace with hash 930088, now seen corresponding path program 1 times [2018-10-03 09:03:24,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:24,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:24,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:24,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:24,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:24,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:24,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:03:24,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 09:03:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 09:03:24,717 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:24,718 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2018-10-03 09:03:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:25,059 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2018-10-03 09:03:25,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-03 09:03:25,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-03 09:03:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:25,061 INFO L225 Difference]: With dead ends: 38 [2018-10-03 09:03:25,062 INFO L226 Difference]: Without dead ends: 36 [2018-10-03 09:03:25,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 4 [2018-10-03 09:03:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-03 09:03:25,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-10-03 09:03:25,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-03 09:03:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 47 transitions. [2018-10-03 09:03:25,071 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 47 transitions. Word has length 4 [2018-10-03 09:03:25,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:25,071 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 47 transitions. [2018-10-03 09:03:25,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 09:03:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 47 transitions. [2018-10-03 09:03:25,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-03 09:03:25,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:25,073 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-03 09:03:25,073 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:25,073 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:25,074 INFO L82 PathProgramCache]: Analyzing trace with hash 28768015, now seen corresponding path program 1 times [2018-10-03 09:03:25,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:25,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:25,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:25,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:25,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:25,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:25,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 09:03:25,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-03 09:03:25,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-03 09:03:25,168 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:25,169 INFO L87 Difference]: Start difference. First operand 30 states and 47 transitions. Second operand 6 states. [2018-10-03 09:03:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:25,923 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2018-10-03 09:03:25,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-03 09:03:25,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-03 09:03:25,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:25,928 INFO L225 Difference]: With dead ends: 43 [2018-10-03 09:03:25,928 INFO L226 Difference]: Without dead ends: 41 [2018-10-03 09:03:25,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 9 [2018-10-03 09:03:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-03 09:03:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-10-03 09:03:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-03 09:03:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2018-10-03 09:03:25,939 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 5 [2018-10-03 09:03:25,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:25,939 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2018-10-03 09:03:25,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-03 09:03:25,940 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-10-03 09:03:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-03 09:03:25,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:25,941 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-03 09:03:25,941 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:25,941 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:25,942 INFO L82 PathProgramCache]: Analyzing trace with hash 28831153, now seen corresponding path program 1 times [2018-10-03 09:03:25,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:25,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:25,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:25,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:25,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:26,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:26,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-03 09:03:26,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-03 09:03:26,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-03 09:03:26,087 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:26,087 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 6 states. [2018-10-03 09:03:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:26,364 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2018-10-03 09:03:26,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-03 09:03:26,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-03 09:03:26,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:26,367 INFO L225 Difference]: With dead ends: 54 [2018-10-03 09:03:26,367 INFO L226 Difference]: Without dead ends: 52 [2018-10-03 09:03:26,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-03 09:03:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-03 09:03:26,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-10-03 09:03:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-03 09:03:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 70 transitions. [2018-10-03 09:03:26,379 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 70 transitions. Word has length 5 [2018-10-03 09:03:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:26,379 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 70 transitions. [2018-10-03 09:03:26,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-03 09:03:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 70 transitions. [2018-10-03 09:03:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 09:03:26,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:26,381 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:26,381 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:26,381 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:26,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1974033510, now seen corresponding path program 1 times [2018-10-03 09:03:26,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:26,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:26,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:26,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:26,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:26,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:26,518 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:26,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:26,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:26,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:26,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-03 09:03:26,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 09:03:26,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 09:03:26,916 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:26,916 INFO L87 Difference]: Start difference. First operand 43 states and 70 transitions. Second operand 14 states. [2018-10-03 09:03:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:27,935 INFO L93 Difference]: Finished difference Result 107 states and 168 transitions. [2018-10-03 09:03:27,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-03 09:03:27,936 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-10-03 09:03:27,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:27,939 INFO L225 Difference]: With dead ends: 107 [2018-10-03 09:03:27,939 INFO L226 Difference]: Without dead ends: 106 [2018-10-03 09:03:27,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 12 [2018-10-03 09:03:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-03 09:03:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-10-03 09:03:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-03 09:03:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2018-10-03 09:03:27,956 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 8 [2018-10-03 09:03:27,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:27,956 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2018-10-03 09:03:27,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 09:03:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2018-10-03 09:03:27,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 09:03:27,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:27,958 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:27,958 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:27,958 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:27,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1974032228, now seen corresponding path program 1 times [2018-10-03 09:03:27,959 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:27,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:27,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:27,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:27,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:28,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:28,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-03 09:03:28,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 09:03:28,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 09:03:28,096 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:28,096 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand 8 states. [2018-10-03 09:03:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:28,566 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2018-10-03 09:03:28,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-03 09:03:28,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-03 09:03:28,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:28,568 INFO L225 Difference]: With dead ends: 95 [2018-10-03 09:03:28,568 INFO L226 Difference]: Without dead ends: 93 [2018-10-03 09:03:28,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 14 [2018-10-03 09:03:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-03 09:03:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2018-10-03 09:03:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-03 09:03:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 134 transitions. [2018-10-03 09:03:28,586 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 134 transitions. Word has length 8 [2018-10-03 09:03:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:28,586 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 134 transitions. [2018-10-03 09:03:28,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 09:03:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 134 transitions. [2018-10-03 09:03:28,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 09:03:28,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:28,587 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:28,588 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:28,588 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:28,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445341, now seen corresponding path program 1 times [2018-10-03 09:03:28,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:28,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:28,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:28,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:28,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:28,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:28,726 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:28,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:28,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:28,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:28,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-03 09:03:28,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 09:03:28,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 09:03:28,912 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:28,912 INFO L87 Difference]: Start difference. First operand 77 states and 134 transitions. Second operand 13 states. [2018-10-03 09:03:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:31,183 INFO L93 Difference]: Finished difference Result 150 states and 246 transitions. [2018-10-03 09:03:31,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-03 09:03:31,187 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-03 09:03:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:31,189 INFO L225 Difference]: With dead ends: 150 [2018-10-03 09:03:31,189 INFO L226 Difference]: Without dead ends: 148 [2018-10-03 09:03:31,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 26 [2018-10-03 09:03:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-03 09:03:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 106. [2018-10-03 09:03:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-03 09:03:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 185 transitions. [2018-10-03 09:03:31,216 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 185 transitions. Word has length 8 [2018-10-03 09:03:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:31,216 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 185 transitions. [2018-10-03 09:03:31,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 09:03:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 185 transitions. [2018-10-03 09:03:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 09:03:31,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:31,218 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:31,218 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:31,218 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:31,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1965445053, now seen corresponding path program 1 times [2018-10-03 09:03:31,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:31,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:31,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:31,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:31,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:31,299 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:31,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:31,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:31,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:31,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-10-03 09:03:31,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 09:03:31,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 09:03:31,687 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:31,687 INFO L87 Difference]: Start difference. First operand 106 states and 185 transitions. Second operand 13 states. [2018-10-03 09:03:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:33,116 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2018-10-03 09:03:33,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 09:03:33,116 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-03 09:03:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:33,120 INFO L225 Difference]: With dead ends: 137 [2018-10-03 09:03:33,120 INFO L226 Difference]: Without dead ends: 135 [2018-10-03 09:03:33,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 15 [2018-10-03 09:03:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-03 09:03:33,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-10-03 09:03:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-03 09:03:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 194 transitions. [2018-10-03 09:03:33,151 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 194 transitions. Word has length 8 [2018-10-03 09:03:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:33,152 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 194 transitions. [2018-10-03 09:03:33,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 09:03:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 194 transitions. [2018-10-03 09:03:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 09:03:33,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:33,153 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:33,154 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:33,154 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:33,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2040447037, now seen corresponding path program 1 times [2018-10-03 09:03:33,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:33,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:33,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:33,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:33,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:33,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:33,353 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:33,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:33,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:33,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:33,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2018-10-03 09:03:33,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 09:03:33,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 09:03:33,489 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:33,489 INFO L87 Difference]: Start difference. First operand 111 states and 194 transitions. Second operand 13 states. [2018-10-03 09:03:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:35,501 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2018-10-03 09:03:35,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 09:03:35,502 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2018-10-03 09:03:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:35,504 INFO L225 Difference]: With dead ends: 211 [2018-10-03 09:03:35,504 INFO L226 Difference]: Without dead ends: 209 [2018-10-03 09:03:35,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 15 [2018-10-03 09:03:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-03 09:03:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 173. [2018-10-03 09:03:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-03 09:03:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 304 transitions. [2018-10-03 09:03:35,541 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 304 transitions. Word has length 8 [2018-10-03 09:03:35,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:35,541 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 304 transitions. [2018-10-03 09:03:35,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 09:03:35,542 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2018-10-03 09:03:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 09:03:35,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:35,543 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:35,543 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:35,543 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:35,544 INFO L82 PathProgramCache]: Analyzing trace with hash -84509544, now seen corresponding path program 1 times [2018-10-03 09:03:35,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:35,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:35,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:35,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:35,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:35,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:35,635 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:35,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:35,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:35,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:35,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-03 09:03:35,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 09:03:35,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 09:03:35,725 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:35,726 INFO L87 Difference]: Start difference. First operand 173 states and 304 transitions. Second operand 11 states. [2018-10-03 09:03:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:36,377 INFO L93 Difference]: Finished difference Result 246 states and 415 transitions. [2018-10-03 09:03:36,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-03 09:03:36,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-10-03 09:03:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:36,379 INFO L225 Difference]: With dead ends: 246 [2018-10-03 09:03:36,380 INFO L226 Difference]: Without dead ends: 245 [2018-10-03 09:03:36,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-03 09:03:36,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-03 09:03:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 201. [2018-10-03 09:03:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-03 09:03:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 358 transitions. [2018-10-03 09:03:36,420 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 358 transitions. Word has length 8 [2018-10-03 09:03:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:36,420 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 358 transitions. [2018-10-03 09:03:36,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 09:03:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 358 transitions. [2018-10-03 09:03:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 09:03:36,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:36,421 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:36,422 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:36,422 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:36,422 INFO L82 PathProgramCache]: Analyzing trace with hash -84508262, now seen corresponding path program 1 times [2018-10-03 09:03:36,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:36,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:36,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:36,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:36,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:36,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:36,516 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:36,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:36,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:36,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:36,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-03 09:03:36,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:03:36,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:03:36,579 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:36,579 INFO L87 Difference]: Start difference. First operand 201 states and 358 transitions. Second operand 7 states. [2018-10-03 09:03:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:36,958 INFO L93 Difference]: Finished difference Result 252 states and 436 transitions. [2018-10-03 09:03:36,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-03 09:03:36,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-03 09:03:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:36,961 INFO L225 Difference]: With dead ends: 252 [2018-10-03 09:03:36,961 INFO L226 Difference]: Without dead ends: 250 [2018-10-03 09:03:36,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-03 09:03:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-03 09:03:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 210. [2018-10-03 09:03:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-03 09:03:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 375 transitions. [2018-10-03 09:03:36,998 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 375 transitions. Word has length 8 [2018-10-03 09:03:36,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:36,998 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 375 transitions. [2018-10-03 09:03:36,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:03:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 375 transitions. [2018-10-03 09:03:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 09:03:36,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:36,999 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:37,000 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:37,000 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:37,000 INFO L82 PathProgramCache]: Analyzing trace with hash -75921375, now seen corresponding path program 1 times [2018-10-03 09:03:37,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:37,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:37,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:37,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:37,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:37,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:37,077 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:37,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:37,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:37,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:37,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:37,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-03 09:03:37,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-03 09:03:37,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-03 09:03:37,216 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:37,216 INFO L87 Difference]: Start difference. First operand 210 states and 375 transitions. Second operand 10 states. [2018-10-03 09:03:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:37,782 INFO L93 Difference]: Finished difference Result 260 states and 452 transitions. [2018-10-03 09:03:37,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-03 09:03:37,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-10-03 09:03:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:37,785 INFO L225 Difference]: With dead ends: 260 [2018-10-03 09:03:37,785 INFO L226 Difference]: Without dead ends: 259 [2018-10-03 09:03:37,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-03 09:03:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-03 09:03:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 229. [2018-10-03 09:03:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-03 09:03:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 409 transitions. [2018-10-03 09:03:37,820 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 409 transitions. Word has length 8 [2018-10-03 09:03:37,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:37,821 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 409 transitions. [2018-10-03 09:03:37,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-03 09:03:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 409 transitions. [2018-10-03 09:03:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 09:03:37,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:37,823 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:37,823 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:37,823 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:37,824 INFO L82 PathProgramCache]: Analyzing trace with hash -75920285, now seen corresponding path program 1 times [2018-10-03 09:03:37,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:37,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:37,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:37,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:37,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:37,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:37,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-03 09:03:37,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:03:37,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:03:37,894 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:37,894 INFO L87 Difference]: Start difference. First operand 229 states and 409 transitions. Second operand 7 states. [2018-10-03 09:03:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:38,454 INFO L93 Difference]: Finished difference Result 316 states and 557 transitions. [2018-10-03 09:03:38,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 09:03:38,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-03 09:03:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:38,459 INFO L225 Difference]: With dead ends: 316 [2018-10-03 09:03:38,459 INFO L226 Difference]: Without dead ends: 314 [2018-10-03 09:03:38,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-03 09:03:38,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-03 09:03:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-10-03 09:03:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-03 09:03:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 438 transitions. [2018-10-03 09:03:38,499 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 438 transitions. Word has length 8 [2018-10-03 09:03:38,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:38,500 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 438 transitions. [2018-10-03 09:03:38,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:03:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 438 transitions. [2018-10-03 09:03:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-03 09:03:38,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:38,500 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:38,501 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:38,501 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:38,501 INFO L82 PathProgramCache]: Analyzing trace with hash -35778354, now seen corresponding path program 1 times [2018-10-03 09:03:38,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:38,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:38,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:38,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:38,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:38,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:38,579 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:38,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:38,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:38,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:38,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-03 09:03:38,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:03:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:03:38,652 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:38,652 INFO L87 Difference]: Start difference. First operand 245 states and 438 transitions. Second operand 7 states. [2018-10-03 09:03:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:39,013 INFO L93 Difference]: Finished difference Result 428 states and 767 transitions. [2018-10-03 09:03:39,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-03 09:03:39,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2018-10-03 09:03:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:39,017 INFO L225 Difference]: With dead ends: 428 [2018-10-03 09:03:39,017 INFO L226 Difference]: Without dead ends: 426 [2018-10-03 09:03:39,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 11 [2018-10-03 09:03:39,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-03 09:03:39,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 345. [2018-10-03 09:03:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-03 09:03:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 622 transitions. [2018-10-03 09:03:39,093 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 622 transitions. Word has length 8 [2018-10-03 09:03:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:39,094 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 622 transitions. [2018-10-03 09:03:39,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:03:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 622 transitions. [2018-10-03 09:03:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 09:03:39,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:39,095 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:39,095 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:39,096 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:39,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1740000584, now seen corresponding path program 1 times [2018-10-03 09:03:39,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:39,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:39,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:39,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:39,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:39,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:39,271 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:39,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:39,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:39,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:39,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-03 09:03:39,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-03 09:03:39,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-03 09:03:39,384 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:39,384 INFO L87 Difference]: Start difference. First operand 345 states and 622 transitions. Second operand 10 states. [2018-10-03 09:03:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:40,775 INFO L93 Difference]: Finished difference Result 466 states and 826 transitions. [2018-10-03 09:03:40,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 09:03:40,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-03 09:03:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:40,778 INFO L225 Difference]: With dead ends: 466 [2018-10-03 09:03:40,778 INFO L226 Difference]: Without dead ends: 464 [2018-10-03 09:03:40,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 13 [2018-10-03 09:03:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-03 09:03:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 351. [2018-10-03 09:03:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-03 09:03:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 634 transitions. [2018-10-03 09:03:40,867 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 634 transitions. Word has length 11 [2018-10-03 09:03:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:40,867 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 634 transitions. [2018-10-03 09:03:40,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-03 09:03:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 634 transitions. [2018-10-03 09:03:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 09:03:40,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:40,868 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:40,869 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:40,869 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:40,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1701828094, now seen corresponding path program 1 times [2018-10-03 09:03:40,869 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:40,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:40,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:40,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:40,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:41,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:41,420 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:41,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:41,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:41,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 09:03:41,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 14 [2018-10-03 09:03:41,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 09:03:41,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 09:03:41,576 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:41,576 INFO L87 Difference]: Start difference. First operand 351 states and 634 transitions. Second operand 14 states. [2018-10-03 09:03:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:43,282 INFO L93 Difference]: Finished difference Result 859 states and 1521 transitions. [2018-10-03 09:03:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-03 09:03:43,282 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-10-03 09:03:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:43,285 INFO L225 Difference]: With dead ends: 859 [2018-10-03 09:03:43,285 INFO L226 Difference]: Without dead ends: 509 [2018-10-03 09:03:43,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 19 [2018-10-03 09:03:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-10-03 09:03:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 388. [2018-10-03 09:03:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-03 09:03:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 697 transitions. [2018-10-03 09:03:43,367 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 697 transitions. Word has length 11 [2018-10-03 09:03:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:43,367 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 697 transitions. [2018-10-03 09:03:43,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 09:03:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 697 transitions. [2018-10-03 09:03:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 09:03:43,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:43,368 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:43,368 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:43,369 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:43,369 INFO L82 PathProgramCache]: Analyzing trace with hash 707064552, now seen corresponding path program 1 times [2018-10-03 09:03:43,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:43,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:43,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:43,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:43,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:43,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:43,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-03 09:03:43,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 09:03:43,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 09:03:43,474 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:43,474 INFO L87 Difference]: Start difference. First operand 388 states and 697 transitions. Second operand 8 states. [2018-10-03 09:03:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:44,058 INFO L93 Difference]: Finished difference Result 481 states and 848 transitions. [2018-10-03 09:03:44,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 09:03:44,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-03 09:03:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:44,061 INFO L225 Difference]: With dead ends: 481 [2018-10-03 09:03:44,061 INFO L226 Difference]: Without dead ends: 479 [2018-10-03 09:03:44,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 15 [2018-10-03 09:03:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-03 09:03:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 394. [2018-10-03 09:03:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-03 09:03:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 703 transitions. [2018-10-03 09:03:44,143 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 703 transitions. Word has length 11 [2018-10-03 09:03:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:44,143 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 703 transitions. [2018-10-03 09:03:44,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 09:03:44,143 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 703 transitions. [2018-10-03 09:03:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 09:03:44,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:44,144 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:44,144 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:44,144 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:44,145 INFO L82 PathProgramCache]: Analyzing trace with hash 739509354, now seen corresponding path program 1 times [2018-10-03 09:03:44,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:44,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:44,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:44,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:44,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:44,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:44,247 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:44,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:44,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:44,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:44,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-03 09:03:44,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 09:03:44,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 09:03:44,395 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:44,396 INFO L87 Difference]: Start difference. First operand 394 states and 703 transitions. Second operand 13 states. [2018-10-03 09:03:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:45,383 INFO L93 Difference]: Finished difference Result 952 states and 1676 transitions. [2018-10-03 09:03:45,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-03 09:03:45,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-03 09:03:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:45,386 INFO L225 Difference]: With dead ends: 952 [2018-10-03 09:03:45,386 INFO L226 Difference]: Without dead ends: 559 [2018-10-03 09:03:45,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 24 [2018-10-03 09:03:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-03 09:03:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 473. [2018-10-03 09:03:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-10-03 09:03:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 835 transitions. [2018-10-03 09:03:45,497 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 835 transitions. Word has length 11 [2018-10-03 09:03:45,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:45,497 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 835 transitions. [2018-10-03 09:03:45,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 09:03:45,497 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 835 transitions. [2018-10-03 09:03:45,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 09:03:45,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:45,498 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:45,498 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:45,498 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:45,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1106731073, now seen corresponding path program 1 times [2018-10-03 09:03:45,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:45,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:45,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:45,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:45,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:45,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:03:45,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-03 09:03:45,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-03 09:03:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-03 09:03:45,590 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:45,591 INFO L87 Difference]: Start difference. First operand 473 states and 835 transitions. Second operand 8 states. [2018-10-03 09:03:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:45,920 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-10-03 09:03:45,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 09:03:45,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-03 09:03:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:45,930 INFO L225 Difference]: With dead ends: 524 [2018-10-03 09:03:45,930 INFO L226 Difference]: Without dead ends: 522 [2018-10-03 09:03:45,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 11 [2018-10-03 09:03:45,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-10-03 09:03:46,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 485. [2018-10-03 09:03:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-10-03 09:03:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 855 transitions. [2018-10-03 09:03:46,053 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 855 transitions. Word has length 11 [2018-10-03 09:03:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:46,054 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 855 transitions. [2018-10-03 09:03:46,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-03 09:03:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 855 transitions. [2018-10-03 09:03:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 09:03:46,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:46,055 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:46,055 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:46,055 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:46,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1098144186, now seen corresponding path program 1 times [2018-10-03 09:03:46,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:46,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:46,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:46,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:46,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:46,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:46,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:46,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:46,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:47,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:47,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-10-03 09:03:47,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-03 09:03:47,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-03 09:03:47,237 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:47,237 INFO L87 Difference]: Start difference. First operand 485 states and 855 transitions. Second operand 9 states. [2018-10-03 09:03:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:47,956 INFO L93 Difference]: Finished difference Result 556 states and 964 transitions. [2018-10-03 09:03:47,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-03 09:03:47,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-10-03 09:03:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:47,959 INFO L225 Difference]: With dead ends: 556 [2018-10-03 09:03:47,959 INFO L226 Difference]: Without dead ends: 554 [2018-10-03 09:03:47,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.6s impTime 11 [2018-10-03 09:03:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-03 09:03:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 489. [2018-10-03 09:03:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-10-03 09:03:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 861 transitions. [2018-10-03 09:03:48,058 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 861 transitions. Word has length 11 [2018-10-03 09:03:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:48,059 INFO L480 AbstractCegarLoop]: Abstraction has 489 states and 861 transitions. [2018-10-03 09:03:48,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-03 09:03:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 861 transitions. [2018-10-03 09:03:48,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 09:03:48,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:48,060 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:48,060 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:48,060 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:48,060 INFO L82 PathProgramCache]: Analyzing trace with hash -772910566, now seen corresponding path program 1 times [2018-10-03 09:03:48,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:48,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:48,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:48,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:48,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:48,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:48,155 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:48,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:48,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:48,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:48,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 12 [2018-10-03 09:03:48,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 09:03:48,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 09:03:48,273 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:48,273 INFO L87 Difference]: Start difference. First operand 489 states and 861 transitions. Second operand 13 states. [2018-10-03 09:03:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:49,454 INFO L93 Difference]: Finished difference Result 631 states and 1077 transitions. [2018-10-03 09:03:49,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 09:03:49,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2018-10-03 09:03:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:49,457 INFO L225 Difference]: With dead ends: 631 [2018-10-03 09:03:49,457 INFO L226 Difference]: Without dead ends: 629 [2018-10-03 09:03:49,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.3s impTime 20 [2018-10-03 09:03:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-03 09:03:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 513. [2018-10-03 09:03:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-03 09:03:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 904 transitions. [2018-10-03 09:03:49,554 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 904 transitions. Word has length 11 [2018-10-03 09:03:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:49,554 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 904 transitions. [2018-10-03 09:03:49,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 09:03:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 904 transitions. [2018-10-03 09:03:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 09:03:49,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:49,555 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:49,555 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:49,555 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1674153000, now seen corresponding path program 2 times [2018-10-03 09:03:49,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:49,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:49,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:49,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:49,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:49,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:49,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:49,642 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:49,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:03:49,656 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:03:49,656 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:03:49,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:49,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:49,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-03 09:03:49,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:03:49,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:03:49,754 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:49,754 INFO L87 Difference]: Start difference. First operand 513 states and 904 transitions. Second operand 7 states. [2018-10-03 09:03:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:50,169 INFO L93 Difference]: Finished difference Result 601 states and 1040 transitions. [2018-10-03 09:03:50,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 09:03:50,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-03 09:03:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:50,173 INFO L225 Difference]: With dead ends: 601 [2018-10-03 09:03:50,173 INFO L226 Difference]: Without dead ends: 599 [2018-10-03 09:03:50,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-03 09:03:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-10-03 09:03:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 509. [2018-10-03 09:03:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-10-03 09:03:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 898 transitions. [2018-10-03 09:03:50,305 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 898 transitions. Word has length 11 [2018-10-03 09:03:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:50,306 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 898 transitions. [2018-10-03 09:03:50,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:03:50,306 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 898 transitions. [2018-10-03 09:03:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 09:03:50,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:50,307 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:50,307 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:50,307 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1682742259, now seen corresponding path program 1 times [2018-10-03 09:03:50,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:50,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:50,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:03:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:50,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:50,388 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:50,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:50,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:50,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:50,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-03 09:03:50,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:03:50,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:03:50,449 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:50,449 INFO L87 Difference]: Start difference. First operand 509 states and 898 transitions. Second operand 7 states. [2018-10-03 09:03:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:50,946 INFO L93 Difference]: Finished difference Result 624 states and 1088 transitions. [2018-10-03 09:03:50,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-03 09:03:50,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-03 09:03:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:50,948 INFO L225 Difference]: With dead ends: 624 [2018-10-03 09:03:50,949 INFO L226 Difference]: Without dead ends: 622 [2018-10-03 09:03:50,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-03 09:03:50,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-10-03 09:03:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 538. [2018-10-03 09:03:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-10-03 09:03:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 949 transitions. [2018-10-03 09:03:51,050 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 949 transitions. Word has length 11 [2018-10-03 09:03:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:51,050 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 949 transitions. [2018-10-03 09:03:51,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:03:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 949 transitions. [2018-10-03 09:03:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 09:03:51,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:51,051 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:51,051 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:51,051 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:51,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1927251354, now seen corresponding path program 1 times [2018-10-03 09:03:51,052 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:51,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:51,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:51,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:51,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:51,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:51,122 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:51,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:51,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:51,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:51,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-03 09:03:51,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:03:51,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:03:51,183 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:51,183 INFO L87 Difference]: Start difference. First operand 538 states and 949 transitions. Second operand 7 states. [2018-10-03 09:03:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:51,590 INFO L93 Difference]: Finished difference Result 584 states and 1012 transitions. [2018-10-03 09:03:51,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-03 09:03:51,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-03 09:03:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:51,592 INFO L225 Difference]: With dead ends: 584 [2018-10-03 09:03:51,592 INFO L226 Difference]: Without dead ends: 582 [2018-10-03 09:03:51,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-03 09:03:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-10-03 09:03:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 543. [2018-10-03 09:03:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-10-03 09:03:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 956 transitions. [2018-10-03 09:03:51,690 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 956 transitions. Word has length 11 [2018-10-03 09:03:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:51,690 INFO L480 AbstractCegarLoop]: Abstraction has 543 states and 956 transitions. [2018-10-03 09:03:51,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:03:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 956 transitions. [2018-10-03 09:03:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 09:03:51,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:51,691 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:51,691 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:51,691 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:51,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1918662095, now seen corresponding path program 1 times [2018-10-03 09:03:51,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:51,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:51,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:51,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:51,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:51,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:51,760 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:51,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:51,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:51,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:51,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-03 09:03:51,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:03:51,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:03:51,827 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:51,827 INFO L87 Difference]: Start difference. First operand 543 states and 956 transitions. Second operand 7 states. [2018-10-03 09:03:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:52,248 INFO L93 Difference]: Finished difference Result 618 states and 1074 transitions. [2018-10-03 09:03:52,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-03 09:03:52,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-03 09:03:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:52,251 INFO L225 Difference]: With dead ends: 618 [2018-10-03 09:03:52,251 INFO L226 Difference]: Without dead ends: 616 [2018-10-03 09:03:52,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-03 09:03:52,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-10-03 09:03:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 529. [2018-10-03 09:03:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-03 09:03:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 929 transitions. [2018-10-03 09:03:52,356 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 929 transitions. Word has length 11 [2018-10-03 09:03:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:52,356 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 929 transitions. [2018-10-03 09:03:52,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:03:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 929 transitions. [2018-10-03 09:03:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-03 09:03:52,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:52,357 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:52,357 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:52,357 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:52,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1878520164, now seen corresponding path program 1 times [2018-10-03 09:03:52,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:52,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:52,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:52,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:52,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:52,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:52,430 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:52,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:52,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:52,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:52,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-03 09:03:52,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-03 09:03:52,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-03 09:03:52,498 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:52,498 INFO L87 Difference]: Start difference. First operand 529 states and 929 transitions. Second operand 7 states. [2018-10-03 09:03:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:52,921 INFO L93 Difference]: Finished difference Result 613 states and 1066 transitions. [2018-10-03 09:03:52,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-03 09:03:52,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-03 09:03:52,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:52,924 INFO L225 Difference]: With dead ends: 613 [2018-10-03 09:03:52,924 INFO L226 Difference]: Without dead ends: 611 [2018-10-03 09:03:52,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 11 [2018-10-03 09:03:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-10-03 09:03:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 523. [2018-10-03 09:03:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-03 09:03:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 914 transitions. [2018-10-03 09:03:53,027 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 914 transitions. Word has length 11 [2018-10-03 09:03:53,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:53,028 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 914 transitions. [2018-10-03 09:03:53,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-03 09:03:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 914 transitions. [2018-10-03 09:03:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 09:03:53,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:53,028 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:53,029 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:53,029 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:53,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1730497723, now seen corresponding path program 1 times [2018-10-03 09:03:53,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:53,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:53,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:53,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:53,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:53,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:53,148 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:53,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:53,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:53,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:53,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2018-10-03 09:03:53,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 09:03:53,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 09:03:53,447 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:53,448 INFO L87 Difference]: Start difference. First operand 523 states and 914 transitions. Second operand 14 states. [2018-10-03 09:03:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:54,807 INFO L93 Difference]: Finished difference Result 875 states and 1523 transitions. [2018-10-03 09:03:54,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-03 09:03:54,815 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 12 [2018-10-03 09:03:54,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:54,819 INFO L225 Difference]: With dead ends: 875 [2018-10-03 09:03:54,819 INFO L226 Difference]: Without dead ends: 873 [2018-10-03 09:03:54,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 28 [2018-10-03 09:03:54,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-10-03 09:03:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 651. [2018-10-03 09:03:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-10-03 09:03:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1146 transitions. [2018-10-03 09:03:54,962 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1146 transitions. Word has length 12 [2018-10-03 09:03:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:54,962 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 1146 transitions. [2018-10-03 09:03:54,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 09:03:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1146 transitions. [2018-10-03 09:03:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-03 09:03:54,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:54,963 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:54,963 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:54,963 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:54,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1895489947, now seen corresponding path program 1 times [2018-10-03 09:03:54,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:54,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:54,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:54,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:54,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:55,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:55,064 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:55,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:55,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:55,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:55,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-10-03 09:03:55,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-03 09:03:55,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-03 09:03:55,163 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:55,163 INFO L87 Difference]: Start difference. First operand 651 states and 1146 transitions. Second operand 13 states. [2018-10-03 09:03:56,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:56,404 INFO L93 Difference]: Finished difference Result 1281 states and 2254 transitions. [2018-10-03 09:03:56,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-03 09:03:56,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-03 09:03:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:56,409 INFO L225 Difference]: With dead ends: 1281 [2018-10-03 09:03:56,409 INFO L226 Difference]: Without dead ends: 1279 [2018-10-03 09:03:56,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 21 [2018-10-03 09:03:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-10-03 09:03:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 923. [2018-10-03 09:03:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-03 09:03:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-10-03 09:03:56,602 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 12 [2018-10-03 09:03:56,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:56,602 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-10-03 09:03:56,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-03 09:03:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-10-03 09:03:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 09:03:56,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:56,603 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:56,603 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:56,603 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:56,603 INFO L82 PathProgramCache]: Analyzing trace with hash -397030605, now seen corresponding path program 1 times [2018-10-03 09:03:56,603 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:56,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:56,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:56,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:56,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:56,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:56,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:56,732 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:56,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:56,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:56,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:56,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-03 09:03:56,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 09:03:56,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 09:03:56,817 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:56,818 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 11 states. [2018-10-03 09:03:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:57,533 INFO L93 Difference]: Finished difference Result 1054 states and 1838 transitions. [2018-10-03 09:03:57,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-03 09:03:57,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-10-03 09:03:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:57,537 INFO L225 Difference]: With dead ends: 1054 [2018-10-03 09:03:57,537 INFO L226 Difference]: Without dead ends: 1052 [2018-10-03 09:03:57,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 12 [2018-10-03 09:03:57,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-10-03 09:03:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 933. [2018-10-03 09:03:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-03 09:03:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1644 transitions. [2018-10-03 09:03:57,736 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1644 transitions. Word has length 14 [2018-10-03 09:03:57,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:57,736 INFO L480 AbstractCegarLoop]: Abstraction has 933 states and 1644 transitions. [2018-10-03 09:03:57,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 09:03:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1644 transitions. [2018-10-03 09:03:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 09:03:57,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:57,737 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:57,738 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:57,738 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1593749093, now seen corresponding path program 2 times [2018-10-03 09:03:57,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:57,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:57,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:57,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:57,823 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:57,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:03:57,837 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:03:57,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:03:57,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:57,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:57,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-10-03 09:03:57,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 09:03:57,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 09:03:57,959 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:57,959 INFO L87 Difference]: Start difference. First operand 933 states and 1644 transitions. Second operand 14 states. [2018-10-03 09:03:59,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:03:59,460 INFO L93 Difference]: Finished difference Result 1125 states and 1938 transitions. [2018-10-03 09:03:59,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-03 09:03:59,460 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-03 09:03:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:03:59,464 INFO L225 Difference]: With dead ends: 1125 [2018-10-03 09:03:59,464 INFO L226 Difference]: Without dead ends: 1123 [2018-10-03 09:03:59,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 29 [2018-10-03 09:03:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-10-03 09:03:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 923. [2018-10-03 09:03:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-10-03 09:03:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1627 transitions. [2018-10-03 09:03:59,651 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1627 transitions. Word has length 14 [2018-10-03 09:03:59,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:03:59,651 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1627 transitions. [2018-10-03 09:03:59,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 09:03:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1627 transitions. [2018-10-03 09:03:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 09:03:59,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:03:59,652 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:03:59,652 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:03:59,653 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:03:59,653 INFO L82 PathProgramCache]: Analyzing trace with hash -213121378, now seen corresponding path program 1 times [2018-10-03 09:03:59,653 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:03:59,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:03:59,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:59,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:03:59,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:03:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:59,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:03:59,726 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:03:59,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:03:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:03:59,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:03:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:03:59,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:03:59,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-10-03 09:03:59,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-03 09:03:59,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-03 09:03:59,878 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:03:59,878 INFO L87 Difference]: Start difference. First operand 923 states and 1627 transitions. Second operand 14 states. [2018-10-03 09:04:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:01,181 INFO L93 Difference]: Finished difference Result 1125 states and 1949 transitions. [2018-10-03 09:04:01,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-03 09:04:01,181 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-03 09:04:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:01,186 INFO L225 Difference]: With dead ends: 1125 [2018-10-03 09:04:01,186 INFO L226 Difference]: Without dead ends: 1123 [2018-10-03 09:04:01,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 22 [2018-10-03 09:04:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-10-03 09:04:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 919. [2018-10-03 09:04:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-10-03 09:04:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1620 transitions. [2018-10-03 09:04:01,388 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1620 transitions. Word has length 14 [2018-10-03 09:04:01,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:01,389 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1620 transitions. [2018-10-03 09:04:01,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-03 09:04:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1620 transitions. [2018-10-03 09:04:01,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 09:04:01,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:01,390 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:04:01,390 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:01,390 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:01,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1838595071, now seen corresponding path program 1 times [2018-10-03 09:04:01,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:01,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:01,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:01,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:01,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:01,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:01,490 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:01,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:01,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:01,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:01,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-10-03 09:04:01,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-03 09:04:01,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-03 09:04:01,579 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:01,579 INFO L87 Difference]: Start difference. First operand 919 states and 1620 transitions. Second operand 12 states. [2018-10-03 09:04:02,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:02,525 INFO L93 Difference]: Finished difference Result 1117 states and 1948 transitions. [2018-10-03 09:04:02,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-03 09:04:02,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-10-03 09:04:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:02,529 INFO L225 Difference]: With dead ends: 1117 [2018-10-03 09:04:02,529 INFO L226 Difference]: Without dead ends: 1115 [2018-10-03 09:04:02,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 12 [2018-10-03 09:04:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2018-10-03 09:04:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 883. [2018-10-03 09:04:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-10-03 09:04:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1560 transitions. [2018-10-03 09:04:02,728 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1560 transitions. Word has length 14 [2018-10-03 09:04:02,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:02,729 INFO L480 AbstractCegarLoop]: Abstraction has 883 states and 1560 transitions. [2018-10-03 09:04:02,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-03 09:04:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1560 transitions. [2018-10-03 09:04:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-03 09:04:02,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:02,730 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:04:02,730 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:02,730 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:02,730 INFO L82 PathProgramCache]: Analyzing trace with hash -47479579, now seen corresponding path program 1 times [2018-10-03 09:04:02,730 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:02,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:02,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:02,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:02,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:02,811 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:02,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:02,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:02,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:02,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-03 09:04:02,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-03 09:04:02,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-03 09:04:02,902 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:02,902 INFO L87 Difference]: Start difference. First operand 883 states and 1560 transitions. Second operand 11 states. [2018-10-03 09:04:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:03,576 INFO L93 Difference]: Finished difference Result 995 states and 1722 transitions. [2018-10-03 09:04:03,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-03 09:04:03,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2018-10-03 09:04:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:03,580 INFO L225 Difference]: With dead ends: 995 [2018-10-03 09:04:03,580 INFO L226 Difference]: Without dead ends: 993 [2018-10-03 09:04:03,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 12 [2018-10-03 09:04:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2018-10-03 09:04:03,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 877. [2018-10-03 09:04:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2018-10-03 09:04:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1548 transitions. [2018-10-03 09:04:03,783 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1548 transitions. Word has length 14 [2018-10-03 09:04:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:03,784 INFO L480 AbstractCegarLoop]: Abstraction has 877 states and 1548 transitions. [2018-10-03 09:04:03,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-03 09:04:03,784 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1548 transitions. [2018-10-03 09:04:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 09:04:03,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:03,785 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-03 09:04:03,785 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:03,785 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:03,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2027388784, now seen corresponding path program 1 times [2018-10-03 09:04:03,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:03,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:03,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:03,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:03,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:04,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:04,616 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) [2018-10-03 09:04:04,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:04,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:04,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:04,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-03 09:04:04,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 09:04:04,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 09:04:04,814 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:04,814 INFO L87 Difference]: Start difference. First operand 877 states and 1548 transitions. Second operand 17 states. [2018-10-03 09:04:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:06,997 INFO L93 Difference]: Finished difference Result 2105 states and 3670 transitions. [2018-10-03 09:04:06,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-03 09:04:06,998 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2018-10-03 09:04:06,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:07,002 INFO L225 Difference]: With dead ends: 2105 [2018-10-03 09:04:07,002 INFO L226 Difference]: Without dead ends: 1229 [2018-10-03 09:04:07,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.1s impTime 29 [2018-10-03 09:04:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2018-10-03 09:04:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1014. [2018-10-03 09:04:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-10-03 09:04:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1752 transitions. [2018-10-03 09:04:07,258 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1752 transitions. Word has length 15 [2018-10-03 09:04:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:07,258 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1752 transitions. [2018-10-03 09:04:07,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 09:04:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1752 transitions. [2018-10-03 09:04:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 09:04:07,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:07,259 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:04:07,259 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:07,260 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:07,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1084233543, now seen corresponding path program 1 times [2018-10-03 09:04:07,260 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:07,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:07,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:07,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:07,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:07,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:07,369 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:07,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:07,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:07,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:07,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-03 09:04:07,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 09:04:07,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 09:04:07,719 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:07,719 INFO L87 Difference]: Start difference. First operand 1014 states and 1752 transitions. Second operand 15 states. [2018-10-03 09:04:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:09,644 INFO L93 Difference]: Finished difference Result 2110 states and 3623 transitions. [2018-10-03 09:04:09,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-03 09:04:09,644 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-03 09:04:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:09,648 INFO L225 Difference]: With dead ends: 2110 [2018-10-03 09:04:09,648 INFO L226 Difference]: Without dead ends: 1097 [2018-10-03 09:04:09,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 29 [2018-10-03 09:04:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-03 09:04:09,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 951. [2018-10-03 09:04:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-10-03 09:04:09,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1643 transitions. [2018-10-03 09:04:09,884 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1643 transitions. Word has length 15 [2018-10-03 09:04:09,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:09,884 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 1643 transitions. [2018-10-03 09:04:09,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 09:04:09,884 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1643 transitions. [2018-10-03 09:04:09,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 09:04:09,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:09,885 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:04:09,885 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:09,885 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash -185533858, now seen corresponding path program 1 times [2018-10-03 09:04:09,886 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:09,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:09,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:09,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:09,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:10,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:10,000 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:10,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:10,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:10,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:10,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-03 09:04:10,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 09:04:10,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 09:04:10,133 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:10,133 INFO L87 Difference]: Start difference. First operand 951 states and 1643 transitions. Second operand 15 states. [2018-10-03 09:04:12,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:12,825 INFO L93 Difference]: Finished difference Result 2832 states and 4780 transitions. [2018-10-03 09:04:12,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-03 09:04:12,825 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-03 09:04:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:12,831 INFO L225 Difference]: With dead ends: 2832 [2018-10-03 09:04:12,832 INFO L226 Difference]: Without dead ends: 1867 [2018-10-03 09:04:12,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 30 [2018-10-03 09:04:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2018-10-03 09:04:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1571. [2018-10-03 09:04:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2018-10-03 09:04:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2660 transitions. [2018-10-03 09:04:13,269 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2660 transitions. Word has length 15 [2018-10-03 09:04:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:13,269 INFO L480 AbstractCegarLoop]: Abstraction has 1571 states and 2660 transitions. [2018-10-03 09:04:13,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 09:04:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2660 transitions. [2018-10-03 09:04:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 09:04:13,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:13,270 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:04:13,270 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:13,270 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:13,271 INFO L82 PathProgramCache]: Analyzing trace with hash -497943192, now seen corresponding path program 1 times [2018-10-03 09:04:13,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:13,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:13,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:13,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:13,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:13,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:13,357 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:13,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:13,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-03 09:04:13,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:13,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-03 09:04:13,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 09:04:13,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 09:04:13,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:13,467 INFO L87 Difference]: Start difference. First operand 1571 states and 2660 transitions. Second operand 15 states. [2018-10-03 09:04:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:17,212 INFO L93 Difference]: Finished difference Result 4461 states and 7467 transitions. [2018-10-03 09:04:17,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-03 09:04:17,213 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-03 09:04:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:17,241 INFO L225 Difference]: With dead ends: 4461 [2018-10-03 09:04:17,241 INFO L226 Difference]: Without dead ends: 2887 [2018-10-03 09:04:17,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 23 [2018-10-03 09:04:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-10-03 09:04:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2284. [2018-10-03 09:04:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2018-10-03 09:04:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3759 transitions. [2018-10-03 09:04:18,375 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3759 transitions. Word has length 15 [2018-10-03 09:04:18,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:18,375 INFO L480 AbstractCegarLoop]: Abstraction has 2284 states and 3759 transitions. [2018-10-03 09:04:18,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 09:04:18,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3759 transitions. [2018-10-03 09:04:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 09:04:18,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:18,377 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-03 09:04:18,381 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:18,381 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:18,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1957708543, now seen corresponding path program 1 times [2018-10-03 09:04:18,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:18,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:18,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:18,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:18,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:19,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:19,215 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:19,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:19,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 09:04:19,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:19,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-10-03 09:04:19,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-03 09:04:19,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-03 09:04:19,423 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:19,423 INFO L87 Difference]: Start difference. First operand 2284 states and 3759 transitions. Second operand 16 states. [2018-10-03 09:04:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:23,538 INFO L93 Difference]: Finished difference Result 3903 states and 6372 transitions. [2018-10-03 09:04:23,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-03 09:04:23,538 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-03 09:04:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:23,545 INFO L225 Difference]: With dead ends: 3903 [2018-10-03 09:04:23,546 INFO L226 Difference]: Without dead ends: 3227 [2018-10-03 09:04:23,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time 2.3s impTime 37 [2018-10-03 09:04:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2018-10-03 09:04:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2428. [2018-10-03 09:04:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-10-03 09:04:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4065 transitions. [2018-10-03 09:04:24,265 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4065 transitions. Word has length 15 [2018-10-03 09:04:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:24,265 INFO L480 AbstractCegarLoop]: Abstraction has 2428 states and 4065 transitions. [2018-10-03 09:04:24,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-03 09:04:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4065 transitions. [2018-10-03 09:04:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 09:04:24,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:24,267 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:04:24,267 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:24,267 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:24,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1386290021, now seen corresponding path program 1 times [2018-10-03 09:04:24,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:24,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:24,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:24,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:24,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:25,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:25,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:25,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:25,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:25,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:25,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-03 09:04:25,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 09:04:25,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 09:04:25,365 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:25,365 INFO L87 Difference]: Start difference. First operand 2428 states and 4065 transitions. Second operand 15 states. [2018-10-03 09:04:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:27,832 INFO L93 Difference]: Finished difference Result 5427 states and 9046 transitions. [2018-10-03 09:04:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-03 09:04:27,833 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-03 09:04:27,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:27,841 INFO L225 Difference]: With dead ends: 5427 [2018-10-03 09:04:27,841 INFO L226 Difference]: Without dead ends: 2851 [2018-10-03 09:04:27,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.3s impTime 25 [2018-10-03 09:04:27,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2018-10-03 09:04:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2500. [2018-10-03 09:04:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2018-10-03 09:04:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 4177 transitions. [2018-10-03 09:04:28,550 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 4177 transitions. Word has length 15 [2018-10-03 09:04:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:28,550 INFO L480 AbstractCegarLoop]: Abstraction has 2500 states and 4177 transitions. [2018-10-03 09:04:28,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 09:04:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 4177 transitions. [2018-10-03 09:04:28,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 09:04:28,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:28,551 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-03 09:04:28,552 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:28,552 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:28,552 INFO L82 PathProgramCache]: Analyzing trace with hash -38293542, now seen corresponding path program 1 times [2018-10-03 09:04:28,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:28,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:28,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:28,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:28,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:28,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:28,649 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:28,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:28,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 09:04:28,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:28,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-03 09:04:28,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-03 09:04:28,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-03 09:04:28,742 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:28,742 INFO L87 Difference]: Start difference. First operand 2500 states and 4177 transitions. Second operand 15 states. [2018-10-03 09:04:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:31,499 INFO L93 Difference]: Finished difference Result 5837 states and 9708 transitions. [2018-10-03 09:04:31,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-03 09:04:31,500 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-03 09:04:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:31,506 INFO L225 Difference]: With dead ends: 5837 [2018-10-03 09:04:31,506 INFO L226 Difference]: Without dead ends: 3072 [2018-10-03 09:04:31,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.7s impTime 28 [2018-10-03 09:04:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2018-10-03 09:04:32,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2605. [2018-10-03 09:04:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2018-10-03 09:04:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4349 transitions. [2018-10-03 09:04:32,279 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4349 transitions. Word has length 15 [2018-10-03 09:04:32,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:32,279 INFO L480 AbstractCegarLoop]: Abstraction has 2605 states and 4349 transitions. [2018-10-03 09:04:32,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-03 09:04:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4349 transitions. [2018-10-03 09:04:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:04:32,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:32,281 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-03 09:04:32,281 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:32,281 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:32,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1793898800, now seen corresponding path program 1 times [2018-10-03 09:04:32,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:32,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:32,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:32,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:32,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-03 09:04:32,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:32,391 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:32,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:32,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:32,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:32,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-03 09:04:32,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-03 09:04:32,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-03 09:04:32,597 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:32,597 INFO L87 Difference]: Start difference. First operand 2605 states and 4349 transitions. Second operand 20 states. [2018-10-03 09:04:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:38,211 INFO L93 Difference]: Finished difference Result 5120 states and 8519 transitions. [2018-10-03 09:04:38,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-03 09:04:38,211 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-10-03 09:04:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:38,218 INFO L225 Difference]: With dead ends: 5120 [2018-10-03 09:04:38,218 INFO L226 Difference]: Without dead ends: 3342 [2018-10-03 09:04:38,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 2.1s impTime 59 [2018-10-03 09:04:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2018-10-03 09:04:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 2886. [2018-10-03 09:04:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2886 states. [2018-10-03 09:04:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 4822 transitions. [2018-10-03 09:04:39,072 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 4822 transitions. Word has length 18 [2018-10-03 09:04:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:39,072 INFO L480 AbstractCegarLoop]: Abstraction has 2886 states and 4822 transitions. [2018-10-03 09:04:39,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-03 09:04:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 4822 transitions. [2018-10-03 09:04:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:04:39,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:39,073 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:04:39,073 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:39,074 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:39,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1793897518, now seen corresponding path program 1 times [2018-10-03 09:04:39,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:39,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:39,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:39,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:39,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:39,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:39,251 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:39,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:39,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-03 09:04:39,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:39,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-03 09:04:39,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 09:04:39,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 09:04:39,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:39,392 INFO L87 Difference]: Start difference. First operand 2886 states and 4822 transitions. Second operand 18 states. [2018-10-03 09:04:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:42,886 INFO L93 Difference]: Finished difference Result 3487 states and 5852 transitions. [2018-10-03 09:04:42,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-03 09:04:42,887 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-03 09:04:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:42,893 INFO L225 Difference]: With dead ends: 3487 [2018-10-03 09:04:42,893 INFO L226 Difference]: Without dead ends: 3485 [2018-10-03 09:04:42,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 38 [2018-10-03 09:04:42,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2018-10-03 09:04:43,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 2999. [2018-10-03 09:04:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2018-10-03 09:04:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5026 transitions. [2018-10-03 09:04:43,878 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5026 transitions. Word has length 18 [2018-10-03 09:04:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:43,878 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 5026 transitions. [2018-10-03 09:04:43,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 09:04:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5026 transitions. [2018-10-03 09:04:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:04:43,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:43,880 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-03 09:04:43,880 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:43,880 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:43,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1785310631, now seen corresponding path program 1 times [2018-10-03 09:04:43,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:43,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:43,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:43,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:43,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:43,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:43,983 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:43,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:43,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-03 09:04:44,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:44,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-03 09:04:44,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 09:04:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 09:04:44,168 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:44,168 INFO L87 Difference]: Start difference. First operand 2999 states and 5026 transitions. Second operand 18 states. [2018-10-03 09:04:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:48,081 INFO L93 Difference]: Finished difference Result 3557 states and 5973 transitions. [2018-10-03 09:04:48,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-03 09:04:48,081 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-03 09:04:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:48,085 INFO L225 Difference]: With dead ends: 3557 [2018-10-03 09:04:48,085 INFO L226 Difference]: Without dead ends: 3555 [2018-10-03 09:04:48,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 59 [2018-10-03 09:04:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3555 states. [2018-10-03 09:04:49,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3555 to 3102. [2018-10-03 09:04:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2018-10-03 09:04:49,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 5194 transitions. [2018-10-03 09:04:49,009 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 5194 transitions. Word has length 18 [2018-10-03 09:04:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:49,009 INFO L480 AbstractCegarLoop]: Abstraction has 3102 states and 5194 transitions. [2018-10-03 09:04:49,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 09:04:49,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 5194 transitions. [2018-10-03 09:04:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:04:49,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:49,011 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:04:49,011 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:49,011 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:49,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1256757274, now seen corresponding path program 2 times [2018-10-03 09:04:49,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:49,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:49,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:04:49,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:49,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:49,419 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:49,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:04:49,434 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:04:49,434 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:04:49,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:49,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:49,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-03 09:04:49,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 09:04:49,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 09:04:49,597 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:49,597 INFO L87 Difference]: Start difference. First operand 3102 states and 5194 transitions. Second operand 18 states. [2018-10-03 09:04:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:04:56,905 INFO L93 Difference]: Finished difference Result 5268 states and 8851 transitions. [2018-10-03 09:04:56,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-03 09:04:56,905 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-03 09:04:56,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:04:56,910 INFO L225 Difference]: With dead ends: 5268 [2018-10-03 09:04:56,910 INFO L226 Difference]: Without dead ends: 5266 [2018-10-03 09:04:56,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time 2.7s impTime 95 [2018-10-03 09:04:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2018-10-03 09:04:57,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 3515. [2018-10-03 09:04:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2018-10-03 09:04:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5926 transitions. [2018-10-03 09:04:57,850 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5926 transitions. Word has length 18 [2018-10-03 09:04:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:04:57,850 INFO L480 AbstractCegarLoop]: Abstraction has 3515 states and 5926 transitions. [2018-10-03 09:04:57,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 09:04:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5926 transitions. [2018-10-03 09:04:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:04:57,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:04:57,851 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-03 09:04:57,852 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:04:57,852 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:04:57,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1248170387, now seen corresponding path program 2 times [2018-10-03 09:04:57,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:04:57,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:04:57,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:57,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:04:57,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:04:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:04:58,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:58,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:04:58,072 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:04:58,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:04:58,088 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:04:58,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:04:58,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:04:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:04:58,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:04:58,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-10-03 09:04:58,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 09:04:58,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 09:04:58,224 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:04:58,224 INFO L87 Difference]: Start difference. First operand 3515 states and 5926 transitions. Second operand 18 states. [2018-10-03 09:05:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:05:04,606 INFO L93 Difference]: Finished difference Result 4859 states and 8135 transitions. [2018-10-03 09:05:04,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-03 09:05:04,607 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-03 09:05:04,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:05:04,611 INFO L225 Difference]: With dead ends: 4859 [2018-10-03 09:05:04,611 INFO L226 Difference]: Without dead ends: 4857 [2018-10-03 09:05:04,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 2.1s impTime 84 [2018-10-03 09:05:04,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2018-10-03 09:05:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 3405. [2018-10-03 09:05:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3405 states. [2018-10-03 09:05:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 5721 transitions. [2018-10-03 09:05:05,513 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 5721 transitions. Word has length 18 [2018-10-03 09:05:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:05:05,513 INFO L480 AbstractCegarLoop]: Abstraction has 3405 states and 5721 transitions. [2018-10-03 09:05:05,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 09:05:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 5721 transitions. [2018-10-03 09:05:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:05:05,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:05:05,514 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-03 09:05:05,515 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:05:05,515 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:05:05,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1231339551, now seen corresponding path program 2 times [2018-10-03 09:05:05,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:05:05,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:05:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:05:05,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:05:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:05:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:05:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:05:05,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:05:05,712 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:05:05,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:05:05,728 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:05:05,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:05:05,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:05:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-03 09:05:05,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:05:05,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-10-03 09:05:05,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-03 09:05:05,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-03 09:05:05,823 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:05:05,823 INFO L87 Difference]: Start difference. First operand 3405 states and 5721 transitions. Second operand 16 states. [2018-10-03 09:05:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:05:08,424 INFO L93 Difference]: Finished difference Result 5774 states and 9598 transitions. [2018-10-03 09:05:08,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-03 09:05:08,425 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-03 09:05:08,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:05:08,429 INFO L225 Difference]: With dead ends: 5774 [2018-10-03 09:05:08,429 INFO L226 Difference]: Without dead ends: 3100 [2018-10-03 09:05:08,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 26 [2018-10-03 09:05:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-10-03 09:05:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2583. [2018-10-03 09:05:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2583 states. [2018-10-03 09:05:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 4270 transitions. [2018-10-03 09:05:09,194 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 4270 transitions. Word has length 18 [2018-10-03 09:05:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:05:09,195 INFO L480 AbstractCegarLoop]: Abstraction has 2583 states and 4270 transitions. [2018-10-03 09:05:09,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-03 09:05:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 4270 transitions. [2018-10-03 09:05:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:05:09,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:05:09,196 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:05:09,196 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:05:09,196 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:05:09,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1890837259, now seen corresponding path program 1 times [2018-10-03 09:05:09,196 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:05:09,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:05:09,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:05:09,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:05:09,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:05:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:05:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:05:09,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:05:09,318 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:05:09,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:05:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:05:09,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:05:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-03 09:05:09,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:05:09,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2018-10-03 09:05:09,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 09:05:09,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 09:05:09,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:05:09,467 INFO L87 Difference]: Start difference. First operand 2583 states and 4270 transitions. Second operand 18 states. [2018-10-03 09:05:12,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:05:12,315 INFO L93 Difference]: Finished difference Result 3114 states and 5123 transitions. [2018-10-03 09:05:12,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-03 09:05:12,316 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-03 09:05:12,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:05:12,318 INFO L225 Difference]: With dead ends: 3114 [2018-10-03 09:05:12,318 INFO L226 Difference]: Without dead ends: 3112 [2018-10-03 09:05:12,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 32 [2018-10-03 09:05:12,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2018-10-03 09:05:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2773. [2018-10-03 09:05:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2773 states. [2018-10-03 09:05:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4589 transitions. [2018-10-03 09:05:13,142 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4589 transitions. Word has length 18 [2018-10-03 09:05:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:05:13,142 INFO L480 AbstractCegarLoop]: Abstraction has 2773 states and 4589 transitions. [2018-10-03 09:05:13,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 09:05:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4589 transitions. [2018-10-03 09:05:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:05:13,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:05:13,143 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-03 09:05:13,144 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:05:13,144 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:05:13,144 INFO L82 PathProgramCache]: Analyzing trace with hash 740718717, now seen corresponding path program 2 times [2018-10-03 09:05:13,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:05:13,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:05:13,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:05:13,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:05:13,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:05:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:05:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:05:13,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:05:13,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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:05:13,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-03 09:05:13,264 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-03 09:05:13,264 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:05:13,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:05:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:05:13,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:05:13,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-10-03 09:05:13,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-03 09:05:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-03 09:05:13,421 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:05:13,422 INFO L87 Difference]: Start difference. First operand 2773 states and 4589 transitions. Second operand 17 states. [2018-10-03 09:05:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:05:19,709 INFO L93 Difference]: Finished difference Result 4419 states and 7414 transitions. [2018-10-03 09:05:19,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-03 09:05:19,709 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-03 09:05:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:05:19,713 INFO L225 Difference]: With dead ends: 4419 [2018-10-03 09:05:19,713 INFO L226 Difference]: Without dead ends: 4417 [2018-10-03 09:05:19,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.3s impTime 65 [2018-10-03 09:05:19,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4417 states. [2018-10-03 09:05:20,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4417 to 3073. [2018-10-03 09:05:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2018-10-03 09:05:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 5108 transitions. [2018-10-03 09:05:20,674 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 5108 transitions. Word has length 18 [2018-10-03 09:05:20,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:05:20,674 INFO L480 AbstractCegarLoop]: Abstraction has 3073 states and 5108 transitions. [2018-10-03 09:05:20,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-03 09:05:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 5108 transitions. [2018-10-03 09:05:20,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:05:20,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:05:20,675 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:05:20,676 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:05:20,676 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:05:20,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1434281659, now seen corresponding path program 1 times [2018-10-03 09:05:20,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:05:20,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:05:20,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:05:20,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-03 09:05:20,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:05:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:05:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:05:20,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:05:20,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:05:20,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:05:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:05:20,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:05:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:05:21,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:05:21,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-03 09:05:21,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-03 09:05:21,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-03 09:05:21,704 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:05:21,705 INFO L87 Difference]: Start difference. First operand 3073 states and 5108 transitions. Second operand 18 states. [2018-10-03 09:05:26,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:05:26,850 INFO L93 Difference]: Finished difference Result 4437 states and 7426 transitions. [2018-10-03 09:05:26,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-03 09:05:26,850 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-03 09:05:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:05:26,853 INFO L225 Difference]: With dead ends: 4437 [2018-10-03 09:05:26,854 INFO L226 Difference]: Without dead ends: 4435 [2018-10-03 09:05:26,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.4s impTime 59 [2018-10-03 09:05:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4435 states. [2018-10-03 09:05:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4435 to 2723. [2018-10-03 09:05:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2018-10-03 09:05:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4478 transitions. [2018-10-03 09:05:27,687 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4478 transitions. Word has length 18 [2018-10-03 09:05:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:05:27,687 INFO L480 AbstractCegarLoop]: Abstraction has 2723 states and 4478 transitions. [2018-10-03 09:05:27,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-03 09:05:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4478 transitions. [2018-10-03 09:05:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:05:27,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:05:27,688 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:05:27,688 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:05:27,688 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:05:27,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1483012849, now seen corresponding path program 1 times [2018-10-03 09:05:27,688 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:05:27,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:05:27,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:05:27,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:05:27,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:05:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:05:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:05:27,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:05:27,802 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:05:27,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:05:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:05:27,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:05:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:05:27,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:05:27,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-10-03 09:05:27,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-03 09:05:27,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-03 09:05:27,985 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:05:27,986 INFO L87 Difference]: Start difference. First operand 2723 states and 4478 transitions. Second operand 19 states. [2018-10-03 09:05:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:05:32,722 INFO L93 Difference]: Finished difference Result 4290 states and 7151 transitions. [2018-10-03 09:05:32,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-03 09:05:32,723 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-10-03 09:05:32,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:05:32,726 INFO L225 Difference]: With dead ends: 4290 [2018-10-03 09:05:32,726 INFO L226 Difference]: Without dead ends: 4288 [2018-10-03 09:05:32,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.2s impTime 64 [2018-10-03 09:05:32,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2018-10-03 09:05:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3364. [2018-10-03 09:05:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2018-10-03 09:05:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 5610 transitions. [2018-10-03 09:05:33,926 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 5610 transitions. Word has length 18 [2018-10-03 09:05:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:05:33,927 INFO L480 AbstractCegarLoop]: Abstraction has 3364 states and 5610 transitions. [2018-10-03 09:05:33,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-03 09:05:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 5610 transitions. [2018-10-03 09:05:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-03 09:05:33,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:05:33,928 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-03 09:05:33,928 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:05:33,928 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:05:33,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1851213523, now seen corresponding path program 3 times [2018-10-03 09:05:33,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:05:33,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:05:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:05:33,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:05:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:05:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:05:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-03 09:05:34,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:05:34,019 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 09:05:34,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-03 09:05:34,036 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-03 09:05:34,036 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-03 09:05:34,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:05:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-03 09:05:34,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:05:34,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-10-03 09:05:34,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-03 09:05:34,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-03 09:05:34,445 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:05:34,445 INFO L87 Difference]: Start difference. First operand 3364 states and 5610 transitions. Second operand 19 states. [2018-10-03 09:05:35,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-03 09:05:35,745 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Cannot handle case were solver cannot decide implication of predicates at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.ImplicationMap.internImplication(ImplicationMap.java:182) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.ImplicationMap.unifyPredicate(ImplicationMap.java:108) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:216) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:286) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateForConjunction(BPredicateUnifier.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-03 09:05:35,749 INFO L168 Benchmark]: Toolchain (without parser) took 132659.37 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -133.5 MB). Peak memory consumption was 942.9 MB. Max. memory is 7.1 GB. [2018-10-03 09:05:35,750 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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-03 09:05:35,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.56 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-03 09:05:35,751 INFO L168 Benchmark]: Boogie Preprocessor took 21.62 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-03 09:05:35,752 INFO L168 Benchmark]: RCFGBuilder took 579.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-03 09:05:35,753 INFO L168 Benchmark]: TraceAbstraction took 132007.89 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -154.6 MB). Peak memory consumption was 921.8 MB. Max. memory is 7.1 GB. [2018-10-03 09:05:35,756 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.24 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 40.56 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 21.62 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 579.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 132007.89 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -154.6 MB). Peak memory consumption was 921.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Cannot handle case were solver cannot decide implication of predicates de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Cannot handle case were solver cannot decide implication of predicates: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.ImplicationMap.internImplication(ImplicationMap.java:182) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithoutIf.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_09-05-35-770.csv Received shutdown request...