java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/real-life/threadpooling_product.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c372c2b [2018-10-02 11:35:23,695 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:35:23,698 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:35:23,715 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:35:23,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:35:23,717 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:35:23,720 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:35:23,723 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:35:23,733 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:35:23,735 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:35:23,737 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:35:23,737 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:35:23,738 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:35:23,741 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:35:23,742 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:35:23,743 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:35:23,744 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:35:23,746 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:35:23,752 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:35:23,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:35:23,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:35:23,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:35:23,762 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:35:23,762 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:35:23,762 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:35:23,764 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:35:23,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:35:23,766 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:35:23,767 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:35:23,768 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:35:23,768 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:35:23,769 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:35:23,769 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:35:23,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:35:23,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:35:23,773 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:35:23,773 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-02 11:35:23,801 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:35:23,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:35:23,802 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:35:23,802 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:35:23,803 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:35:23,803 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:35:23,804 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:35:23,804 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:35:23,804 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:35:23,804 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:35:23,804 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:35:23,805 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:35:23,805 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:35:23,805 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:35:23,805 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:35:23,805 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:35:23,806 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:35:23,806 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:35:23,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:35:23,806 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:35:23,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:35:23,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:35:23,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:35:23,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:35:23,807 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:35:23,807 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:35:23,807 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:35:23,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:35:23,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:35:23,808 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:35:23,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:35:23,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:35:23,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:35:23,903 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:35:23,905 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:35:23,906 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-02 11:35:23,906 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product.bpl' [2018-10-02 11:35:23,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:35:23,968 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:35:23,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:35:23,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:35:23,969 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:35:23,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:23" (1/1) ... [2018-10-02 11:35:24,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:23" (1/1) ... [2018-10-02 11:35:24,010 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-02 11:35:24,011 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-02 11:35:24,011 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-02 11:35:24,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:35:24,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:35:24,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:35:24,014 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:35:24,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:23" (1/1) ... [2018-10-02 11:35:24,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:23" (1/1) ... [2018-10-02 11:35:24,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:23" (1/1) ... [2018-10-02 11:35:24,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:23" (1/1) ... [2018-10-02 11:35:24,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:23" (1/1) ... [2018-10-02 11:35:24,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:23" (1/1) ... [2018-10-02 11:35:24,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:23" (1/1) ... [2018-10-02 11:35:24,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:35:24,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:35:24,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:35:24,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:35:24,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:35:24,112 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-10-02 11:35:24,112 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-10-02 11:35:24,113 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-10-02 11:35:24,735 INFO L337 CfgBuilder]: Using library mode [2018-10-02 11:35:24,735 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:24 BoogieIcfgContainer [2018-10-02 11:35:24,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:35:24,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:35:24,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:35:24,741 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:35:24,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.10 11:35:23" (1/2) ... [2018-10-02 11:35:24,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf25299 and model type threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:35:24, skipping insertion in model container [2018-10-02 11:35:24,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:35:24" (2/2) ... [2018-10-02 11:35:24,746 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product.bpl [2018-10-02 11:35:24,757 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:35:24,767 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-02 11:35:24,820 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:35:24,821 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:35:24,821 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:35:24,821 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:35:24,822 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:35:24,822 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:35:24,822 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:35:24,822 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:35:24,822 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:35:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-02 11:35:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 11:35:24,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:24,850 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 11:35:24,852 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:24,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash 28755683, now seen corresponding path program 1 times [2018-10-02 11:35:24,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:24,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:24,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:24,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:24,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:25,046 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-02 11:35:25,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:25,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:35:25,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:35:25,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:35:25,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:35:25,068 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-10-02 11:35:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:25,796 INFO L93 Difference]: Finished difference Result 49 states and 85 transitions. [2018-10-02 11:35:25,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:35:25,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-02 11:35:25,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:25,816 INFO L225 Difference]: With dead ends: 49 [2018-10-02 11:35:25,816 INFO L226 Difference]: Without dead ends: 47 [2018-10-02 11:35:25,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:35:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-02 11:35:25,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-02 11:35:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-02 11:35:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-10-02 11:35:25,867 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 5 [2018-10-02 11:35:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:25,868 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-10-02 11:35:25,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:35:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-10-02 11:35:25,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-02 11:35:25,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:25,869 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-02 11:35:25,870 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:25,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:25,870 INFO L82 PathProgramCache]: Analyzing trace with hash 28971747, now seen corresponding path program 1 times [2018-10-02 11:35:25,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:25,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:25,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:25,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:25,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:25,951 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-02 11:35:25,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:25,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:35:25,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:35:25,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:35:25,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:35:25,955 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 5 states. [2018-10-02 11:35:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:26,315 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2018-10-02 11:35:26,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-02 11:35:26,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-02 11:35:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:26,318 INFO L225 Difference]: With dead ends: 57 [2018-10-02 11:35:26,319 INFO L226 Difference]: Without dead ends: 55 [2018-10-02 11:35:26,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-02 11:35:26,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-02 11:35:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-10-02 11:35:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-02 11:35:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2018-10-02 11:35:26,329 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 5 [2018-10-02 11:35:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:26,330 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2018-10-02 11:35:26,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:35:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2018-10-02 11:35:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 11:35:26,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:26,331 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:26,331 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:26,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:26,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1864688358, now seen corresponding path program 1 times [2018-10-02 11:35:26,332 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:26,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:26,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:26,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:26,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:26,570 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-02 11:35:26,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:26,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-02 11:35:26,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:35:26,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:35:26,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:35:26,572 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand 7 states. [2018-10-02 11:35:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:27,796 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2018-10-02 11:35:27,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-02 11:35:27,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-02 11:35:27,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:27,800 INFO L225 Difference]: With dead ends: 84 [2018-10-02 11:35:27,800 INFO L226 Difference]: Without dead ends: 82 [2018-10-02 11:35:27,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:35:27,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-02 11:35:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-10-02 11:35:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-02 11:35:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2018-10-02 11:35:27,814 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 7 [2018-10-02 11:35:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:27,814 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2018-10-02 11:35:27,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:35:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2018-10-02 11:35:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-02 11:35:27,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:27,816 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-02 11:35:27,816 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:27,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:27,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1865765160, now seen corresponding path program 1 times [2018-10-02 11:35:27,817 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:27,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:27,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:27,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:27,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:27,939 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-02 11:35:27,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:27,939 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-02 11:35:27,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:27,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:28,206 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-02 11:35:28,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:35:28,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-02 11:35:28,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-02 11:35:28,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-02 11:35:28,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:35:28,242 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 9 states. [2018-10-02 11:35:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:29,108 INFO L93 Difference]: Finished difference Result 142 states and 245 transitions. [2018-10-02 11:35:29,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:35:29,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2018-10-02 11:35:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:29,113 INFO L225 Difference]: With dead ends: 142 [2018-10-02 11:35:29,113 INFO L226 Difference]: Without dead ends: 108 [2018-10-02 11:35:29,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-10-02 11:35:29,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-02 11:35:29,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 73. [2018-10-02 11:35:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-02 11:35:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2018-10-02 11:35:29,131 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 7 [2018-10-02 11:35:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:29,131 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 120 transitions. [2018-10-02 11:35:29,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-02 11:35:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 120 transitions. [2018-10-02 11:35:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-02 11:35:29,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:29,133 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:29,133 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:29,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:29,134 INFO L82 PathProgramCache]: Analyzing trace with hash 964893579, now seen corresponding path program 1 times [2018-10-02 11:35:29,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:29,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:29,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:29,279 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-02 11:35:29,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:29,280 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 11:35:29,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:29,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:29,327 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-02 11:35:29,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:35:29,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 10 [2018-10-02 11:35:29,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:35:29,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:35:29,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:35:29,351 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. Second operand 11 states. [2018-10-02 11:35:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:30,081 INFO L93 Difference]: Finished difference Result 148 states and 240 transitions. [2018-10-02 11:35:30,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:35:30,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2018-10-02 11:35:30,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:30,084 INFO L225 Difference]: With dead ends: 148 [2018-10-02 11:35:30,084 INFO L226 Difference]: Without dead ends: 97 [2018-10-02 11:35:30,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:35:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-02 11:35:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-10-02 11:35:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-02 11:35:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2018-10-02 11:35:30,101 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 9 [2018-10-02 11:35:30,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:30,102 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2018-10-02 11:35:30,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:35:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2018-10-02 11:35:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:30,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:30,103 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:30,105 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:30,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:30,105 INFO L82 PathProgramCache]: Analyzing trace with hash 101966393, now seen corresponding path program 1 times [2018-10-02 11:35:30,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:30,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:30,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:30,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:30,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:30,352 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-02 11:35:30,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:30,353 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 11:35:30,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:30,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:30,470 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-02 11:35:30,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:30,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 11:35:30,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:30,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:30,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:30,493 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand 14 states. [2018-10-02 11:35:30,768 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2018-10-02 11:35:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:31,410 INFO L93 Difference]: Finished difference Result 124 states and 193 transitions. [2018-10-02 11:35:31,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:35:31,411 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-02 11:35:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:31,413 INFO L225 Difference]: With dead ends: 124 [2018-10-02 11:35:31,413 INFO L226 Difference]: Without dead ends: 123 [2018-10-02 11:35:31,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:35:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-02 11:35:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-10-02 11:35:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-02 11:35:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 173 transitions. [2018-10-02 11:35:31,432 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 173 transitions. Word has length 10 [2018-10-02 11:35:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:31,432 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 173 transitions. [2018-10-02 11:35:31,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 173 transitions. [2018-10-02 11:35:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:31,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:31,434 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:31,434 INFO L423 AbstractCegarLoop]: === Iteration 7 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:31,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash 103259259, now seen corresponding path program 1 times [2018-10-02 11:35:31,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:31,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:31,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:31,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:31,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:31,602 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-02 11:35:31,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:31,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:31,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:31,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:31,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:31,604 INFO L87 Difference]: Start difference. First operand 107 states and 173 transitions. Second operand 8 states. [2018-10-02 11:35:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:32,426 INFO L93 Difference]: Finished difference Result 132 states and 203 transitions. [2018-10-02 11:35:32,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:35:32,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-02 11:35:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:32,427 INFO L225 Difference]: With dead ends: 132 [2018-10-02 11:35:32,428 INFO L226 Difference]: Without dead ends: 130 [2018-10-02 11:35:32,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:35:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-02 11:35:32,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2018-10-02 11:35:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-02 11:35:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 196 transitions. [2018-10-02 11:35:32,447 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 196 transitions. Word has length 10 [2018-10-02 11:35:32,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:32,447 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 196 transitions. [2018-10-02 11:35:32,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 196 transitions. [2018-10-02 11:35:32,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:32,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:32,448 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:32,449 INFO L423 AbstractCegarLoop]: === Iteration 8 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:32,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash -176034144, now seen corresponding path program 1 times [2018-10-02 11:35:32,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:32,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:32,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:32,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:32,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:32,577 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-02 11:35:32,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:32,578 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-02 11:35:32,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:32,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:33,219 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-02 11:35:33,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:33,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-02 11:35:33,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:33,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:33,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:33,253 INFO L87 Difference]: Start difference. First operand 121 states and 196 transitions. Second operand 14 states. [2018-10-02 11:35:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:34,625 INFO L93 Difference]: Finished difference Result 162 states and 262 transitions. [2018-10-02 11:35:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:35:34,626 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-02 11:35:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:34,627 INFO L225 Difference]: With dead ends: 162 [2018-10-02 11:35:34,627 INFO L226 Difference]: Without dead ends: 160 [2018-10-02 11:35:34,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:35:34,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-02 11:35:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2018-10-02 11:35:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-02 11:35:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 209 transitions. [2018-10-02 11:35:34,650 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 209 transitions. Word has length 10 [2018-10-02 11:35:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:34,650 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 209 transitions. [2018-10-02 11:35:34,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 209 transitions. [2018-10-02 11:35:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:34,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:34,652 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:34,652 INFO L423 AbstractCegarLoop]: === Iteration 9 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:34,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:34,653 INFO L82 PathProgramCache]: Analyzing trace with hash -176034432, now seen corresponding path program 1 times [2018-10-02 11:35:34,653 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:34,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:34,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:34,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:34,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:34,736 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-02 11:35:34,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:34,736 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-02 11:35:34,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:34,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:34,885 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-02 11:35:34,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:34,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-02 11:35:34,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:34,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:34,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:34,907 INFO L87 Difference]: Start difference. First operand 129 states and 209 transitions. Second operand 13 states. [2018-10-02 11:35:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:36,719 INFO L93 Difference]: Finished difference Result 223 states and 343 transitions. [2018-10-02 11:35:36,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 11:35:36,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-10-02 11:35:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:36,720 INFO L225 Difference]: With dead ends: 223 [2018-10-02 11:35:36,720 INFO L226 Difference]: Without dead ends: 221 [2018-10-02 11:35:36,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=349, Invalid=1631, Unknown=0, NotChecked=0, Total=1980 [2018-10-02 11:35:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-02 11:35:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 167. [2018-10-02 11:35:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-02 11:35:36,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 274 transitions. [2018-10-02 11:35:36,748 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 274 transitions. Word has length 10 [2018-10-02 11:35:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:36,748 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 274 transitions. [2018-10-02 11:35:36,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:35:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 274 transitions. [2018-10-02 11:35:36,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:36,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:36,750 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:36,750 INFO L423 AbstractCegarLoop]: === Iteration 10 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:36,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:36,750 INFO L82 PathProgramCache]: Analyzing trace with hash -184622601, now seen corresponding path program 1 times [2018-10-02 11:35:36,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:36,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:36,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:36,866 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-02 11:35:36,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:36,867 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-02 11:35:36,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:36,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:36,964 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-02 11:35:36,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:36,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 11:35:36,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:36,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:36,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:36,990 INFO L87 Difference]: Start difference. First operand 167 states and 274 transitions. Second operand 14 states. [2018-10-02 11:35:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:38,430 INFO L93 Difference]: Finished difference Result 222 states and 351 transitions. [2018-10-02 11:35:38,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 11:35:38,431 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-02 11:35:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:38,432 INFO L225 Difference]: With dead ends: 222 [2018-10-02 11:35:38,433 INFO L226 Difference]: Without dead ends: 221 [2018-10-02 11:35:38,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:35:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-02 11:35:38,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 181. [2018-10-02 11:35:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-02 11:35:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 297 transitions. [2018-10-02 11:35:38,459 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 297 transitions. Word has length 10 [2018-10-02 11:35:38,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:38,459 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 297 transitions. [2018-10-02 11:35:38,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 297 transitions. [2018-10-02 11:35:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:38,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:38,460 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:38,461 INFO L423 AbstractCegarLoop]: === Iteration 11 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:38,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:38,461 INFO L82 PathProgramCache]: Analyzing trace with hash -184621319, now seen corresponding path program 1 times [2018-10-02 11:35:38,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:38,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:38,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:38,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:38,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:38,713 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-02 11:35:38,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:38,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:38,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:38,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:38,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:38,715 INFO L87 Difference]: Start difference. First operand 181 states and 297 transitions. Second operand 8 states. [2018-10-02 11:35:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:39,111 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2018-10-02 11:35:39,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:35:39,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-02 11:35:39,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:39,113 INFO L225 Difference]: With dead ends: 203 [2018-10-02 11:35:39,113 INFO L226 Difference]: Without dead ends: 201 [2018-10-02 11:35:39,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:39,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-02 11:35:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2018-10-02 11:35:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-02 11:35:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 301 transitions. [2018-10-02 11:35:39,144 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 301 transitions. Word has length 10 [2018-10-02 11:35:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:39,144 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 301 transitions. [2018-10-02 11:35:39,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 301 transitions. [2018-10-02 11:35:39,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:39,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:39,145 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:39,146 INFO L423 AbstractCegarLoop]: === Iteration 12 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:39,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:39,146 INFO L82 PathProgramCache]: Analyzing trace with hash -973282432, now seen corresponding path program 1 times [2018-10-02 11:35:39,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:39,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:39,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:39,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:39,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:39,308 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-02 11:35:39,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:39,309 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-02 11:35:39,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:39,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:39,429 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-02 11:35:39,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:39,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 11:35:39,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:39,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:39,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:39,452 INFO L87 Difference]: Start difference. First operand 183 states and 301 transitions. Second operand 14 states. [2018-10-02 11:35:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:40,595 INFO L93 Difference]: Finished difference Result 241 states and 385 transitions. [2018-10-02 11:35:40,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-02 11:35:40,596 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-02 11:35:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:40,597 INFO L225 Difference]: With dead ends: 241 [2018-10-02 11:35:40,597 INFO L226 Difference]: Without dead ends: 240 [2018-10-02 11:35:40,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:35:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-02 11:35:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2018-10-02 11:35:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-02 11:35:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 336 transitions. [2018-10-02 11:35:40,626 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 336 transitions. Word has length 10 [2018-10-02 11:35:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:40,626 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 336 transitions. [2018-10-02 11:35:40,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 336 transitions. [2018-10-02 11:35:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:40,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:40,627 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:40,627 INFO L423 AbstractCegarLoop]: === Iteration 13 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:40,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:40,628 INFO L82 PathProgramCache]: Analyzing trace with hash -973281662, now seen corresponding path program 1 times [2018-10-02 11:35:40,628 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:40,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:40,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:40,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:40,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:40,751 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-02 11:35:40,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:40,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:40,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:40,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:40,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:40,752 INFO L87 Difference]: Start difference. First operand 202 states and 336 transitions. Second operand 8 states. [2018-10-02 11:35:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:41,064 INFO L93 Difference]: Finished difference Result 220 states and 353 transitions. [2018-10-02 11:35:41,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-02 11:35:41,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-02 11:35:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:41,067 INFO L225 Difference]: With dead ends: 220 [2018-10-02 11:35:41,067 INFO L226 Difference]: Without dead ends: 218 [2018-10-02 11:35:41,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-02 11:35:41,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2018-10-02 11:35:41,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-02 11:35:41,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 348 transitions. [2018-10-02 11:35:41,094 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 348 transitions. Word has length 10 [2018-10-02 11:35:41,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:41,094 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 348 transitions. [2018-10-02 11:35:41,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 348 transitions. [2018-10-02 11:35:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:41,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:41,095 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:41,095 INFO L423 AbstractCegarLoop]: === Iteration 14 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:41,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:41,096 INFO L82 PathProgramCache]: Analyzing trace with hash -981870601, now seen corresponding path program 1 times [2018-10-02 11:35:41,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:41,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:41,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:41,164 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-02 11:35:41,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:41,164 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-02 11:35:41,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:41,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:41,327 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-02 11:35:41,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:41,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-10-02 11:35:41,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:41,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:41,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:41,349 INFO L87 Difference]: Start difference. First operand 210 states and 348 transitions. Second operand 13 states. [2018-10-02 11:35:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:42,707 INFO L93 Difference]: Finished difference Result 320 states and 507 transitions. [2018-10-02 11:35:42,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 11:35:42,708 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2018-10-02 11:35:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:42,710 INFO L225 Difference]: With dead ends: 320 [2018-10-02 11:35:42,710 INFO L226 Difference]: Without dead ends: 318 [2018-10-02 11:35:42,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=349, Invalid=1631, Unknown=0, NotChecked=0, Total=1980 [2018-10-02 11:35:42,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-02 11:35:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 259. [2018-10-02 11:35:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-02 11:35:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 430 transitions. [2018-10-02 11:35:42,741 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 430 transitions. Word has length 10 [2018-10-02 11:35:42,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:42,741 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 430 transitions. [2018-10-02 11:35:42,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:35:42,742 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 430 transitions. [2018-10-02 11:35:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:42,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:42,742 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:42,743 INFO L423 AbstractCegarLoop]: === Iteration 15 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:42,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:42,743 INFO L82 PathProgramCache]: Analyzing trace with hash -981870889, now seen corresponding path program 1 times [2018-10-02 11:35:42,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:42,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:42,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:42,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:42,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:42,878 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-02 11:35:42,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:42,878 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-02 11:35:42,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:42,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:43,048 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-02 11:35:43,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:43,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-10-02 11:35:43,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:43,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:43,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:43,073 INFO L87 Difference]: Start difference. First operand 259 states and 430 transitions. Second operand 14 states. [2018-10-02 11:35:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:43,597 INFO L93 Difference]: Finished difference Result 304 states and 503 transitions. [2018-10-02 11:35:43,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-02 11:35:43,597 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-02 11:35:43,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:43,599 INFO L225 Difference]: With dead ends: 304 [2018-10-02 11:35:43,599 INFO L226 Difference]: Without dead ends: 302 [2018-10-02 11:35:43,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:35:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-02 11:35:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 270. [2018-10-02 11:35:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-02 11:35:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 448 transitions. [2018-10-02 11:35:43,636 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 448 transitions. Word has length 10 [2018-10-02 11:35:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:43,636 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 448 transitions. [2018-10-02 11:35:43,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 448 transitions. [2018-10-02 11:35:43,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:43,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:43,637 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:43,637 INFO L423 AbstractCegarLoop]: === Iteration 16 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:43,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:43,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1101306322, now seen corresponding path program 1 times [2018-10-02 11:35:43,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:43,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:43,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:43,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:43,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:43,780 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-02 11:35:43,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:43,780 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-02 11:35:43,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:43,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:43,874 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-02 11:35:43,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:43,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-02 11:35:43,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:43,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:43,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:43,896 INFO L87 Difference]: Start difference. First operand 270 states and 448 transitions. Second operand 14 states. [2018-10-02 11:35:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:44,376 INFO L93 Difference]: Finished difference Result 281 states and 455 transitions. [2018-10-02 11:35:44,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:35:44,377 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2018-10-02 11:35:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:44,379 INFO L225 Difference]: With dead ends: 281 [2018-10-02 11:35:44,379 INFO L226 Difference]: Without dead ends: 280 [2018-10-02 11:35:44,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:35:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-02 11:35:44,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2018-10-02 11:35:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-02 11:35:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 447 transitions. [2018-10-02 11:35:44,423 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 447 transitions. Word has length 10 [2018-10-02 11:35:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:44,423 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 447 transitions. [2018-10-02 11:35:44,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 447 transitions. [2018-10-02 11:35:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-02 11:35:44,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:44,424 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:44,424 INFO L423 AbstractCegarLoop]: === Iteration 17 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:44,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:44,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1102106644, now seen corresponding path program 1 times [2018-10-02 11:35:44,425 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:44,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:44,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:44,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:44,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:44,601 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-02 11:35:44,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:35:44,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-02 11:35:44,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-02 11:35:44,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-02 11:35:44,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-02 11:35:44,603 INFO L87 Difference]: Start difference. First operand 270 states and 447 transitions. Second operand 8 states. [2018-10-02 11:35:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:45,039 INFO L93 Difference]: Finished difference Result 286 states and 460 transitions. [2018-10-02 11:35:45,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-02 11:35:45,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2018-10-02 11:35:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:45,043 INFO L225 Difference]: With dead ends: 286 [2018-10-02 11:35:45,043 INFO L226 Difference]: Without dead ends: 284 [2018-10-02 11:35:45,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:35:45,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-02 11:35:45,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2018-10-02 11:35:45,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-02 11:35:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 443 transitions. [2018-10-02 11:35:45,088 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 443 transitions. Word has length 10 [2018-10-02 11:35:45,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:45,088 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 443 transitions. [2018-10-02 11:35:45,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-02 11:35:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 443 transitions. [2018-10-02 11:35:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:45,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:45,089 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:45,090 INFO L423 AbstractCegarLoop]: === Iteration 18 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:45,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:45,090 INFO L82 PathProgramCache]: Analyzing trace with hash 240543358, now seen corresponding path program 1 times [2018-10-02 11:35:45,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:45,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:45,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:45,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:46,057 WARN L178 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-02 11:35:46,317 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-02 11:35:46,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:46,318 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 11:35:46,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:46,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:46,479 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-02 11:35:46,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:46,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-02 11:35:46,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:35:46,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:35:46,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:46,503 INFO L87 Difference]: Start difference. First operand 268 states and 443 transitions. Second operand 16 states. [2018-10-02 11:35:47,274 WARN L178 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-10-02 11:35:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:49,154 INFO L93 Difference]: Finished difference Result 515 states and 842 transitions. [2018-10-02 11:35:49,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 11:35:49,154 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-10-02 11:35:49,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:49,157 INFO L225 Difference]: With dead ends: 515 [2018-10-02 11:35:49,157 INFO L226 Difference]: Without dead ends: 513 [2018-10-02 11:35:49,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=632, Invalid=1818, Unknown=0, NotChecked=0, Total=2450 [2018-10-02 11:35:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-02 11:35:49,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 338. [2018-10-02 11:35:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-02 11:35:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 568 transitions. [2018-10-02 11:35:49,210 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 568 transitions. Word has length 12 [2018-10-02 11:35:49,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:49,210 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 568 transitions. [2018-10-02 11:35:49,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:35:49,211 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 568 transitions. [2018-10-02 11:35:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-02 11:35:49,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:49,211 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:49,212 INFO L423 AbstractCegarLoop]: === Iteration 19 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:49,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1525011273, now seen corresponding path program 1 times [2018-10-02 11:35:49,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:49,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:49,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:49,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:49,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:49,474 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-02 11:35:49,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:49,474 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-02 11:35:49,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:49,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:49,566 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-02 11:35:49,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:49,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 15 [2018-10-02 11:35:49,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:35:49,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:35:49,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:35:49,591 INFO L87 Difference]: Start difference. First operand 338 states and 568 transitions. Second operand 16 states. [2018-10-02 11:35:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:51,101 INFO L93 Difference]: Finished difference Result 631 states and 1050 transitions. [2018-10-02 11:35:51,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-02 11:35:51,102 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 12 [2018-10-02 11:35:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:51,104 INFO L225 Difference]: With dead ends: 631 [2018-10-02 11:35:51,104 INFO L226 Difference]: Without dead ends: 629 [2018-10-02 11:35:51,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=632, Invalid=1818, Unknown=0, NotChecked=0, Total=2450 [2018-10-02 11:35:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-02 11:35:51,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 403. [2018-10-02 11:35:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-02 11:35:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 685 transitions. [2018-10-02 11:35:51,185 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 685 transitions. Word has length 12 [2018-10-02 11:35:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:51,185 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 685 transitions. [2018-10-02 11:35:51,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:35:51,185 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 685 transitions. [2018-10-02 11:35:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:35:51,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:51,186 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:51,187 INFO L423 AbstractCegarLoop]: === Iteration 20 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:51,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:51,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1000080215, now seen corresponding path program 1 times [2018-10-02 11:35:51,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:51,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:51,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:51,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:51,291 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-02 11:35:51,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:51,291 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-02 11:35:51,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:51,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:51,394 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-02 11:35:51,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:35:51,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-02 11:35:51,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:51,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:51,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:51,416 INFO L87 Difference]: Start difference. First operand 403 states and 685 transitions. Second operand 14 states. [2018-10-02 11:35:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:53,659 INFO L93 Difference]: Finished difference Result 1330 states and 2225 transitions. [2018-10-02 11:35:53,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 11:35:53,660 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 11:35:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:53,664 INFO L225 Difference]: With dead ends: 1330 [2018-10-02 11:35:53,664 INFO L226 Difference]: Without dead ends: 929 [2018-10-02 11:35:53,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=660, Invalid=3122, Unknown=0, NotChecked=0, Total=3782 [2018-10-02 11:35:53,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-10-02 11:35:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 694. [2018-10-02 11:35:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-10-02 11:35:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1171 transitions. [2018-10-02 11:35:53,823 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1171 transitions. Word has length 13 [2018-10-02 11:35:53,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:53,824 INFO L480 AbstractCegarLoop]: Abstraction has 694 states and 1171 transitions. [2018-10-02 11:35:53,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1171 transitions. [2018-10-02 11:35:53,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:35:53,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:53,825 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:53,825 INFO L423 AbstractCegarLoop]: === Iteration 21 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:53,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:53,826 INFO L82 PathProgramCache]: Analyzing trace with hash -86603521, now seen corresponding path program 1 times [2018-10-02 11:35:53,826 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:53,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:53,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:53,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:53,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:54,034 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-02 11:35:54,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:54,034 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-02 11:35:54,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:54,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:54,165 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-02 11:35:54,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:54,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-02 11:35:54,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:54,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:54,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:54,187 INFO L87 Difference]: Start difference. First operand 694 states and 1171 transitions. Second operand 14 states. [2018-10-02 11:35:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:55,387 INFO L93 Difference]: Finished difference Result 1557 states and 2604 transitions. [2018-10-02 11:35:55,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 11:35:55,389 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 11:35:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:55,392 INFO L225 Difference]: With dead ends: 1557 [2018-10-02 11:35:55,393 INFO L226 Difference]: Without dead ends: 864 [2018-10-02 11:35:55,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:35:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-10-02 11:35:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 741. [2018-10-02 11:35:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-02 11:35:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1247 transitions. [2018-10-02 11:35:55,532 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1247 transitions. Word has length 13 [2018-10-02 11:35:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:55,532 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 1247 transitions. [2018-10-02 11:35:55,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:35:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1247 transitions. [2018-10-02 11:35:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:35:55,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:55,533 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:55,533 INFO L423 AbstractCegarLoop]: === Iteration 22 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:55,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash -63701769, now seen corresponding path program 1 times [2018-10-02 11:35:55,534 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:55,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:55,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:55,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:55,625 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:55,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:55,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:55,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:55,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-02 11:35:55,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:35:55,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:35:55,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:35:55,763 INFO L87 Difference]: Start difference. First operand 741 states and 1247 transitions. Second operand 13 states. [2018-10-02 11:35:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:56,770 INFO L93 Difference]: Finished difference Result 1655 states and 2757 transitions. [2018-10-02 11:35:56,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:35:56,771 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-02 11:35:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:56,774 INFO L225 Difference]: With dead ends: 1655 [2018-10-02 11:35:56,774 INFO L226 Difference]: Without dead ends: 915 [2018-10-02 11:35:56,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:35:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-10-02 11:35:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 809. [2018-10-02 11:35:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-10-02 11:35:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1353 transitions. [2018-10-02 11:35:56,907 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1353 transitions. Word has length 13 [2018-10-02 11:35:56,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:56,907 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1353 transitions. [2018-10-02 11:35:56,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:35:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1353 transitions. [2018-10-02 11:35:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:35:56,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:56,908 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:56,909 INFO L423 AbstractCegarLoop]: === Iteration 23 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:56,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:56,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1761298639, now seen corresponding path program 1 times [2018-10-02 11:35:56,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:56,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:56,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:56,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:56,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:57,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:57,008 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:57,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:57,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:35:57,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:35:57,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-02 11:35:57,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:35:57,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:35:57,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:35:57,089 INFO L87 Difference]: Start difference. First operand 809 states and 1353 transitions. Second operand 10 states. [2018-10-02 11:35:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:35:57,866 INFO L93 Difference]: Finished difference Result 939 states and 1541 transitions. [2018-10-02 11:35:57,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:35:57,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-10-02 11:35:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:35:57,872 INFO L225 Difference]: With dead ends: 939 [2018-10-02 11:35:57,872 INFO L226 Difference]: Without dead ends: 937 [2018-10-02 11:35:57,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-10-02 11:35:57,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-10-02 11:35:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 820. [2018-10-02 11:35:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-10-02 11:35:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1367 transitions. [2018-10-02 11:35:58,028 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1367 transitions. Word has length 13 [2018-10-02 11:35:58,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:35:58,029 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 1367 transitions. [2018-10-02 11:35:58,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:35:58,029 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1367 transitions. [2018-10-02 11:35:58,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:35:58,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:35:58,030 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:35:58,030 INFO L423 AbstractCegarLoop]: === Iteration 24 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:35:58,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:35:58,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1799471129, now seen corresponding path program 1 times [2018-10-02 11:35:58,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:35:58,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:35:58,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:58,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:58,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:35:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:58,137 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-02 11:35:58,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:35:58,137 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:35:58,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:35:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:35:58,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:35:58,503 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-02 11:35:58,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:35:58,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-02 11:35:58,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:35:58,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:35:58,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:35:58,525 INFO L87 Difference]: Start difference. First operand 820 states and 1367 transitions. Second operand 14 states. [2018-10-02 11:36:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:00,353 INFO L93 Difference]: Finished difference Result 2058 states and 3403 transitions. [2018-10-02 11:36:00,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-02 11:36:00,358 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 11:36:00,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:00,363 INFO L225 Difference]: With dead ends: 2058 [2018-10-02 11:36:00,363 INFO L226 Difference]: Without dead ends: 1239 [2018-10-02 11:36:00,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=436, Invalid=2426, Unknown=0, NotChecked=0, Total=2862 [2018-10-02 11:36:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2018-10-02 11:36:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 899. [2018-10-02 11:36:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-02 11:36:00,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1500 transitions. [2018-10-02 11:36:00,503 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1500 transitions. Word has length 13 [2018-10-02 11:36:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:00,503 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1500 transitions. [2018-10-02 11:36:00,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:36:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1500 transitions. [2018-10-02 11:36:00,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:36:00,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:00,504 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:00,504 INFO L423 AbstractCegarLoop]: === Iteration 25 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:00,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:00,505 INFO L82 PathProgramCache]: Analyzing trace with hash 267374077, now seen corresponding path program 1 times [2018-10-02 11:36:00,505 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:00,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:00,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:00,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:00,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:00,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:00,620 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:00,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:00,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:00,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:00,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-02 11:36:00,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-02 11:36:00,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-02 11:36:00,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-02 11:36:00,677 INFO L87 Difference]: Start difference. First operand 899 states and 1500 transitions. Second operand 10 states. [2018-10-02 11:36:01,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:01,416 INFO L93 Difference]: Finished difference Result 1038 states and 1712 transitions. [2018-10-02 11:36:01,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:36:01,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2018-10-02 11:36:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:01,421 INFO L225 Difference]: With dead ends: 1038 [2018-10-02 11:36:01,421 INFO L226 Difference]: Without dead ends: 1036 [2018-10-02 11:36:01,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2018-10-02 11:36:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-10-02 11:36:01,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 897. [2018-10-02 11:36:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-10-02 11:36:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1498 transitions. [2018-10-02 11:36:01,576 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1498 transitions. Word has length 13 [2018-10-02 11:36:01,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:01,576 INFO L480 AbstractCegarLoop]: Abstraction has 897 states and 1498 transitions. [2018-10-02 11:36:01,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-02 11:36:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1498 transitions. [2018-10-02 11:36:01,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:36:01,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:01,577 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:01,577 INFO L423 AbstractCegarLoop]: === Iteration 26 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:01,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:01,578 INFO L82 PathProgramCache]: Analyzing trace with hash 290277111, now seen corresponding path program 1 times [2018-10-02 11:36:01,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:01,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:01,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:01,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:01,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:01,784 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-02 11:36:01,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:01,784 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:01,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:01,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:01,892 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-02 11:36:01,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:36:01,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-02 11:36:01,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:36:01,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:36:01,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:36:01,914 INFO L87 Difference]: Start difference. First operand 897 states and 1498 transitions. Second operand 14 states. [2018-10-02 11:36:02,193 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-02 11:36:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:04,113 INFO L93 Difference]: Finished difference Result 2193 states and 3616 transitions. [2018-10-02 11:36:04,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-02 11:36:04,113 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 11:36:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:04,118 INFO L225 Difference]: With dead ends: 2193 [2018-10-02 11:36:04,118 INFO L226 Difference]: Without dead ends: 1286 [2018-10-02 11:36:04,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=445, Invalid=2525, Unknown=0, NotChecked=0, Total=2970 [2018-10-02 11:36:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2018-10-02 11:36:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 995. [2018-10-02 11:36:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-02 11:36:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1646 transitions. [2018-10-02 11:36:04,298 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1646 transitions. Word has length 13 [2018-10-02 11:36:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:04,298 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1646 transitions. [2018-10-02 11:36:04,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:36:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1646 transitions. [2018-10-02 11:36:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:36:04,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:04,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:04,299 INFO L423 AbstractCegarLoop]: === Iteration 27 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:04,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:04,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2115278289, now seen corresponding path program 1 times [2018-10-02 11:36:04,300 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:04,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:04,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:04,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:04,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:04,375 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-02 11:36:04,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:04,375 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:04,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:04,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:04,505 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-02 11:36:04,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:04,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-10-02 11:36:04,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:36:04,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:36:04,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:36:04,528 INFO L87 Difference]: Start difference. First operand 995 states and 1646 transitions. Second operand 14 states. [2018-10-02 11:36:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:05,715 INFO L93 Difference]: Finished difference Result 2165 states and 3551 transitions. [2018-10-02 11:36:05,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 11:36:05,715 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 11:36:05,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:05,719 INFO L225 Difference]: With dead ends: 2165 [2018-10-02 11:36:05,719 INFO L226 Difference]: Without dead ends: 1153 [2018-10-02 11:36:05,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:36:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-10-02 11:36:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1001. [2018-10-02 11:36:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-10-02 11:36:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1642 transitions. [2018-10-02 11:36:05,880 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1642 transitions. Word has length 13 [2018-10-02 11:36:05,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:05,880 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1642 transitions. [2018-10-02 11:36:05,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:36:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1642 transitions. [2018-10-02 11:36:05,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:36:05,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:05,882 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:05,882 INFO L423 AbstractCegarLoop]: === Iteration 28 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:05,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:05,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2141517287, now seen corresponding path program 1 times [2018-10-02 11:36:05,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:05,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:05,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:05,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:05,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:06,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:06,361 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:06,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:06,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:06,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:06,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-10-02 11:36:06,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:36:06,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:36:06,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:36:06,780 INFO L87 Difference]: Start difference. First operand 1001 states and 1642 transitions. Second operand 13 states. [2018-10-02 11:36:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:08,203 INFO L93 Difference]: Finished difference Result 1397 states and 2244 transitions. [2018-10-02 11:36:08,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:36:08,203 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-02 11:36:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:08,207 INFO L225 Difference]: With dead ends: 1397 [2018-10-02 11:36:08,207 INFO L226 Difference]: Without dead ends: 1125 [2018-10-02 11:36:08,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:36:08,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-02 11:36:08,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 995. [2018-10-02 11:36:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-02 11:36:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1627 transitions. [2018-10-02 11:36:08,377 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1627 transitions. Word has length 13 [2018-10-02 11:36:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:08,377 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1627 transitions. [2018-10-02 11:36:08,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:36:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1627 transitions. [2018-10-02 11:36:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-02 11:36:08,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:08,378 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:08,378 INFO L423 AbstractCegarLoop]: === Iteration 29 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:08,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:08,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2129075237, now seen corresponding path program 1 times [2018-10-02 11:36:08,378 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:08,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:08,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:08,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:08,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:08,510 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-02 11:36:08,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:08,510 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:08,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:08,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:08,635 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-02 11:36:08,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:36:08,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2018-10-02 11:36:08,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:36:08,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:36:08,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:36:08,659 INFO L87 Difference]: Start difference. First operand 995 states and 1627 transitions. Second operand 14 states. [2018-10-02 11:36:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:10,912 INFO L93 Difference]: Finished difference Result 2724 states and 4397 transitions. [2018-10-02 11:36:10,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-02 11:36:10,913 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-02 11:36:10,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:10,919 INFO L225 Difference]: With dead ends: 2724 [2018-10-02 11:36:10,919 INFO L226 Difference]: Without dead ends: 1719 [2018-10-02 11:36:10,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=660, Invalid=3122, Unknown=0, NotChecked=0, Total=3782 [2018-10-02 11:36:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2018-10-02 11:36:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1241. [2018-10-02 11:36:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2018-10-02 11:36:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2017 transitions. [2018-10-02 11:36:11,160 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2017 transitions. Word has length 13 [2018-10-02 11:36:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:11,160 INFO L480 AbstractCegarLoop]: Abstraction has 1241 states and 2017 transitions. [2018-10-02 11:36:11,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:36:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2017 transitions. [2018-10-02 11:36:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 11:36:11,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:11,161 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:11,161 INFO L423 AbstractCegarLoop]: === Iteration 30 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:11,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:11,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1374164806, now seen corresponding path program 1 times [2018-10-02 11:36:11,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:11,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:11,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:11,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:11,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:11,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:11,270 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:11,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:11,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:11,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:11,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2018-10-02 11:36:11,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:11,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:11,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:11,412 INFO L87 Difference]: Start difference. First operand 1241 states and 2017 transitions. Second operand 15 states. [2018-10-02 11:36:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:12,827 INFO L93 Difference]: Finished difference Result 1442 states and 2324 transitions. [2018-10-02 11:36:12,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-02 11:36:12,828 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-02 11:36:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:12,833 INFO L225 Difference]: With dead ends: 1442 [2018-10-02 11:36:12,833 INFO L226 Difference]: Without dead ends: 1440 [2018-10-02 11:36:12,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:36:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2018-10-02 11:36:13,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1225. [2018-10-02 11:36:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-10-02 11:36:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1983 transitions. [2018-10-02 11:36:13,051 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1983 transitions. Word has length 15 [2018-10-02 11:36:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:13,051 INFO L480 AbstractCegarLoop]: Abstraction has 1225 states and 1983 transitions. [2018-10-02 11:36:13,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1983 transitions. [2018-10-02 11:36:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 11:36:13,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:13,052 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:13,052 INFO L423 AbstractCegarLoop]: === Iteration 31 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:13,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:13,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1511389740, now seen corresponding path program 1 times [2018-10-02 11:36:13,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:13,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:13,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:13,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:13,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:13,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:13,155 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:13,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:13,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:13,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:13,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2018-10-02 11:36:13,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:36:13,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:36:13,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:36:13,283 INFO L87 Difference]: Start difference. First operand 1225 states and 1983 transitions. Second operand 12 states. [2018-10-02 11:36:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:14,450 INFO L93 Difference]: Finished difference Result 1389 states and 2225 transitions. [2018-10-02 11:36:14,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:36:14,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-10-02 11:36:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:14,455 INFO L225 Difference]: With dead ends: 1389 [2018-10-02 11:36:14,455 INFO L226 Difference]: Without dead ends: 1387 [2018-10-02 11:36:14,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2018-10-02 11:36:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2018-10-02 11:36:14,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1211. [2018-10-02 11:36:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-10-02 11:36:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1953 transitions. [2018-10-02 11:36:14,677 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1953 transitions. Word has length 15 [2018-10-02 11:36:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:14,677 INFO L480 AbstractCegarLoop]: Abstraction has 1211 states and 1953 transitions. [2018-10-02 11:36:14,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:36:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1953 transitions. [2018-10-02 11:36:14,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:14,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:14,678 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:14,679 INFO L423 AbstractCegarLoop]: === Iteration 32 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:14,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:14,679 INFO L82 PathProgramCache]: Analyzing trace with hash -593242831, now seen corresponding path program 1 times [2018-10-02 11:36:14,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:14,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:14,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:14,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:14,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:14,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:14,751 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:14,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:14,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:14,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:14,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-10-02 11:36:14,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-02 11:36:14,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-02 11:36:14,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-02 11:36:14,886 INFO L87 Difference]: Start difference. First operand 1211 states and 1953 transitions. Second operand 14 states. [2018-10-02 11:36:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:16,545 INFO L93 Difference]: Finished difference Result 1445 states and 2303 transitions. [2018-10-02 11:36:16,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 11:36:16,545 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-10-02 11:36:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:16,550 INFO L225 Difference]: With dead ends: 1445 [2018-10-02 11:36:16,550 INFO L226 Difference]: Without dead ends: 1443 [2018-10-02 11:36:16,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=1093, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:36:16,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2018-10-02 11:36:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1205. [2018-10-02 11:36:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-02 11:36:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-10-02 11:36:16,799 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-10-02 11:36:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:16,799 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-10-02 11:36:16,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-02 11:36:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-10-02 11:36:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:16,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:16,800 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:16,801 INFO L423 AbstractCegarLoop]: === Iteration 33 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:16,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:16,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1223170690, now seen corresponding path program 1 times [2018-10-02 11:36:16,801 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:16,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:16,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:16,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:16,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:16,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:16,927 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:16,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:16,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:17,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:17,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-10-02 11:36:17,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:36:17,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:36:17,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:36:17,026 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 12 states. [2018-10-02 11:36:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:18,501 INFO L93 Difference]: Finished difference Result 1420 states and 2265 transitions. [2018-10-02 11:36:18,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:36:18,501 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2018-10-02 11:36:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:18,506 INFO L225 Difference]: With dead ends: 1420 [2018-10-02 11:36:18,506 INFO L226 Difference]: Without dead ends: 1418 [2018-10-02 11:36:18,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2018-10-02 11:36:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-10-02 11:36:18,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1213. [2018-10-02 11:36:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2018-10-02 11:36:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1951 transitions. [2018-10-02 11:36:18,742 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1951 transitions. Word has length 16 [2018-10-02 11:36:18,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:18,742 INFO L480 AbstractCegarLoop]: Abstraction has 1213 states and 1951 transitions. [2018-10-02 11:36:18,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:36:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1951 transitions. [2018-10-02 11:36:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:18,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:18,743 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:18,743 INFO L423 AbstractCegarLoop]: === Iteration 34 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:18,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:18,744 INFO L82 PathProgramCache]: Analyzing trace with hash -767609008, now seen corresponding path program 2 times [2018-10-02 11:36:18,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:18,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:18,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:18,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:18,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:18,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:18,838 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:18,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:36:18,858 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:36:18,859 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:36:18,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:18,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:18,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-02 11:36:18,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:36:18,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:36:18,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:36:18,914 INFO L87 Difference]: Start difference. First operand 1213 states and 1951 transitions. Second operand 11 states. [2018-10-02 11:36:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:19,784 INFO L93 Difference]: Finished difference Result 1334 states and 2129 transitions. [2018-10-02 11:36:19,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:36:19,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-10-02 11:36:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:19,789 INFO L225 Difference]: With dead ends: 1334 [2018-10-02 11:36:19,789 INFO L226 Difference]: Without dead ends: 1332 [2018-10-02 11:36:19,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:36:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2018-10-02 11:36:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1205. [2018-10-02 11:36:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-02 11:36:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-10-02 11:36:20,015 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-10-02 11:36:20,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:20,015 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-10-02 11:36:20,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:36:20,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-10-02 11:36:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:20,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:20,016 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:20,016 INFO L423 AbstractCegarLoop]: === Iteration 35 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:20,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:20,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1823106549, now seen corresponding path program 1 times [2018-10-02 11:36:20,016 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:20,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:20,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:36:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:20,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:20,092 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:20,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:20,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:20,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:20,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-02 11:36:20,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-02 11:36:20,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-02 11:36:20,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-02 11:36:20,201 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 11 states. [2018-10-02 11:36:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:21,039 INFO L93 Difference]: Finished difference Result 1330 states and 2118 transitions. [2018-10-02 11:36:21,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-02 11:36:21,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-10-02 11:36:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:21,046 INFO L225 Difference]: With dead ends: 1330 [2018-10-02 11:36:21,046 INFO L226 Difference]: Without dead ends: 1328 [2018-10-02 11:36:21,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:36:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-10-02 11:36:21,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1211. [2018-10-02 11:36:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1211 states. [2018-10-02 11:36:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1948 transitions. [2018-10-02 11:36:21,324 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1948 transitions. Word has length 16 [2018-10-02 11:36:21,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:21,324 INFO L480 AbstractCegarLoop]: Abstraction has 1211 states and 1948 transitions. [2018-10-02 11:36:21,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-02 11:36:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1948 transitions. [2018-10-02 11:36:21,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:21,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:21,325 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:21,325 INFO L423 AbstractCegarLoop]: === Iteration 36 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:21,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:21,326 INFO L82 PathProgramCache]: Analyzing trace with hash 481081049, now seen corresponding path program 2 times [2018-10-02 11:36:21,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:21,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:21,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:21,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:21,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:21,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:21,433 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:21,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:36:21,447 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:36:21,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:36:21,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:21,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:21,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-10-02 11:36:21,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:36:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:36:21,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:36:21,545 INFO L87 Difference]: Start difference. First operand 1211 states and 1948 transitions. Second operand 12 states. [2018-10-02 11:36:22,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:22,875 INFO L93 Difference]: Finished difference Result 1430 states and 2273 transitions. [2018-10-02 11:36:22,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-02 11:36:22,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2018-10-02 11:36:22,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:22,880 INFO L225 Difference]: With dead ends: 1430 [2018-10-02 11:36:22,880 INFO L226 Difference]: Without dead ends: 1428 [2018-10-02 11:36:22,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2018-10-02 11:36:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2018-10-02 11:36:23,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1205. [2018-10-02 11:36:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-10-02 11:36:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1938 transitions. [2018-10-02 11:36:23,112 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1938 transitions. Word has length 16 [2018-10-02 11:36:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:23,112 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1938 transitions. [2018-10-02 11:36:23,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:36:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1938 transitions. [2018-10-02 11:36:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-02 11:36:23,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:23,113 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:23,113 INFO L423 AbstractCegarLoop]: === Iteration 37 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:23,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:23,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1936399254, now seen corresponding path program 1 times [2018-10-02 11:36:23,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:23,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:23,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:23,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:36:23,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:23,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:23,492 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:23,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:23,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:23,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:23,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-10-02 11:36:23,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:36:23,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:36:23,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:36:23,665 INFO L87 Difference]: Start difference. First operand 1205 states and 1938 transitions. Second operand 13 states. [2018-10-02 11:36:25,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:25,487 INFO L93 Difference]: Finished difference Result 1432 states and 2278 transitions. [2018-10-02 11:36:25,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-02 11:36:25,488 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-10-02 11:36:25,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:25,491 INFO L225 Difference]: With dead ends: 1432 [2018-10-02 11:36:25,491 INFO L226 Difference]: Without dead ends: 1430 [2018-10-02 11:36:25,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2018-10-02 11:36:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-10-02 11:36:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1199. [2018-10-02 11:36:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-10-02 11:36:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1923 transitions. [2018-10-02 11:36:25,729 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1923 transitions. Word has length 16 [2018-10-02 11:36:25,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:25,729 INFO L480 AbstractCegarLoop]: Abstraction has 1199 states and 1923 transitions. [2018-10-02 11:36:25,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:36:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1923 transitions. [2018-10-02 11:36:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:25,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:25,731 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:25,731 INFO L423 AbstractCegarLoop]: === Iteration 38 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:25,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:25,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1085218294, now seen corresponding path program 1 times [2018-10-02 11:36:25,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:25,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:25,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:25,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:25,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:26,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:26,391 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:26,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:26,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:26,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:36:26,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2018-10-02 11:36:26,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:36:26,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:36:26,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:36:26,495 INFO L87 Difference]: Start difference. First operand 1199 states and 1923 transitions. Second operand 17 states. [2018-10-02 11:36:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:29,236 INFO L93 Difference]: Finished difference Result 1695 states and 2653 transitions. [2018-10-02 11:36:29,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-02 11:36:29,237 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2018-10-02 11:36:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:29,239 INFO L225 Difference]: With dead ends: 1695 [2018-10-02 11:36:29,240 INFO L226 Difference]: Without dead ends: 1376 [2018-10-02 11:36:29,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=596, Invalid=4660, Unknown=0, NotChecked=0, Total=5256 [2018-10-02 11:36:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2018-10-02 11:36:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1028. [2018-10-02 11:36:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-10-02 11:36:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1643 transitions. [2018-10-02 11:36:29,475 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1643 transitions. Word has length 18 [2018-10-02 11:36:29,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:29,475 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1643 transitions. [2018-10-02 11:36:29,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:36:29,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1643 transitions. [2018-10-02 11:36:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:29,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:29,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:29,477 INFO L423 AbstractCegarLoop]: === Iteration 39 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:29,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:29,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1597439053, now seen corresponding path program 1 times [2018-10-02 11:36:29,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:29,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:29,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:29,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:29,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:29,609 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-02 11:36:29,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:29,609 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:29,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:29,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:29,706 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-02 11:36:29,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:29,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-10-02 11:36:29,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:36:29,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:36:29,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:36:29,730 INFO L87 Difference]: Start difference. First operand 1028 states and 1643 transitions. Second operand 16 states. [2018-10-02 11:36:30,273 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-10-02 11:36:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:31,720 INFO L93 Difference]: Finished difference Result 1514 states and 2354 transitions. [2018-10-02 11:36:31,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-02 11:36:31,728 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-02 11:36:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:31,730 INFO L225 Difference]: With dead ends: 1514 [2018-10-02 11:36:31,730 INFO L226 Difference]: Without dead ends: 1219 [2018-10-02 11:36:31,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=383, Invalid=2067, Unknown=0, NotChecked=0, Total=2450 [2018-10-02 11:36:31,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-10-02 11:36:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1024. [2018-10-02 11:36:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-10-02 11:36:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1632 transitions. [2018-10-02 11:36:32,128 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1632 transitions. Word has length 18 [2018-10-02 11:36:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:32,128 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1632 transitions. [2018-10-02 11:36:32,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:36:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1632 transitions. [2018-10-02 11:36:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:32,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:32,130 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:32,130 INFO L423 AbstractCegarLoop]: === Iteration 40 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:32,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:32,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1672170852, now seen corresponding path program 1 times [2018-10-02 11:36:32,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:32,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:32,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:32,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:32,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:36:32,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:32,662 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:32,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:32,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:32,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:32,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-10-02 11:36:32,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:36:32,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:36:32,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:36:32,833 INFO L87 Difference]: Start difference. First operand 1024 states and 1632 transitions. Second operand 16 states. [2018-10-02 11:36:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:34,721 INFO L93 Difference]: Finished difference Result 2556 states and 4045 transitions. [2018-10-02 11:36:34,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-02 11:36:34,722 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-10-02 11:36:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:34,724 INFO L225 Difference]: With dead ends: 2556 [2018-10-02 11:36:34,724 INFO L226 Difference]: Without dead ends: 1529 [2018-10-02 11:36:34,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2018-10-02 11:36:34,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-10-02 11:36:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1073. [2018-10-02 11:36:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2018-10-02 11:36:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1703 transitions. [2018-10-02 11:36:34,989 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1703 transitions. Word has length 18 [2018-10-02 11:36:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:34,990 INFO L480 AbstractCegarLoop]: Abstraction has 1073 states and 1703 transitions. [2018-10-02 11:36:34,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:36:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1703 transitions. [2018-10-02 11:36:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:34,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:34,991 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:34,991 INFO L423 AbstractCegarLoop]: === Iteration 41 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:34,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:34,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1136854538, now seen corresponding path program 1 times [2018-10-02 11:36:34,991 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:34,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:34,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:34,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:34,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:35,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:35,083 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:35,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:35,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:35,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:35,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-02 11:36:35,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:36:35,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:36:35,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:35,196 INFO L87 Difference]: Start difference. First operand 1073 states and 1703 transitions. Second operand 15 states. [2018-10-02 11:36:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:36,800 INFO L93 Difference]: Finished difference Result 1546 states and 2389 transitions. [2018-10-02 11:36:36,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-02 11:36:36,800 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2018-10-02 11:36:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:36,803 INFO L225 Difference]: With dead ends: 1546 [2018-10-02 11:36:36,803 INFO L226 Difference]: Without dead ends: 1291 [2018-10-02 11:36:36,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2018-10-02 11:36:36,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-10-02 11:36:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1056. [2018-10-02 11:36:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-10-02 11:36:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1674 transitions. [2018-10-02 11:36:37,115 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1674 transitions. Word has length 18 [2018-10-02 11:36:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:37,115 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1674 transitions. [2018-10-02 11:36:37,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:36:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1674 transitions. [2018-10-02 11:36:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-02 11:36:37,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:37,116 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:37,117 INFO L423 AbstractCegarLoop]: === Iteration 42 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:37,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash 975863549, now seen corresponding path program 1 times [2018-10-02 11:36:37,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:37,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:37,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:37,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:37,172 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:37,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:37,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:37,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:37,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:36:37,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:36:37,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:36:37,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:36:37,213 INFO L87 Difference]: Start difference. First operand 1056 states and 1674 transitions. Second operand 7 states. [2018-10-02 11:36:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:37,905 INFO L93 Difference]: Finished difference Result 1635 states and 2515 transitions. [2018-10-02 11:36:37,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-02 11:36:37,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-02 11:36:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:37,909 INFO L225 Difference]: With dead ends: 1635 [2018-10-02 11:36:37,909 INFO L226 Difference]: Without dead ends: 1494 [2018-10-02 11:36:37,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:36:37,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2018-10-02 11:36:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1094. [2018-10-02 11:36:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-10-02 11:36:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1728 transitions. [2018-10-02 11:36:38,294 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1728 transitions. Word has length 18 [2018-10-02 11:36:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:38,294 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 1728 transitions. [2018-10-02 11:36:38,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:36:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1728 transitions. [2018-10-02 11:36:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 11:36:38,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:38,295 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-02 11:36:38,295 INFO L423 AbstractCegarLoop]: === Iteration 43 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:38,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:38,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1152261854, now seen corresponding path program 1 times [2018-10-02 11:36:38,296 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:38,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:38,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:38,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:38,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:38,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:38,449 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:38,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:38,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:38,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:38,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-10-02 11:36:38,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:36:38,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:36:38,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:36:38,559 INFO L87 Difference]: Start difference. First operand 1094 states and 1728 transitions. Second operand 17 states. [2018-10-02 11:36:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:42,173 INFO L93 Difference]: Finished difference Result 2230 states and 3534 transitions. [2018-10-02 11:36:42,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-02 11:36:42,173 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-10-02 11:36:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:42,176 INFO L225 Difference]: With dead ends: 2230 [2018-10-02 11:36:42,176 INFO L226 Difference]: Without dead ends: 2180 [2018-10-02 11:36:42,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1477, Invalid=4529, Unknown=0, NotChecked=0, Total=6006 [2018-10-02 11:36:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2018-10-02 11:36:42,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 1150. [2018-10-02 11:36:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2018-10-02 11:36:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1853 transitions. [2018-10-02 11:36:42,579 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1853 transitions. Word has length 20 [2018-10-02 11:36:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:42,579 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 1853 transitions. [2018-10-02 11:36:42,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:36:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1853 transitions. [2018-10-02 11:36:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 11:36:42,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:42,580 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:42,580 INFO L423 AbstractCegarLoop]: === Iteration 44 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:42,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:42,580 INFO L82 PathProgramCache]: Analyzing trace with hash -79326665, now seen corresponding path program 1 times [2018-10-02 11:36:42,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:42,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:42,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:42,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:42,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:36:42,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:42,639 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:42,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:42,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:36:42,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:42,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-02 11:36:42,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-02 11:36:42,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-02 11:36:42,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-02 11:36:42,680 INFO L87 Difference]: Start difference. First operand 1150 states and 1853 transitions. Second operand 7 states. [2018-10-02 11:36:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:43,276 INFO L93 Difference]: Finished difference Result 1760 states and 2751 transitions. [2018-10-02 11:36:43,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-02 11:36:43,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-02 11:36:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:43,278 INFO L225 Difference]: With dead ends: 1760 [2018-10-02 11:36:43,278 INFO L226 Difference]: Without dead ends: 1507 [2018-10-02 11:36:43,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:36:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-10-02 11:36:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1026. [2018-10-02 11:36:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2018-10-02 11:36:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1655 transitions. [2018-10-02 11:36:43,541 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1655 transitions. Word has length 20 [2018-10-02 11:36:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:43,541 INFO L480 AbstractCegarLoop]: Abstraction has 1026 states and 1655 transitions. [2018-10-02 11:36:43,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-02 11:36:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1655 transitions. [2018-10-02 11:36:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-02 11:36:43,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:43,542 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-10-02 11:36:43,542 INFO L423 AbstractCegarLoop]: === Iteration 45 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:43,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:43,543 INFO L82 PathProgramCache]: Analyzing trace with hash -79325383, now seen corresponding path program 1 times [2018-10-02 11:36:43,543 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:43,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:43,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:43,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:43,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:43,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:43,649 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:43,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:43,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:43,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:43,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2018-10-02 11:36:43,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:36:43,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:36:43,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:36:43,769 INFO L87 Difference]: Start difference. First operand 1026 states and 1655 transitions. Second operand 13 states. [2018-10-02 11:36:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:45,929 INFO L93 Difference]: Finished difference Result 1878 states and 3019 transitions. [2018-10-02 11:36:45,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-02 11:36:45,930 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-10-02 11:36:45,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:45,931 INFO L225 Difference]: With dead ends: 1878 [2018-10-02 11:36:45,932 INFO L226 Difference]: Without dead ends: 1729 [2018-10-02 11:36:45,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=392, Invalid=1090, Unknown=0, NotChecked=0, Total=1482 [2018-10-02 11:36:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2018-10-02 11:36:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1013. [2018-10-02 11:36:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-10-02 11:36:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1646 transitions. [2018-10-02 11:36:46,213 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1646 transitions. Word has length 20 [2018-10-02 11:36:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:46,213 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 1646 transitions. [2018-10-02 11:36:46,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:36:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1646 transitions. [2018-10-02 11:36:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:36:46,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:46,214 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:46,214 INFO L423 AbstractCegarLoop]: === Iteration 46 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:46,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:46,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1614386347, now seen corresponding path program 1 times [2018-10-02 11:36:46,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:46,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:46,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:46,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:46,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:36:46,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:46,358 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:46,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:46,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:46,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:46,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-02 11:36:46,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 11:36:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 11:36:46,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:36:46,545 INFO L87 Difference]: Start difference. First operand 1013 states and 1646 transitions. Second operand 20 states. [2018-10-02 11:36:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:50,242 INFO L93 Difference]: Finished difference Result 2738 states and 4441 transitions. [2018-10-02 11:36:50,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-02 11:36:50,242 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-10-02 11:36:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:50,244 INFO L225 Difference]: With dead ends: 2738 [2018-10-02 11:36:50,244 INFO L226 Difference]: Without dead ends: 1726 [2018-10-02 11:36:50,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1197, Invalid=6813, Unknown=0, NotChecked=0, Total=8010 [2018-10-02 11:36:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2018-10-02 11:36:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1481. [2018-10-02 11:36:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-10-02 11:36:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2418 transitions. [2018-10-02 11:36:50,591 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2418 transitions. Word has length 21 [2018-10-02 11:36:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:50,592 INFO L480 AbstractCegarLoop]: Abstraction has 1481 states and 2418 transitions. [2018-10-02 11:36:50,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 11:36:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2418 transitions. [2018-10-02 11:36:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:36:50,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:50,592 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:50,593 INFO L423 AbstractCegarLoop]: === Iteration 47 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:50,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1615679213, now seen corresponding path program 1 times [2018-10-02 11:36:50,593 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:50,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:50,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:50,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:50,736 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:50,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:50,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:50,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:50,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-02 11:36:50,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:36:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:36:50,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:36:50,900 INFO L87 Difference]: Start difference. First operand 1481 states and 2418 transitions. Second operand 18 states. [2018-10-02 11:36:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:55,022 INFO L93 Difference]: Finished difference Result 2759 states and 4491 transitions. [2018-10-02 11:36:55,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-02 11:36:55,022 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-02 11:36:55,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:55,024 INFO L225 Difference]: With dead ends: 2759 [2018-10-02 11:36:55,024 INFO L226 Difference]: Without dead ends: 2757 [2018-10-02 11:36:55,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=899, Invalid=4503, Unknown=0, NotChecked=0, Total=5402 [2018-10-02 11:36:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2018-10-02 11:36:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 1886. [2018-10-02 11:36:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2018-10-02 11:36:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 3096 transitions. [2018-10-02 11:36:55,461 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 3096 transitions. Word has length 21 [2018-10-02 11:36:55,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:36:55,461 INFO L480 AbstractCegarLoop]: Abstraction has 1886 states and 3096 transitions. [2018-10-02 11:36:55,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:36:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 3096 transitions. [2018-10-02 11:36:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:36:55,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:36:55,462 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:36:55,462 INFO L423 AbstractCegarLoop]: === Iteration 48 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:36:55,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:36:55,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1336385522, now seen corresponding path program 1 times [2018-10-02 11:36:55,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:36:55,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:36:55,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:55,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:55,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:36:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:56,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:36:56,118 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:36:56,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:36:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:36:56,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:36:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:36:56,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:36:56,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-10-02 11:36:56,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:36:56,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:36:56,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:36:56,248 INFO L87 Difference]: Start difference. First operand 1886 states and 3096 transitions. Second operand 16 states. [2018-10-02 11:36:59,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:36:59,605 INFO L93 Difference]: Finished difference Result 2657 states and 4320 transitions. [2018-10-02 11:36:59,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-02 11:36:59,606 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-10-02 11:36:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:36:59,608 INFO L225 Difference]: With dead ends: 2657 [2018-10-02 11:36:59,608 INFO L226 Difference]: Without dead ends: 2655 [2018-10-02 11:36:59,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=659, Invalid=2647, Unknown=0, NotChecked=0, Total=3306 [2018-10-02 11:36:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2018-10-02 11:37:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 1726. [2018-10-02 11:37:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2018-10-02 11:37:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2827 transitions. [2018-10-02 11:37:00,071 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2827 transitions. Word has length 21 [2018-10-02 11:37:00,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:00,072 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 2827 transitions. [2018-10-02 11:37:00,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:37:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2827 transitions. [2018-10-02 11:37:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:37:00,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:00,073 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:00,073 INFO L423 AbstractCegarLoop]: === Iteration 49 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:00,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:00,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1327798635, now seen corresponding path program 1 times [2018-10-02 11:37:00,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:00,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:00,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:00,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:00,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:00,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:00,176 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:00,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:00,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:00,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:00,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-10-02 11:37:00,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:37:00,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:37:00,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:37:00,345 INFO L87 Difference]: Start difference. First operand 1726 states and 2827 transitions. Second operand 17 states. [2018-10-02 11:37:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:04,193 INFO L93 Difference]: Finished difference Result 2434 states and 3937 transitions. [2018-10-02 11:37:04,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-02 11:37:04,193 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2018-10-02 11:37:04,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:04,196 INFO L225 Difference]: With dead ends: 2434 [2018-10-02 11:37:04,196 INFO L226 Difference]: Without dead ends: 2432 [2018-10-02 11:37:04,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=632, Invalid=3150, Unknown=0, NotChecked=0, Total=3782 [2018-10-02 11:37:04,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2018-10-02 11:37:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 1872. [2018-10-02 11:37:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1872 states. [2018-10-02 11:37:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3060 transitions. [2018-10-02 11:37:04,695 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3060 transitions. Word has length 21 [2018-10-02 11:37:04,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:04,695 INFO L480 AbstractCegarLoop]: Abstraction has 1872 states and 3060 transitions. [2018-10-02 11:37:04,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:37:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3060 transitions. [2018-10-02 11:37:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:37:04,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:04,696 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:04,696 INFO L423 AbstractCegarLoop]: === Iteration 50 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:04,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:04,696 INFO L82 PathProgramCache]: Analyzing trace with hash 133649308, now seen corresponding path program 2 times [2018-10-02 11:37:04,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:04,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:04,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:04,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:04,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:04,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:04,851 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:04,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:37:04,872 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:37:04,872 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:37:04,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:37:04,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:04,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2018-10-02 11:37:04,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:37:04,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:37:04,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:37:04,985 INFO L87 Difference]: Start difference. First operand 1872 states and 3060 transitions. Second operand 16 states. [2018-10-02 11:37:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:07,854 INFO L93 Difference]: Finished difference Result 2526 states and 4072 transitions. [2018-10-02 11:37:07,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-02 11:37:07,854 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-10-02 11:37:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:07,857 INFO L225 Difference]: With dead ends: 2526 [2018-10-02 11:37:07,857 INFO L226 Difference]: Without dead ends: 2334 [2018-10-02 11:37:07,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=543, Invalid=2763, Unknown=0, NotChecked=0, Total=3306 [2018-10-02 11:37:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2018-10-02 11:37:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2001. [2018-10-02 11:37:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2018-10-02 11:37:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 3219 transitions. [2018-10-02 11:37:08,385 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 3219 transitions. Word has length 21 [2018-10-02 11:37:08,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:08,385 INFO L480 AbstractCegarLoop]: Abstraction has 2001 states and 3219 transitions. [2018-10-02 11:37:08,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:37:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 3219 transitions. [2018-10-02 11:37:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:37:08,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:08,386 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:08,387 INFO L423 AbstractCegarLoop]: === Iteration 51 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:08,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:08,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1958649716, now seen corresponding path program 1 times [2018-10-02 11:37:08,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:08,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:08,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:08,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:37:08,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:08,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:08,493 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:08,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:08,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:08,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:08,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-10-02 11:37:08,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:37:08,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:37:08,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:37:08,985 INFO L87 Difference]: Start difference. First operand 2001 states and 3219 transitions. Second operand 18 states. [2018-10-02 11:37:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:14,575 INFO L93 Difference]: Finished difference Result 2607 states and 4131 transitions. [2018-10-02 11:37:14,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-02 11:37:14,575 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-02 11:37:14,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:14,578 INFO L225 Difference]: With dead ends: 2607 [2018-10-02 11:37:14,578 INFO L226 Difference]: Without dead ends: 2605 [2018-10-02 11:37:14,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1789 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1198, Invalid=4808, Unknown=0, NotChecked=0, Total=6006 [2018-10-02 11:37:14,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2018-10-02 11:37:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 1559. [2018-10-02 11:37:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2018-10-02 11:37:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2486 transitions. [2018-10-02 11:37:15,004 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2486 transitions. Word has length 21 [2018-10-02 11:37:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:15,005 INFO L480 AbstractCegarLoop]: Abstraction has 1559 states and 2486 transitions. [2018-10-02 11:37:15,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:37:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2486 transitions. [2018-10-02 11:37:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:37:15,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:15,006 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:15,006 INFO L423 AbstractCegarLoop]: === Iteration 52 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:15,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:15,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1950062829, now seen corresponding path program 1 times [2018-10-02 11:37:15,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:15,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:15,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:15,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:15,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:15,198 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:15,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:15,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:15,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:15,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-10-02 11:37:15,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:37:15,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:37:15,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:37:15,371 INFO L87 Difference]: Start difference. First operand 1559 states and 2486 transitions. Second operand 18 states. [2018-10-02 11:37:20,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:20,572 INFO L93 Difference]: Finished difference Result 2107 states and 3306 transitions. [2018-10-02 11:37:20,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-02 11:37:20,572 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-02 11:37:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:20,574 INFO L225 Difference]: With dead ends: 2107 [2018-10-02 11:37:20,574 INFO L226 Difference]: Without dead ends: 2105 [2018-10-02 11:37:20,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1282, Invalid=6200, Unknown=0, NotChecked=0, Total=7482 [2018-10-02 11:37:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2018-10-02 11:37:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1432. [2018-10-02 11:37:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2018-10-02 11:37:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2283 transitions. [2018-10-02 11:37:20,998 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2283 transitions. Word has length 21 [2018-10-02 11:37:20,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:20,998 INFO L480 AbstractCegarLoop]: Abstraction has 1432 states and 2283 transitions. [2018-10-02 11:37:20,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:37:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2283 transitions. [2018-10-02 11:37:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:37:20,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:20,999 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:20,999 INFO L423 AbstractCegarLoop]: === Iteration 53 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:21,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:21,000 INFO L82 PathProgramCache]: Analyzing trace with hash 830618954, now seen corresponding path program 2 times [2018-10-02 11:37:21,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:21,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:21,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:21,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:21,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:21,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:21,108 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:21,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:37:21,123 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:37:21,124 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:37:21,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:37:21,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:21,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-10-02 11:37:21,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:37:21,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:37:21,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:37:21,221 INFO L87 Difference]: Start difference. First operand 1432 states and 2283 transitions. Second operand 15 states. [2018-10-02 11:37:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:24,240 INFO L93 Difference]: Finished difference Result 1886 states and 2991 transitions. [2018-10-02 11:37:24,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-02 11:37:24,241 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-10-02 11:37:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:24,243 INFO L225 Difference]: With dead ends: 1886 [2018-10-02 11:37:24,243 INFO L226 Difference]: Without dead ends: 1884 [2018-10-02 11:37:24,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=644, Invalid=3138, Unknown=0, NotChecked=0, Total=3782 [2018-10-02 11:37:24,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2018-10-02 11:37:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1404. [2018-10-02 11:37:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2018-10-02 11:37:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2237 transitions. [2018-10-02 11:37:24,647 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2237 transitions. Word has length 21 [2018-10-02 11:37:24,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:24,647 INFO L480 AbstractCegarLoop]: Abstraction has 1404 states and 2237 transitions. [2018-10-02 11:37:24,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:37:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2237 transitions. [2018-10-02 11:37:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:37:24,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:24,648 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:24,648 INFO L423 AbstractCegarLoop]: === Iteration 54 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:24,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:24,649 INFO L82 PathProgramCache]: Analyzing trace with hash 822030785, now seen corresponding path program 1 times [2018-10-02 11:37:24,649 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:24,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:24,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:24,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:37:24,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:37:24,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:24,789 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:24,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:24,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:25,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:25,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-10-02 11:37:25,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-02 11:37:25,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-02 11:37:25,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-10-02 11:37:25,036 INFO L87 Difference]: Start difference. First operand 1404 states and 2237 transitions. Second operand 20 states. [2018-10-02 11:37:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:29,986 INFO L93 Difference]: Finished difference Result 2676 states and 4218 transitions. [2018-10-02 11:37:29,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-02 11:37:29,986 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2018-10-02 11:37:29,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:29,988 INFO L225 Difference]: With dead ends: 2676 [2018-10-02 11:37:29,988 INFO L226 Difference]: Without dead ends: 1637 [2018-10-02 11:37:29,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1444, Invalid=7486, Unknown=0, NotChecked=0, Total=8930 [2018-10-02 11:37:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-10-02 11:37:30,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1391. [2018-10-02 11:37:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1391 states. [2018-10-02 11:37:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 2209 transitions. [2018-10-02 11:37:30,463 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 2209 transitions. Word has length 21 [2018-10-02 11:37:30,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:30,464 INFO L480 AbstractCegarLoop]: Abstraction has 1391 states and 2209 transitions. [2018-10-02 11:37:30,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-02 11:37:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 2209 transitions. [2018-10-02 11:37:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:37:30,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:30,465 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:30,465 INFO L423 AbstractCegarLoop]: === Iteration 55 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:30,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:30,465 INFO L82 PathProgramCache]: Analyzing trace with hash 822032067, now seen corresponding path program 2 times [2018-10-02 11:37:30,465 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:30,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:30,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:30,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:30,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:30,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:30,580 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:30,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:37:30,593 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:37:30,594 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:37:30,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:30,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:37:30,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:30,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 17 [2018-10-02 11:37:30,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-02 11:37:30,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-02 11:37:30,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-10-02 11:37:30,747 INFO L87 Difference]: Start difference. First operand 1391 states and 2209 transitions. Second operand 18 states. [2018-10-02 11:37:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:35,211 INFO L93 Difference]: Finished difference Result 2169 states and 3390 transitions. [2018-10-02 11:37:35,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-02 11:37:35,211 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-10-02 11:37:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:35,213 INFO L225 Difference]: With dead ends: 2169 [2018-10-02 11:37:35,213 INFO L226 Difference]: Without dead ends: 2167 [2018-10-02 11:37:35,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2313 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1116, Invalid=5856, Unknown=0, NotChecked=0, Total=6972 [2018-10-02 11:37:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2018-10-02 11:37:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1375. [2018-10-02 11:37:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2018-10-02 11:37:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2186 transitions. [2018-10-02 11:37:35,694 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2186 transitions. Word has length 21 [2018-10-02 11:37:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:35,694 INFO L480 AbstractCegarLoop]: Abstraction has 1375 states and 2186 transitions. [2018-10-02 11:37:35,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-02 11:37:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2186 transitions. [2018-10-02 11:37:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:37:35,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:35,695 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:35,695 INFO L423 AbstractCegarLoop]: === Iteration 56 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:35,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:35,695 INFO L82 PathProgramCache]: Analyzing trace with hash -97849607, now seen corresponding path program 1 times [2018-10-02 11:37:35,695 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:35,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:35,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:35,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:37:35,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:37:35,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:35,810 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:35,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:35,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:36,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:36,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-02 11:37:36,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 11:37:36,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 11:37:36,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:37:36,005 INFO L87 Difference]: Start difference. First operand 1375 states and 2186 transitions. Second operand 19 states. [2018-10-02 11:37:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:39,271 INFO L93 Difference]: Finished difference Result 3096 states and 4913 transitions. [2018-10-02 11:37:39,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-02 11:37:39,272 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-10-02 11:37:39,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:39,273 INFO L225 Difference]: With dead ends: 3096 [2018-10-02 11:37:39,273 INFO L226 Difference]: Without dead ends: 1770 [2018-10-02 11:37:39,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=571, Invalid=2735, Unknown=0, NotChecked=0, Total=3306 [2018-10-02 11:37:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2018-10-02 11:37:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1381. [2018-10-02 11:37:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2018-10-02 11:37:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2193 transitions. [2018-10-02 11:37:39,811 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2193 transitions. Word has length 21 [2018-10-02 11:37:39,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:39,811 INFO L480 AbstractCegarLoop]: Abstraction has 1381 states and 2193 transitions. [2018-10-02 11:37:39,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 11:37:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2193 transitions. [2018-10-02 11:37:39,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:37:39,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:39,812 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:39,812 INFO L423 AbstractCegarLoop]: === Iteration 57 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:39,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:39,813 INFO L82 PathProgramCache]: Analyzing trace with hash 437466707, now seen corresponding path program 1 times [2018-10-02 11:37:39,813 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:39,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:39,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:39,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:39,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:39,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:39,902 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:39,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:39,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:37:40,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:40,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-10-02 11:37:40,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:37:40,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:37:40,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:37:40,006 INFO L87 Difference]: Start difference. First operand 1381 states and 2193 transitions. Second operand 13 states. [2018-10-02 11:37:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:42,067 INFO L93 Difference]: Finished difference Result 1858 states and 2972 transitions. [2018-10-02 11:37:42,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 11:37:42,067 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-10-02 11:37:42,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:42,069 INFO L225 Difference]: With dead ends: 1858 [2018-10-02 11:37:42,069 INFO L226 Difference]: Without dead ends: 1856 [2018-10-02 11:37:42,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2018-10-02 11:37:42,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2018-10-02 11:37:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1551. [2018-10-02 11:37:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2018-10-02 11:37:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2486 transitions. [2018-10-02 11:37:42,605 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2486 transitions. Word has length 21 [2018-10-02 11:37:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:42,606 INFO L480 AbstractCegarLoop]: Abstraction has 1551 states and 2486 transitions. [2018-10-02 11:37:42,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:37:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2486 transitions. [2018-10-02 11:37:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:37:42,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:42,607 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:42,607 INFO L423 AbstractCegarLoop]: === Iteration 58 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:42,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2130898623, now seen corresponding path program 2 times [2018-10-02 11:37:42,607 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:42,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:42,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:42,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:42,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:37:42,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:42,735 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:42,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:37:42,749 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:37:42,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:37:42,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:37:42,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:42,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-10-02 11:37:42,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-02 11:37:42,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-02 11:37:42,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-10-02 11:37:42,921 INFO L87 Difference]: Start difference. First operand 1551 states and 2486 transitions. Second operand 19 states. [2018-10-02 11:37:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:46,704 INFO L93 Difference]: Finished difference Result 1901 states and 3071 transitions. [2018-10-02 11:37:46,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-02 11:37:46,704 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-10-02 11:37:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:46,706 INFO L225 Difference]: With dead ends: 1901 [2018-10-02 11:37:46,706 INFO L226 Difference]: Without dead ends: 1899 [2018-10-02 11:37:46,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=509, Invalid=3031, Unknown=0, NotChecked=0, Total=3540 [2018-10-02 11:37:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2018-10-02 11:37:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1583. [2018-10-02 11:37:47,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2018-10-02 11:37:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2523 transitions. [2018-10-02 11:37:47,257 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2523 transitions. Word has length 21 [2018-10-02 11:37:47,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:47,257 INFO L480 AbstractCegarLoop]: Abstraction has 1583 states and 2523 transitions. [2018-10-02 11:37:47,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-02 11:37:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2523 transitions. [2018-10-02 11:37:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:37:47,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:47,258 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:47,259 INFO L423 AbstractCegarLoop]: === Iteration 59 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:47,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:47,259 INFO L82 PathProgramCache]: Analyzing trace with hash -2139486792, now seen corresponding path program 1 times [2018-10-02 11:37:47,259 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:47,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:47,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:47,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:37:47,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:47,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:47,380 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:47,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:47,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:37:47,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:47,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-10-02 11:37:47,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-02 11:37:47,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-02 11:37:47,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-10-02 11:37:47,485 INFO L87 Difference]: Start difference. First operand 1583 states and 2523 transitions. Second operand 13 states. [2018-10-02 11:37:50,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:50,244 INFO L93 Difference]: Finished difference Result 2207 states and 3564 transitions. [2018-10-02 11:37:50,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-02 11:37:50,244 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-10-02 11:37:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:50,246 INFO L225 Difference]: With dead ends: 2207 [2018-10-02 11:37:50,247 INFO L226 Difference]: Without dead ends: 2205 [2018-10-02 11:37:50,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2018-10-02 11:37:50,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-10-02 11:37:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 1741. [2018-10-02 11:37:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2018-10-02 11:37:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2777 transitions. [2018-10-02 11:37:50,868 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2777 transitions. Word has length 21 [2018-10-02 11:37:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:50,869 INFO L480 AbstractCegarLoop]: Abstraction has 1741 states and 2777 transitions. [2018-10-02 11:37:50,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-02 11:37:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2777 transitions. [2018-10-02 11:37:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:37:50,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:50,870 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:50,870 INFO L423 AbstractCegarLoop]: === Iteration 60 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:50,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:50,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1673653662, now seen corresponding path program 2 times [2018-10-02 11:37:50,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:50,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:50,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:50,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:37:50,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:51,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:51,329 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:51,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:37:51,351 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:37:51,352 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:37:51,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:37:51,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:51,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-10-02 11:37:51,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:37:51,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:37:51,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:37:51,481 INFO L87 Difference]: Start difference. First operand 1741 states and 2777 transitions. Second operand 15 states. [2018-10-02 11:37:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:55,724 INFO L93 Difference]: Finished difference Result 3370 states and 5507 transitions. [2018-10-02 11:37:55,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-02 11:37:55,724 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-10-02 11:37:55,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:55,727 INFO L225 Difference]: With dead ends: 3370 [2018-10-02 11:37:55,727 INFO L226 Difference]: Without dead ends: 3368 [2018-10-02 11:37:55,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=719, Invalid=2941, Unknown=0, NotChecked=0, Total=3660 [2018-10-02 11:37:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2018-10-02 11:37:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 2044. [2018-10-02 11:37:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2018-10-02 11:37:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3284 transitions. [2018-10-02 11:37:56,377 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3284 transitions. Word has length 21 [2018-10-02 11:37:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:37:56,377 INFO L480 AbstractCegarLoop]: Abstraction has 2044 states and 3284 transitions. [2018-10-02 11:37:56,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:37:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3284 transitions. [2018-10-02 11:37:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-02 11:37:56,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:37:56,378 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:37:56,378 INFO L423 AbstractCegarLoop]: === Iteration 61 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:37:56,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:37:56,378 INFO L82 PathProgramCache]: Analyzing trace with hash 212422270, now seen corresponding path program 2 times [2018-10-02 11:37:56,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:37:56,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:37:56,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:56,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:37:56,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:37:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:37:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-02 11:37:56,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:37:56,432 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:37:56,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:37:56,449 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:37:56,449 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:37:56,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:37:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-02 11:37:56,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:37:56,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-10-02 11:37:56,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-02 11:37:56,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-02 11:37:56,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-02 11:37:56,539 INFO L87 Difference]: Start difference. First operand 2044 states and 3284 transitions. Second operand 12 states. [2018-10-02 11:37:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:37:59,204 INFO L93 Difference]: Finished difference Result 5216 states and 8321 transitions. [2018-10-02 11:37:59,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-02 11:37:59,205 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-10-02 11:37:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:37:59,208 INFO L225 Difference]: With dead ends: 5216 [2018-10-02 11:37:59,208 INFO L226 Difference]: Without dead ends: 3229 [2018-10-02 11:37:59,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=517, Invalid=1835, Unknown=0, NotChecked=0, Total=2352 [2018-10-02 11:37:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2018-10-02 11:38:00,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 2942. [2018-10-02 11:38:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2942 states. [2018-10-02 11:38:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2942 states and 4622 transitions. [2018-10-02 11:38:00,223 INFO L78 Accepts]: Start accepts. Automaton has 2942 states and 4622 transitions. Word has length 21 [2018-10-02 11:38:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:00,223 INFO L480 AbstractCegarLoop]: Abstraction has 2942 states and 4622 transitions. [2018-10-02 11:38:00,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-02 11:38:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 4622 transitions. [2018-10-02 11:38:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-02 11:38:00,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:00,225 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:00,225 INFO L423 AbstractCegarLoop]: === Iteration 62 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:00,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:00,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1977173104, now seen corresponding path program 1 times [2018-10-02 11:38:00,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:00,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:00,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:00,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:38:00,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:00,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:00,375 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:00,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:00,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:00,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:00,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-10-02 11:38:00,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-02 11:38:00,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-02 11:38:00,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:38:00,581 INFO L87 Difference]: Start difference. First operand 2942 states and 4622 transitions. Second operand 22 states. [2018-10-02 11:38:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:09,202 INFO L93 Difference]: Finished difference Result 4706 states and 7339 transitions. [2018-10-02 11:38:09,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-02 11:38:09,203 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-10-02 11:38:09,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:09,207 INFO L225 Difference]: With dead ends: 4706 [2018-10-02 11:38:09,207 INFO L226 Difference]: Without dead ends: 4704 [2018-10-02 11:38:09,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5067 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2033, Invalid=12009, Unknown=0, NotChecked=0, Total=14042 [2018-10-02 11:38:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2018-10-02 11:38:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 3514. [2018-10-02 11:38:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-10-02 11:38:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 5500 transitions. [2018-10-02 11:38:10,723 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 5500 transitions. Word has length 23 [2018-10-02 11:38:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:10,723 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 5500 transitions. [2018-10-02 11:38:10,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-02 11:38:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 5500 transitions. [2018-10-02 11:38:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-02 11:38:10,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:10,725 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:10,725 INFO L423 AbstractCegarLoop]: === Iteration 63 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:10,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:10,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1266805704, now seen corresponding path program 1 times [2018-10-02 11:38:10,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:10,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:10,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:10,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:10,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:10,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:10,866 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:10,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:10,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:11,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:11,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-10-02 11:38:11,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-02 11:38:11,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-02 11:38:11,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-10-02 11:38:11,044 INFO L87 Difference]: Start difference. First operand 3514 states and 5500 transitions. Second operand 21 states. [2018-10-02 11:38:18,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:18,030 INFO L93 Difference]: Finished difference Result 4911 states and 7636 transitions. [2018-10-02 11:38:18,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-02 11:38:18,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2018-10-02 11:38:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:18,035 INFO L225 Difference]: With dead ends: 4911 [2018-10-02 11:38:18,035 INFO L226 Difference]: Without dead ends: 4904 [2018-10-02 11:38:18,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=802, Invalid=3890, Unknown=0, NotChecked=0, Total=4692 [2018-10-02 11:38:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2018-10-02 11:38:19,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 2925. [2018-10-02 11:38:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2018-10-02 11:38:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 4501 transitions. [2018-10-02 11:38:19,741 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 4501 transitions. Word has length 23 [2018-10-02 11:38:19,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:19,742 INFO L480 AbstractCegarLoop]: Abstraction has 2925 states and 4501 transitions. [2018-10-02 11:38:19,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-02 11:38:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 4501 transitions. [2018-10-02 11:38:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-02 11:38:19,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:19,743 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:19,743 INFO L423 AbstractCegarLoop]: === Iteration 64 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:19,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:19,743 INFO L82 PathProgramCache]: Analyzing trace with hash -407447728, now seen corresponding path program 1 times [2018-10-02 11:38:19,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:19,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:19,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:19,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:19,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:19,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:19,921 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:19,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:19,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:20,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:20,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2018-10-02 11:38:20,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-02 11:38:20,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-02 11:38:20,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-10-02 11:38:20,176 INFO L87 Difference]: Start difference. First operand 2925 states and 4501 transitions. Second operand 22 states. [2018-10-02 11:38:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:25,498 INFO L93 Difference]: Finished difference Result 3641 states and 5640 transitions. [2018-10-02 11:38:25,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-02 11:38:25,499 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-10-02 11:38:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:25,502 INFO L225 Difference]: With dead ends: 3641 [2018-10-02 11:38:25,502 INFO L226 Difference]: Without dead ends: 3634 [2018-10-02 11:38:25,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=768, Invalid=3788, Unknown=0, NotChecked=0, Total=4556 [2018-10-02 11:38:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2018-10-02 11:38:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 2472. [2018-10-02 11:38:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2018-10-02 11:38:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3826 transitions. [2018-10-02 11:38:26,770 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3826 transitions. Word has length 23 [2018-10-02 11:38:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:26,771 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3826 transitions. [2018-10-02 11:38:26,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-02 11:38:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3826 transitions. [2018-10-02 11:38:26,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 11:38:26,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:26,772 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:26,773 INFO L423 AbstractCegarLoop]: === Iteration 65 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:26,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:26,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1545525427, now seen corresponding path program 1 times [2018-10-02 11:38:26,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:26,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:26,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:26,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:26,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:26,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:26,915 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:26,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:26,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:27,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:27,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2018-10-02 11:38:27,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:38:27,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:38:27,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:38:27,054 INFO L87 Difference]: Start difference. First operand 2472 states and 3826 transitions. Second operand 15 states. [2018-10-02 11:38:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:30,893 INFO L93 Difference]: Finished difference Result 3028 states and 4680 transitions. [2018-10-02 11:38:30,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-02 11:38:30,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-10-02 11:38:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:30,896 INFO L225 Difference]: With dead ends: 3028 [2018-10-02 11:38:30,896 INFO L226 Difference]: Without dead ends: 3026 [2018-10-02 11:38:30,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=1459, Unknown=0, NotChecked=0, Total=1722 [2018-10-02 11:38:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2018-10-02 11:38:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 2443. [2018-10-02 11:38:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2443 states. [2018-10-02 11:38:32,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3774 transitions. [2018-10-02 11:38:32,233 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3774 transitions. Word has length 24 [2018-10-02 11:38:32,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:32,234 INFO L480 AbstractCegarLoop]: Abstraction has 2443 states and 3774 transitions. [2018-10-02 11:38:32,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:38:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3774 transitions. [2018-10-02 11:38:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 11:38:32,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:32,235 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-10-02 11:38:32,235 INFO L423 AbstractCegarLoop]: === Iteration 66 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:32,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:32,235 INFO L82 PathProgramCache]: Analyzing trace with hash -136248690, now seen corresponding path program 3 times [2018-10-02 11:38:32,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:32,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:32,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:32,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:32,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:38:32,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:32,458 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:32,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-02 11:38:32,474 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-02 11:38:32,474 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:38:32,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-02 11:38:32,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:32,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-10-02 11:38:32,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-02 11:38:32,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-02 11:38:32,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-02 11:38:32,570 INFO L87 Difference]: Start difference. First operand 2443 states and 3774 transitions. Second operand 15 states. [2018-10-02 11:38:35,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:35,544 INFO L93 Difference]: Finished difference Result 2592 states and 4005 transitions. [2018-10-02 11:38:35,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-02 11:38:35,545 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-10-02 11:38:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:35,547 INFO L225 Difference]: With dead ends: 2592 [2018-10-02 11:38:35,547 INFO L226 Difference]: Without dead ends: 2590 [2018-10-02 11:38:35,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=1087, Unknown=0, NotChecked=0, Total=1406 [2018-10-02 11:38:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2018-10-02 11:38:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2279. [2018-10-02 11:38:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2279 states. [2018-10-02 11:38:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3506 transitions. [2018-10-02 11:38:36,903 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3506 transitions. Word has length 24 [2018-10-02 11:38:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:36,903 INFO L480 AbstractCegarLoop]: Abstraction has 2279 states and 3506 transitions. [2018-10-02 11:38:36,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-02 11:38:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3506 transitions. [2018-10-02 11:38:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-02 11:38:36,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:36,904 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:36,904 INFO L423 AbstractCegarLoop]: === Iteration 67 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:36,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:36,904 INFO L82 PathProgramCache]: Analyzing trace with hash -518454402, now seen corresponding path program 1 times [2018-10-02 11:38:36,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:36,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:36,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:36,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:38:36,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-02 11:38:37,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:37,094 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:37,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:37,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:37,185 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:37,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:37,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2018-10-02 11:38:37,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:38:37,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:38:37,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:38:37,206 INFO L87 Difference]: Start difference. First operand 2279 states and 3506 transitions. Second operand 16 states. [2018-10-02 11:38:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:40,403 INFO L93 Difference]: Finished difference Result 2414 states and 3709 transitions. [2018-10-02 11:38:40,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 11:38:40,403 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-10-02 11:38:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:40,405 INFO L225 Difference]: With dead ends: 2414 [2018-10-02 11:38:40,405 INFO L226 Difference]: Without dead ends: 2412 [2018-10-02 11:38:40,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=1404, Unknown=0, NotChecked=0, Total=1640 [2018-10-02 11:38:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2018-10-02 11:38:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2274. [2018-10-02 11:38:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2274 states. [2018-10-02 11:38:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3496 transitions. [2018-10-02 11:38:41,740 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3496 transitions. Word has length 24 [2018-10-02 11:38:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:41,741 INFO L480 AbstractCegarLoop]: Abstraction has 2274 states and 3496 transitions. [2018-10-02 11:38:41,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:38:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3496 transitions. [2018-10-02 11:38:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 11:38:41,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:41,742 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:41,743 INFO L423 AbstractCegarLoop]: === Iteration 68 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:41,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:41,743 INFO L82 PathProgramCache]: Analyzing trace with hash -916627202, now seen corresponding path program 1 times [2018-10-02 11:38:41,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:41,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:41,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:42,040 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:42,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:42,041 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:42,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:42,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-02 11:38:42,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:42,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2018-10-02 11:38:42,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-02 11:38:42,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-02 11:38:42,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-10-02 11:38:42,151 INFO L87 Difference]: Start difference. First operand 2274 states and 3496 transitions. Second operand 16 states. [2018-10-02 11:38:45,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:45,774 INFO L93 Difference]: Finished difference Result 2734 states and 4210 transitions. [2018-10-02 11:38:45,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-02 11:38:45,774 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-10-02 11:38:45,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:45,776 INFO L225 Difference]: With dead ends: 2734 [2018-10-02 11:38:45,776 INFO L226 Difference]: Without dead ends: 2732 [2018-10-02 11:38:45,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=1497, Unknown=0, NotChecked=0, Total=1806 [2018-10-02 11:38:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2018-10-02 11:38:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2357. [2018-10-02 11:38:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2357 states. [2018-10-02 11:38:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3634 transitions. [2018-10-02 11:38:47,155 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3634 transitions. Word has length 29 [2018-10-02 11:38:47,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:47,155 INFO L480 AbstractCegarLoop]: Abstraction has 2357 states and 3634 transitions. [2018-10-02 11:38:47,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-02 11:38:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3634 transitions. [2018-10-02 11:38:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 11:38:47,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:47,156 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:47,157 INFO L423 AbstractCegarLoop]: === Iteration 69 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:47,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:47,157 INFO L82 PathProgramCache]: Analyzing trace with hash 524508242, now seen corresponding path program 1 times [2018-10-02 11:38:47,157 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:47,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:47,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:47,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:47,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:47,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:47,323 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:47,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:47,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:47,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:47,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2018-10-02 11:38:47,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:38:47,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:38:47,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:38:47,485 INFO L87 Difference]: Start difference. First operand 2357 states and 3634 transitions. Second operand 17 states. [2018-10-02 11:38:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:38:56,774 INFO L93 Difference]: Finished difference Result 5146 states and 8058 transitions. [2018-10-02 11:38:56,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-02 11:38:56,774 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-10-02 11:38:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:38:56,777 INFO L225 Difference]: With dead ends: 5146 [2018-10-02 11:38:56,777 INFO L226 Difference]: Without dead ends: 5144 [2018-10-02 11:38:56,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3126 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1591, Invalid=7915, Unknown=0, NotChecked=0, Total=9506 [2018-10-02 11:38:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5144 states. [2018-10-02 11:38:58,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5144 to 3465. [2018-10-02 11:38:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3465 states. [2018-10-02 11:38:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 5438 transitions. [2018-10-02 11:38:58,712 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 5438 transitions. Word has length 29 [2018-10-02 11:38:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:38:58,712 INFO L480 AbstractCegarLoop]: Abstraction has 3465 states and 5438 transitions. [2018-10-02 11:38:58,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:38:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 5438 transitions. [2018-10-02 11:38:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-02 11:38:58,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:38:58,713 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-02 11:38:58,714 INFO L423 AbstractCegarLoop]: === Iteration 70 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:38:58,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:38:58,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1958472419, now seen corresponding path program 4 times [2018-10-02 11:38:58,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:38:58,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:38:58,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:58,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:38:58,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:38:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:38:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:58,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:38:58,983 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:38:58,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-02 11:38:59,002 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-02 11:38:59,003 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:38:59,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:38:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:38:59,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:38:59,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2018-10-02 11:38:59,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-02 11:38:59,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-02 11:38:59,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-02 11:38:59,225 INFO L87 Difference]: Start difference. First operand 3465 states and 5438 transitions. Second operand 17 states. [2018-10-02 11:39:08,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:08,212 INFO L93 Difference]: Finished difference Result 4974 states and 7795 transitions. [2018-10-02 11:39:08,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-02 11:39:08,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-10-02 11:39:08,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:08,218 INFO L225 Difference]: With dead ends: 4974 [2018-10-02 11:39:08,218 INFO L226 Difference]: Without dead ends: 4972 [2018-10-02 11:39:08,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1978 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1292, Invalid=5350, Unknown=0, NotChecked=0, Total=6642 [2018-10-02 11:39:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2018-10-02 11:39:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 3050. [2018-10-02 11:39:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3050 states. [2018-10-02 11:39:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 4722 transitions. [2018-10-02 11:39:10,135 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 4722 transitions. Word has length 29 [2018-10-02 11:39:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:10,135 INFO L480 AbstractCegarLoop]: Abstraction has 3050 states and 4722 transitions. [2018-10-02 11:39:10,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-02 11:39:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 4722 transitions. [2018-10-02 11:39:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-02 11:39:10,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:10,137 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:39:10,137 INFO L423 AbstractCegarLoop]: === Iteration 71 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:10,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:10,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1748672885, now seen corresponding path program 1 times [2018-10-02 11:39:10,138 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:10,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:10,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:10,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-02 11:39:10,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:39:10,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:10,330 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:10,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:10,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-02 11:39:10,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:10,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2018-10-02 11:39:10,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-02 11:39:10,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-02 11:39:10,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-10-02 11:39:10,565 INFO L87 Difference]: Start difference. First operand 3050 states and 4722 transitions. Second operand 24 states. [2018-10-02 11:39:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:39:31,758 INFO L93 Difference]: Finished difference Result 8298 states and 13026 transitions. [2018-10-02 11:39:31,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-02 11:39:31,758 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-10-02 11:39:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:39:31,764 INFO L225 Difference]: With dead ends: 8298 [2018-10-02 11:39:31,764 INFO L226 Difference]: Without dead ends: 8296 [2018-10-02 11:39:31,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18877 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=5438, Invalid=41868, Unknown=0, NotChecked=0, Total=47306 [2018-10-02 11:39:31,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8296 states. [2018-10-02 11:39:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8296 to 5309. [2018-10-02 11:39:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5309 states. [2018-10-02 11:39:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 8285 transitions. [2018-10-02 11:39:34,935 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 8285 transitions. Word has length 31 [2018-10-02 11:39:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:39:34,936 INFO L480 AbstractCegarLoop]: Abstraction has 5309 states and 8285 transitions. [2018-10-02 11:39:34,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-02 11:39:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 8285 transitions. [2018-10-02 11:39:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-02 11:39:34,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:39:34,938 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-02 11:39:34,938 INFO L423 AbstractCegarLoop]: === Iteration 72 === [productErr1ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:39:34,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:39:34,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2080043466, now seen corresponding path program 2 times [2018-10-02 11:39:34,938 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:39:34,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:39:34,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:34,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:39:34,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:39:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:39:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-02 11:39:35,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:39:35,094 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:39:35,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-02 11:39:35,114 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-02 11:39:35,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-02 11:39:35,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:39:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-02 11:39:35,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:39:35,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 25 [2018-10-02 11:39:35,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-02 11:39:35,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-02 11:39:35,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-10-02 11:39:35,314 INFO L87 Difference]: Start difference. First operand 5309 states and 8285 transitions. Second operand 25 states. Received shutdown request... [2018-10-02 11:39:38,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-02 11:39:38,834 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-02 11:39:38,840 WARN L205 ceAbstractionStarter]: Timeout [2018-10-02 11:39:38,840 INFO L202 PluginConnector]: Adding new model threadpooling_product.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:39:38 BoogieIcfgContainer [2018-10-02 11:39:38,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:39:38,841 INFO L168 Benchmark]: Toolchain (without parser) took 254875.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -330.3 MB). Peak memory consumption was 447.3 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:38,842 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:38,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:38,842 INFO L168 Benchmark]: Boogie Preprocessor took 27.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-02 11:39:38,843 INFO L168 Benchmark]: RCFGBuilder took 694.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:38,843 INFO L168 Benchmark]: TraceAbstraction took 254102.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -351.4 MB). Peak memory consumption was 426.1 MB. Max. memory is 7.1 GB. [2018-10-02 11:39:38,845 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 694.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254102.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -351.4 MB). Peak memory consumption was 426.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 74). Cancelled while BasicCegarLoop was constructing difference of abstraction (5309states) and FLOYD_HOARE automaton (currently 41 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (638 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (5309states) and FLOYD_HOARE automaton (currently 41 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (638 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 94). Cancelled while BasicCegarLoop was constructing difference of abstraction (5309states) and FLOYD_HOARE automaton (currently 41 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (638 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 85). Cancelled while BasicCegarLoop was constructing difference of abstraction (5309states) and FLOYD_HOARE automaton (currently 41 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (638 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 4 error locations. TIMEOUT Result, 254.0s OverallTime, 72 OverallIterations, 6 TraceHistogramMax, 197.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2716 SDtfs, 14129 SDslu, 9800 SDs, 0 SdLazy, 80962 SolverSat, 7716 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4083 GetRequests, 811 SyntacticMatches, 22 SemanticMatches, 3250 ConstructedPredicates, 0 IntricatePredicates, 11 DeprecatedPredicates, 68774 ImplicationChecksByTransitivity, 83.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5309occurred in iteration=71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 31.8s AutomataMinimizationTime, 71 MinimizatonAttempts, 29941 StatesRemovedByMinimization, 71 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 2363 NumberOfCodeBlocks, 2357 NumberOfCodeBlocksAsserted, 147 NumberOfCheckSat, 2226 ConstructedInterpolants, 174 QuantifiedInterpolants, 288370 SizeOfPredicates, 305 NumberOfNonLiveVariables, 3230 ConjunctsInSsa, 647 ConjunctsInUnsatCore, 137 InterpolantComputations, 14 PerfectInterpolantSequences, 285/1410 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-02_11-39-38-854.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-02_11-39-38-854.csv Completed graceful shutdown