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.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:42:05,619 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:42:05,621 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:42:05,633 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:42:05,633 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:42:05,634 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:42:05,636 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:42:05,638 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:42:05,640 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:42:05,640 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:42:05,642 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:42:05,642 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:42:05,643 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:42:05,645 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:42:05,646 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:42:05,647 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:42:05,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:42:05,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:42:05,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:42:05,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:42:05,656 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:42:05,657 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:42:05,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:42:05,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:42:05,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:42:05,665 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:42:05,666 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:42:05,666 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:42:05,672 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:42:05,673 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:42:05,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:42:05,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:42:05,674 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:42:05,678 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:42:05,679 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:42:05,680 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:42:05,680 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-04 12:42:05,699 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:42:05,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:42:05,700 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:42:05,700 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:42:05,701 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:42:05,701 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:42:05,701 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:42:05,701 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:42:05,702 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:42:05,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:42:05,702 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:42:05,702 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:42:05,702 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:42:05,702 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:42:05,703 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:42:05,703 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:42:05,703 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:42:05,703 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:42:05,703 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:42:05,704 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:42:05,704 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:42:05,704 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:42:05,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:42:05,704 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:42:05,705 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:42:05,705 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:42:05,705 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:42:05,705 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:42:05,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:42:05,705 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:42:05,706 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:42:05,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:42:05,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:42:05,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:42:05,771 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:42:05,772 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:42:05,772 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl [2018-10-04 12:42:05,773 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-10-04 12:42:05,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:42:05,826 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:42:05,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:42:05,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:42:05,827 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:42:05,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:05" (1/1) ... [2018-10-04 12:42:05,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:05" (1/1) ... [2018-10-04 12:42:05,866 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:42:05,866 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:42:05,866 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:42:05,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:42:05,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:42:05,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:42:05,870 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:42:05,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:05" (1/1) ... [2018-10-04 12:42:05,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:05" (1/1) ... [2018-10-04 12:42:05,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:05" (1/1) ... [2018-10-04 12:42:05,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:05" (1/1) ... [2018-10-04 12:42:05,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:05" (1/1) ... [2018-10-04 12:42:05,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:05" (1/1) ... [2018-10-04 12:42:05,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:05" (1/1) ... [2018-10-04 12:42:05,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:42:05,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:42:05,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:42:05,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:42:05,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:05" (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-04 12:42:05,961 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-04 12:42:05,961 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-04 12:42:05,961 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-04 12:42:06,450 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:42:06,450 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:42:06 BoogieIcfgContainer [2018-10-04 12:42:06,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:42:06,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:42:06,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:42:06,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:42:06,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:42:05" (1/2) ... [2018-10-04 12:42:06,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199c9cdd and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:42:06, skipping insertion in model container [2018-10-04 12:42:06,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:42:06" (2/2) ... [2018-10-04 12:42:06,459 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-10-04 12:42:06,469 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:42:06,478 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-04 12:42:06,539 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:42:06,540 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:42:06,541 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:42:06,541 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:42:06,541 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:42:06,541 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:42:06,541 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:42:06,542 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:42:06,542 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:42:06,563 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-04 12:42:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:42:06,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:06,579 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:42:06,582 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:06,590 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:06,590 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-10-04 12:42:06,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:06,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:06,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:06,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:07,009 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-04 12:42:07,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:07,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:07,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:42:07,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:42:07,033 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:07,035 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-10-04 12:42:07,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:07,681 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-10-04 12:42:07,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:42:07,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:42:07,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:07,702 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:42:07,702 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:42:07,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 4 [2018-10-04 12:42:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:42:07,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-04 12:42:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:42:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-10-04 12:42:07,750 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-10-04 12:42:07,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:07,750 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-10-04 12:42:07,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:42:07,751 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-10-04 12:42:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:42:07,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:07,752 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:42:07,753 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:07,754 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:07,754 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-10-04 12:42:07,754 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:07,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:07,813 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-04 12:42:07,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:07,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:42:07,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:42:07,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:42:07,816 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:07,816 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-10-04 12:42:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:08,140 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-10-04 12:42:08,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:42:08,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:42:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:08,144 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:42:08,144 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:42:08,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 12:42:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:42:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-10-04 12:42:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 12:42:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-10-04 12:42:08,155 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-10-04 12:42:08,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:08,155 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-10-04 12:42:08,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:42:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-10-04 12:42:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:42:08,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:08,157 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:08,157 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:08,157 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:08,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-10-04 12:42:08,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:08,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:08,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:08,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:08,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:08,320 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-04 12:42:08,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:08,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:42:08,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:42:08,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:42:08,322 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:08,322 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-10-04 12:42:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:09,756 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-10-04 12:42:09,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:42:09,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-04 12:42:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:09,759 INFO L225 Difference]: With dead ends: 84 [2018-10-04 12:42:09,759 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 12:42:09,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 8 [2018-10-04 12:42:09,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 12:42:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-10-04 12:42:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-04 12:42:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-10-04 12:42:09,774 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-10-04 12:42:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:09,774 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-10-04 12:42:09,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:42:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-10-04 12:42:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:42:09,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:09,776 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 12:42:09,776 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:09,776 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:09,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-10-04 12:42:09,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:09,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:09,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:09,886 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-04 12:42:09,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:09,887 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-04 12:42:09,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:09,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:10,107 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-04 12:42:10,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:42:10,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-04 12:42:10,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:42:10,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:42:10,129 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:10,130 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 9 states. [2018-10-04 12:42:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:10,988 INFO L93 Difference]: Finished difference Result 142 states and 245 transitions. [2018-10-04 12:42:10,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:42:10,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2018-10-04 12:42:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:10,992 INFO L225 Difference]: With dead ends: 142 [2018-10-04 12:42:10,992 INFO L226 Difference]: Without dead ends: 108 [2018-10-04 12:42:10,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 15 [2018-10-04 12:42:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-04 12:42:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 73. [2018-10-04 12:42:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 12:42:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2018-10-04 12:42:11,010 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 7 [2018-10-04 12:42:11,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:11,011 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 120 transitions. [2018-10-04 12:42:11,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:42:11,011 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 120 transitions. [2018-10-04 12:42:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:42:11,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:11,012 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:11,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:11,013 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-10-04 12:42:11,013 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:11,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:11,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:11,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:11,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:11,128 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-04 12:42:11,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:11,129 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-04 12:42:11,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:11,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:11,197 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-04 12:42:11,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:42:11,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2018-10-04 12:42:11,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:42:11,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:42:11,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:11,220 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. Second operand 11 states. [2018-10-04 12:42:12,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:12,373 INFO L93 Difference]: Finished difference Result 148 states and 240 transitions. [2018-10-04 12:42:12,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:42:12,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-10-04 12:42:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:12,374 INFO L225 Difference]: With dead ends: 148 [2018-10-04 12:42:12,375 INFO L226 Difference]: Without dead ends: 97 [2018-10-04 12:42:12,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 17 [2018-10-04 12:42:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-04 12:42:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-10-04 12:42:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-04 12:42:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2018-10-04 12:42:12,392 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 9 [2018-10-04 12:42:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:12,392 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2018-10-04 12:42:12,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:42:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2018-10-04 12:42:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:42:12,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:12,394 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:12,394 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:12,394 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:12,394 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-10-04 12:42:12,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:12,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:12,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:12,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:12,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:12,529 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-04 12:42:12,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:12,530 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:42:12,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:12,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:12,626 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-04 12:42:12,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:12,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:42:12,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:42:12,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:42:12,647 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:12,648 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand 14 states. [2018-10-04 12:42:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:13,573 INFO L93 Difference]: Finished difference Result 124 states and 193 transitions. [2018-10-04 12:42:13,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:42:13,574 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 12:42:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:13,575 INFO L225 Difference]: With dead ends: 124 [2018-10-04 12:42:13,575 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 12:42:13,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 14 [2018-10-04 12:42:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 12:42:13,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-10-04 12:42:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 12:42:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 173 transitions. [2018-10-04 12:42:13,597 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 173 transitions. Word has length 10 [2018-10-04 12:42:13,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:13,597 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 173 transitions. [2018-10-04 12:42:13,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:42:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 173 transitions. [2018-10-04 12:42:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:42:13,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:13,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:13,599 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:13,600 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:13,600 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-10-04 12:42:13,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:13,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:13,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:13,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:13,712 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-04 12:42:13,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:13,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:13,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:13,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:13,714 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:13,714 INFO L87 Difference]: Start difference. First operand 107 states and 173 transitions. Second operand 8 states. [2018-10-04 12:42:14,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:14,332 INFO L93 Difference]: Finished difference Result 132 states and 203 transitions. [2018-10-04 12:42:14,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:42:14,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-04 12:42:14,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:14,334 INFO L225 Difference]: With dead ends: 132 [2018-10-04 12:42:14,337 INFO L226 Difference]: Without dead ends: 130 [2018-10-04 12:42:14,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 13 [2018-10-04 12:42:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-04 12:42:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2018-10-04 12:42:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-04 12:42:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 196 transitions. [2018-10-04 12:42:14,366 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 196 transitions. Word has length 10 [2018-10-04 12:42:14,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:14,366 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 196 transitions. [2018-10-04 12:42:14,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 196 transitions. [2018-10-04 12:42:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:42:14,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:14,368 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:14,368 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:14,368 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:14,369 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-10-04 12:42:14,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:14,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:14,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:14,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:14,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:14,470 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-04 12:42:14,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:14,470 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-04 12:42:14,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:14,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:15,209 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-04 12:42:15,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:15,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 12:42:15,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:42:15,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:42:15,246 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:15,246 INFO L87 Difference]: Start difference. First operand 121 states and 196 transitions. Second operand 14 states. [2018-10-04 12:42:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:17,920 INFO L93 Difference]: Finished difference Result 162 states and 262 transitions. [2018-10-04 12:42:17,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:42:17,921 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 12:42:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:17,922 INFO L225 Difference]: With dead ends: 162 [2018-10-04 12:42:17,922 INFO L226 Difference]: Without dead ends: 160 [2018-10-04 12:42:17,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 16 [2018-10-04 12:42:17,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-04 12:42:17,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2018-10-04 12:42:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-04 12:42:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 209 transitions. [2018-10-04 12:42:17,946 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 209 transitions. Word has length 10 [2018-10-04 12:42:17,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:17,946 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 209 transitions. [2018-10-04 12:42:17,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:42:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 209 transitions. [2018-10-04 12:42:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:42:17,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:17,947 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:17,948 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:17,948 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:17,948 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-10-04 12:42:17,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:17,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:17,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:17,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:17,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:18,019 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-04 12:42:18,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:18,020 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-04 12:42:18,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:18,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:18,198 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-04 12:42:18,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:18,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-04 12:42:18,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:42:18,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:42:18,222 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:18,222 INFO L87 Difference]: Start difference. First operand 129 states and 209 transitions. Second operand 13 states. [2018-10-04 12:42:18,699 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 8 [2018-10-04 12:42:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:20,567 INFO L93 Difference]: Finished difference Result 223 states and 343 transitions. [2018-10-04 12:42:20,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:42:20,569 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-10-04 12:42:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:20,571 INFO L225 Difference]: With dead ends: 223 [2018-10-04 12:42:20,571 INFO L226 Difference]: Without dead ends: 221 [2018-10-04 12:42:20,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 20 [2018-10-04 12:42:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-04 12:42:20,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 167. [2018-10-04 12:42:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-04 12:42:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 274 transitions. [2018-10-04 12:42:20,602 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 274 transitions. Word has length 10 [2018-10-04 12:42:20,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:20,603 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 274 transitions. [2018-10-04 12:42:20,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:42:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 274 transitions. [2018-10-04 12:42:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:42:20,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:20,604 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:20,604 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:20,605 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:20,605 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-10-04 12:42:20,605 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:20,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:20,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:20,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:20,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:20,690 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-04 12:42:20,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:20,694 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-04 12:42:20,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:20,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:20,875 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-04 12:42:20,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:20,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:42:20,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:42:20,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:42:20,900 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:20,900 INFO L87 Difference]: Start difference. First operand 167 states and 274 transitions. Second operand 14 states. [2018-10-04 12:42:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:21,828 INFO L93 Difference]: Finished difference Result 222 states and 351 transitions. [2018-10-04 12:42:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:42:21,829 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 12:42:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:21,831 INFO L225 Difference]: With dead ends: 222 [2018-10-04 12:42:21,831 INFO L226 Difference]: Without dead ends: 221 [2018-10-04 12:42:21,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 12 [2018-10-04 12:42:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-04 12:42:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 181. [2018-10-04 12:42:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-04 12:42:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 297 transitions. [2018-10-04 12:42:21,858 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 297 transitions. Word has length 10 [2018-10-04 12:42:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:21,859 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 297 transitions. [2018-10-04 12:42:21,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:42:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 297 transitions. [2018-10-04 12:42:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:42:21,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:21,860 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:21,860 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:21,860 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:21,860 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-10-04 12:42:21,861 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:21,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:21,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:21,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:21,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:21,961 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-04 12:42:21,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:21,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:21,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:21,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:21,963 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:21,963 INFO L87 Difference]: Start difference. First operand 181 states and 297 transitions. Second operand 8 states. [2018-10-04 12:42:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:22,311 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2018-10-04 12:42:22,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:42:22,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-04 12:42:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:22,314 INFO L225 Difference]: With dead ends: 203 [2018-10-04 12:42:22,314 INFO L226 Difference]: Without dead ends: 201 [2018-10-04 12:42:22,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 11 [2018-10-04 12:42:22,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-04 12:42:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2018-10-04 12:42:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-04 12:42:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 301 transitions. [2018-10-04 12:42:22,342 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 301 transitions. Word has length 10 [2018-10-04 12:42:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:22,343 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 301 transitions. [2018-10-04 12:42:22,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 301 transitions. [2018-10-04 12:42:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:42:22,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:22,344 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:22,344 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:22,344 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:22,344 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-10-04 12:42:22,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:22,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:22,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:22,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:22,417 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-04 12:42:22,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:22,418 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-04 12:42:22,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:22,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:22,527 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-04 12:42:22,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:22,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:42:22,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:42:22,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:42:22,550 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:22,550 INFO L87 Difference]: Start difference. First operand 183 states and 301 transitions. Second operand 14 states. [2018-10-04 12:42:23,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:23,143 INFO L93 Difference]: Finished difference Result 241 states and 385 transitions. [2018-10-04 12:42:23,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:42:23,151 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 12:42:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:23,153 INFO L225 Difference]: With dead ends: 241 [2018-10-04 12:42:23,153 INFO L226 Difference]: Without dead ends: 240 [2018-10-04 12:42:23,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 13 [2018-10-04 12:42:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-04 12:42:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2018-10-04 12:42:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 12:42:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 336 transitions. [2018-10-04 12:42:23,194 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 336 transitions. Word has length 10 [2018-10-04 12:42:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:23,195 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 336 transitions. [2018-10-04 12:42:23,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:42:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 336 transitions. [2018-10-04 12:42:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:42:23,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:23,196 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:23,196 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:23,196 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-10-04 12:42:23,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:23,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:23,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:23,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:23,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:23,325 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-04 12:42:23,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:23,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:23,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:23,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:23,327 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:23,327 INFO L87 Difference]: Start difference. First operand 202 states and 336 transitions. Second operand 8 states. [2018-10-04 12:42:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:23,720 INFO L93 Difference]: Finished difference Result 220 states and 353 transitions. [2018-10-04 12:42:23,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:42:23,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-04 12:42:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:23,725 INFO L225 Difference]: With dead ends: 220 [2018-10-04 12:42:23,725 INFO L226 Difference]: Without dead ends: 218 [2018-10-04 12:42:23,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 14 [2018-10-04 12:42:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-04 12:42:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2018-10-04 12:42:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-04 12:42:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2018-10-04 12:42:23,759 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 10 [2018-10-04 12:42:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:23,759 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2018-10-04 12:42:23,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2018-10-04 12:42:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:42:23,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:23,760 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:23,761 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:23,761 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:23,761 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-10-04 12:42:23,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:23,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:23,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:23,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:23,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:23,848 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-04 12:42:23,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:23,848 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-04 12:42:23,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:23,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:23,946 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-04 12:42:23,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:23,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-04 12:42:23,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:42:23,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:42:23,968 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:23,969 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 13 states. [2018-10-04 12:42:24,205 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:42:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:25,399 INFO L93 Difference]: Finished difference Result 320 states and 507 transitions. [2018-10-04 12:42:25,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:42:25,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-10-04 12:42:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:25,402 INFO L225 Difference]: With dead ends: 320 [2018-10-04 12:42:25,402 INFO L226 Difference]: Without dead ends: 318 [2018-10-04 12:42:25,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 16 [2018-10-04 12:42:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-04 12:42:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 259. [2018-10-04 12:42:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-04 12:42:25,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 430 transitions. [2018-10-04 12:42:25,444 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 430 transitions. Word has length 10 [2018-10-04 12:42:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:25,445 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 430 transitions. [2018-10-04 12:42:25,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:42:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 430 transitions. [2018-10-04 12:42:25,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:42:25,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:25,446 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:25,446 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:25,446 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:25,446 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-10-04 12:42:25,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:25,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:25,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:25,567 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-04 12:42:25,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:25,568 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-04 12:42:25,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:25,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:25,681 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-04 12:42:25,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:25,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-04 12:42:25,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:42:25,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:42:25,704 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:25,704 INFO L87 Difference]: Start difference. First operand 259 states and 430 transitions. Second operand 14 states. [2018-10-04 12:42:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:26,131 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2018-10-04 12:42:26,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:42:26,131 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 12:42:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:26,133 INFO L225 Difference]: With dead ends: 304 [2018-10-04 12:42:26,133 INFO L226 Difference]: Without dead ends: 302 [2018-10-04 12:42:26,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 16 [2018-10-04 12:42:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-04 12:42:26,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 270. [2018-10-04 12:42:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-04 12:42:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 448 transitions. [2018-10-04 12:42:26,178 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 448 transitions. Word has length 10 [2018-10-04 12:42:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:26,178 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 448 transitions. [2018-10-04 12:42:26,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:42:26,178 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 448 transitions. [2018-10-04 12:42:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:42:26,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:26,179 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:26,179 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:26,179 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:26,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-10-04 12:42:26,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:26,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:26,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:26,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:26,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:26,453 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-04 12:42:26,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:26,453 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-04 12:42:26,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:26,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:26,513 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-04 12:42:26,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:26,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:42:26,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:42:26,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:42:26,536 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:26,536 INFO L87 Difference]: Start difference. First operand 270 states and 448 transitions. Second operand 14 states. [2018-10-04 12:42:27,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:27,071 INFO L93 Difference]: Finished difference Result 281 states and 455 transitions. [2018-10-04 12:42:27,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:42:27,071 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-04 12:42:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:27,073 INFO L225 Difference]: With dead ends: 281 [2018-10-04 12:42:27,073 INFO L226 Difference]: Without dead ends: 280 [2018-10-04 12:42:27,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 14 [2018-10-04 12:42:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-04 12:42:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2018-10-04 12:42:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-04 12:42:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 447 transitions. [2018-10-04 12:42:27,119 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 447 transitions. Word has length 10 [2018-10-04 12:42:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:27,119 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 447 transitions. [2018-10-04 12:42:27,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:42:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 447 transitions. [2018-10-04 12:42:27,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:42:27,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:27,120 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:27,121 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:27,121 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:27,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-10-04 12:42:27,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:27,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:27,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:27,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:27,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:27,600 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-04 12:42:27,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:42:27,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-04 12:42:27,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:42:27,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:42:27,601 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:27,601 INFO L87 Difference]: Start difference. First operand 270 states and 447 transitions. Second operand 8 states. [2018-10-04 12:42:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:27,972 INFO L93 Difference]: Finished difference Result 286 states and 460 transitions. [2018-10-04 12:42:27,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:42:27,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-04 12:42:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:27,975 INFO L225 Difference]: With dead ends: 286 [2018-10-04 12:42:27,975 INFO L226 Difference]: Without dead ends: 284 [2018-10-04 12:42:27,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 14 [2018-10-04 12:42:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-04 12:42:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2018-10-04 12:42:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-04 12:42:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 443 transitions. [2018-10-04 12:42:28,019 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 443 transitions. Word has length 10 [2018-10-04 12:42:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:28,020 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 443 transitions. [2018-10-04 12:42:28,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:42:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 443 transitions. [2018-10-04 12:42:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:28,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:28,021 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:28,021 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:28,021 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:28,021 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-10-04 12:42:28,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:28,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:28,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:28,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:28,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:28,976 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-04 12:42:28,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:28,977 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-04 12:42:28,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:29,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:29,274 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-04 12:42:29,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:29,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-04 12:42:29,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:42:29,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:42:29,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:29,297 INFO L87 Difference]: Start difference. First operand 268 states and 443 transitions. Second operand 16 states. [2018-10-04 12:42:29,784 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:42:30,929 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 8 [2018-10-04 12:42:31,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:31,666 INFO L93 Difference]: Finished difference Result 515 states and 842 transitions. [2018-10-04 12:42:31,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:42:31,667 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-10-04 12:42:31,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:31,670 INFO L225 Difference]: With dead ends: 515 [2018-10-04 12:42:31,670 INFO L226 Difference]: Without dead ends: 513 [2018-10-04 12:42:31,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time 1.5s impTime 9 [2018-10-04 12:42:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-04 12:42:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 338. [2018-10-04 12:42:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-04 12:42:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 568 transitions. [2018-10-04 12:42:31,728 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 568 transitions. Word has length 12 [2018-10-04 12:42:31,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:31,729 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 568 transitions. [2018-10-04 12:42:31,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:42:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 568 transitions. [2018-10-04 12:42:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:42:31,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:31,730 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:31,730 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:31,730 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:31,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-10-04 12:42:31,730 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:31,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:31,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:31,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:31,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:31,845 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-04 12:42:31,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:31,846 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:42:31,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:31,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:31,931 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-04 12:42:31,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:31,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-04 12:42:31,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:42:31,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:42:31,954 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:31,954 INFO L87 Difference]: Start difference. First operand 338 states and 568 transitions. Second operand 16 states. [2018-10-04 12:42:32,293 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:42:33,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:33,270 INFO L93 Difference]: Finished difference Result 631 states and 1050 transitions. [2018-10-04 12:42:33,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:42:33,271 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-10-04 12:42:33,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:33,274 INFO L225 Difference]: With dead ends: 631 [2018-10-04 12:42:33,274 INFO L226 Difference]: Without dead ends: 629 [2018-10-04 12:42:33,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 18 [2018-10-04 12:42:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-04 12:42:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 403. [2018-10-04 12:42:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-04 12:42:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 685 transitions. [2018-10-04 12:42:33,368 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 685 transitions. Word has length 12 [2018-10-04 12:42:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:33,368 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 685 transitions. [2018-10-04 12:42:33,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:42:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 685 transitions. [2018-10-04 12:42:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:42:33,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:33,369 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:33,369 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:33,369 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:33,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-10-04 12:42:33,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:33,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:33,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:33,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:33,660 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-04 12:42:33,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:33,661 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-04 12:42:33,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:33,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:42:33,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:42:33,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-04 12:42:33,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:42:33,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:42:33,761 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:33,761 INFO L87 Difference]: Start difference. First operand 403 states and 685 transitions. Second operand 14 states. [2018-10-04 12:42:34,100 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 7 [2018-10-04 12:42:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:42:35,610 INFO L93 Difference]: Finished difference Result 1330 states and 2225 transitions. [2018-10-04 12:42:35,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 12:42:35,610 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-04 12:42:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:42:35,614 INFO L225 Difference]: With dead ends: 1330 [2018-10-04 12:42:35,614 INFO L226 Difference]: Without dead ends: 929 [2018-10-04 12:42:35,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 12 [2018-10-04 12:42:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-10-04 12:42:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 694. [2018-10-04 12:42:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-10-04 12:42:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1171 transitions. [2018-10-04 12:42:35,748 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1171 transitions. Word has length 13 [2018-10-04 12:42:35,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:42:35,748 INFO L480 AbstractCegarLoop]: Abstraction has 694 states and 1171 transitions. [2018-10-04 12:42:35,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:42:35,749 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1171 transitions. [2018-10-04 12:42:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:42:35,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:42:35,750 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:42:35,750 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr3ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:42:35,750 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:42:35,750 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-10-04 12:42:35,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:42:35,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:42:35,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:35,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:35,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:42:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:35,839 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-04 12:42:35,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:42:35,839 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-04 12:42:35,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:42:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:42:35,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:42:36,227 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-04 12:42:36,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:42:36,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-04 12:42:36,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:42:36,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:42:36,260 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:42:36,260 INFO L87 Difference]: Start difference. First operand 694 states and 1171 transitions. Second operand 14 states. [2018-10-04 12:42:37,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:42:37,177 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (<= (+ product_begin0 2) product_end0))) (and (and .cse0 (exists ((v_product_begin1_22 Int)) (and (<= (+ product_begin0 v_product_begin1_22 2) (* 2 product_end0)) (<= (+ product_begin0 2) v_product_begin1_22)))) (not (and .cse0 (<= (+ (* 2 product_begin0) 4) (* 2 product_end0)))))) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.getWitness(PredicateTrie.java:213) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:412) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:412) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.restructurePredicateTrie(BPredicateUnifier.java:371) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:249) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:218) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:301) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateForConjunction(BPredicateUnifier.java:146) 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-04 12:42:37,182 INFO L168 Benchmark]: Toolchain (without parser) took 31357.40 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 245.9 MB). Free memory was 1.4 GB in the beginning and 878.1 MB in the end (delta: 563.4 MB). Peak memory consumption was 809.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:37,184 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:42:37,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:42:37,186 INFO L168 Benchmark]: Boogie Preprocessor took 22.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:42:37,186 INFO L168 Benchmark]: RCFGBuilder took 558.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:37,187 INFO L168 Benchmark]: TraceAbstraction took 30729.75 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 245.9 MB). Free memory was 1.4 GB in the beginning and 878.1 MB in the end (delta: 542.3 MB). Peak memory consumption was 788.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:42:37,192 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.32 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 558.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30729.75 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 245.9 MB). Free memory was 1.4 GB in the beginning and 878.1 MB in the end (delta: 542.3 MB). Peak memory consumption was 788.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (<= (+ product_begin0 2) product_end0))) (and (and .cse0 (exists ((v_product_begin1_22 Int)) (and (<= (+ product_begin0 v_product_begin1_22 2) (* 2 product_end0)) (<= (+ product_begin0 2) v_product_begin1_22)))) (not (and .cse0 (<= (+ (* 2 product_begin0) 4) (* 2 product_end0)))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (<= (+ product_begin0 2) product_end0))) (and (and .cse0 (exists ((v_product_begin1_22 Int)) (and (<= (+ product_begin0 v_product_begin1_22 2) (* 2 product_end0)) (<= (+ product_begin0 2) v_product_begin1_22)))) (not (and .cse0 (<= (+ (* 2 product_begin0) 4) (* 2 product_end0)))))): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.getWitness(PredicateTrie.java:213) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-42-37-205.csv Received shutdown request...