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_WithProcedures.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:14:16,703 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:14:16,705 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:14:16,716 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:14:16,717 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:14:16,718 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:14:16,719 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:14:16,721 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:14:16,723 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:14:16,724 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:14:16,724 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:14:16,725 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:14:16,726 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:14:16,727 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:14:16,728 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:14:16,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:14:16,729 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:14:16,731 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:14:16,733 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:14:16,735 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:14:16,736 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:14:16,737 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:14:16,740 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:14:16,740 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:14:16,740 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:14:16,741 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:14:16,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:14:16,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:14:16,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:14:16,745 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:14:16,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:14:16,746 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:14:16,746 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:14:16,746 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:14:16,748 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:14:16,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:14:16,749 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-04 12:14:16,764 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:14:16,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:14:16,765 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:14:16,765 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:14:16,766 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:14:16,768 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:14:16,768 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:14:16,769 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:14:16,769 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:14:16,769 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:14:16,769 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:14:16,769 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:14:16,770 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:14:16,770 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:14:16,770 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:14:16,770 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:14:16,770 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:14:16,771 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:14:16,771 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:14:16,771 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:14:16,771 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:14:16,771 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:14:16,772 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:14:16,772 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:14:16,773 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:14:16,773 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:14:16,773 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:14:16,773 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:14:16,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:14:16,774 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:14:16,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:14:16,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:14:16,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:14:16,842 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:14:16,842 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:14:16,843 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl [2018-10-04 12:14:16,843 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl' [2018-10-04 12:14:16,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:14:16,899 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:14:16,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:14:16,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:14:16,900 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:14:16,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:14:16,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:14:16,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:14:16,945 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:14:16,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... [2018-10-04 12:14:16,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:14:16,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:14:16,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:14:16,971 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:14:16,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:14:17,046 INFO L130 BoogieDeclarations]: Found specification of procedure l1l0 [2018-10-04 12:14:17,047 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l0 [2018-10-04 12:14:17,047 INFO L130 BoogieDeclarations]: Found specification of procedure l0l1 [2018-10-04 12:14:17,047 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l1 [2018-10-04 12:14:17,048 INFO L130 BoogieDeclarations]: Found specification of procedure l0l0 [2018-10-04 12:14:17,048 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l0 [2018-10-04 12:14:17,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:14:17,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:14:17,048 INFO L130 BoogieDeclarations]: Found specification of procedure l1l1 [2018-10-04 12:14:17,050 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l1 [2018-10-04 12:14:17,695 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:14:17,696 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:14:17 BoogieIcfgContainer [2018-10-04 12:14:17,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:14:17,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:14:17,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:14:17,701 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:14:17,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:14:16" (1/2) ... [2018-10-04 12:14:17,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a43db1b and model type threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:14:17, skipping insertion in model container [2018-10-04 12:14:17,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:14:17" (2/2) ... [2018-10-04 12:14:17,705 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithProcedures.bpl [2018-10-04 12:14:17,713 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:14:17,722 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-04 12:14:17,777 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:14:17,777 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:14:17,778 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:14:17,778 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:14:17,778 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:14:17,778 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:14:17,778 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:14:17,779 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:14:17,779 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:14:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-10-04 12:14:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:14:17,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:17,805 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:17,806 INFO L423 AbstractCegarLoop]: === Iteration 1 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:17,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:17,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1282157605, now seen corresponding path program 1 times [2018-10-04 12:14:17,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:17,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:17,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:17,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:17,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:18,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:18,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:14:18,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:14:18,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:14:18,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:14:18,098 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-10-04 12:14:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:18,885 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2018-10-04 12:14:18,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:14:18,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 12:14:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:18,900 INFO L225 Difference]: With dead ends: 72 [2018-10-04 12:14:18,900 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 12:14:18,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 12:14:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-10-04 12:14:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-04 12:14:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2018-10-04 12:14:18,947 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 7 [2018-10-04 12:14:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:18,947 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2018-10-04 12:14:18,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:14:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2018-10-04 12:14:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:14:18,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:18,949 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:18,951 INFO L423 AbstractCegarLoop]: === Iteration 2 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:18,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:18,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1272619553, now seen corresponding path program 1 times [2018-10-04 12:14:18,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:18,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:18,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:18,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:18,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:19,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:19,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-04 12:14:19,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:14:19,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:14:19,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:14:19,075 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2018-10-04 12:14:19,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:19,837 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2018-10-04 12:14:19,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:14:19,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-10-04 12:14:19,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:19,844 INFO L225 Difference]: With dead ends: 81 [2018-10-04 12:14:19,844 INFO L226 Difference]: Without dead ends: 79 [2018-10-04 12:14:19,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-04 12:14:19,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2018-10-04 12:14:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 12:14:19,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2018-10-04 12:14:19,873 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 7 [2018-10-04 12:14:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:19,874 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2018-10-04 12:14:19,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:14:19,874 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2018-10-04 12:14:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:19,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:19,876 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:19,876 INFO L423 AbstractCegarLoop]: === Iteration 3 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:19,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:19,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1601446133, now seen corresponding path program 1 times [2018-10-04 12:14:19,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:19,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:19,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:19,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:19,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:20,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:14:20,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-04 12:14:20,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:14:20,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:14:20,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:14:20,025 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand 7 states. [2018-10-04 12:14:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:21,020 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2018-10-04 12:14:21,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:14:21,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-10-04 12:14:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:21,027 INFO L225 Difference]: With dead ends: 122 [2018-10-04 12:14:21,027 INFO L226 Difference]: Without dead ends: 120 [2018-10-04 12:14:21,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:14:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-04 12:14:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 73. [2018-10-04 12:14:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-04 12:14:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2018-10-04 12:14:21,045 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 10 [2018-10-04 12:14:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:21,045 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2018-10-04 12:14:21,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:14:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2018-10-04 12:14:21,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:14:21,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:21,047 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:21,048 INFO L423 AbstractCegarLoop]: === Iteration 4 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:21,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1152651256, now seen corresponding path program 1 times [2018-10-04 12:14:21,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:21,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:21,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:21,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:21,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:21,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:21,171 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:21,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:21,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:21,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:14:21,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-04 12:14:21,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:14:21,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:14:21,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:14:21,597 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand 9 states. [2018-10-04 12:14:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:22,389 INFO L93 Difference]: Finished difference Result 168 states and 243 transitions. [2018-10-04 12:14:22,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:14:22,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-10-04 12:14:22,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:22,391 INFO L225 Difference]: With dead ends: 168 [2018-10-04 12:14:22,392 INFO L226 Difference]: Without dead ends: 121 [2018-10-04 12:14:22,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:14:22,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-04 12:14:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2018-10-04 12:14:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-04 12:14:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2018-10-04 12:14:22,416 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 10 [2018-10-04 12:14:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:22,417 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2018-10-04 12:14:22,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:14:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2018-10-04 12:14:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:22,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:22,419 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:22,419 INFO L423 AbstractCegarLoop]: === Iteration 5 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:22,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:22,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1536370777, now seen corresponding path program 1 times [2018-10-04 12:14:22,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:22,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:22,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:22,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:22,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:22,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:22,515 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:22,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:22,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:22,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:22,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-04 12:14:22,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:14:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:14:22,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:14:22,789 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand 10 states. [2018-10-04 12:14:23,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:23,484 INFO L93 Difference]: Finished difference Result 164 states and 232 transitions. [2018-10-04 12:14:23,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:14:23,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-04 12:14:23,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:23,486 INFO L225 Difference]: With dead ends: 164 [2018-10-04 12:14:23,486 INFO L226 Difference]: Without dead ends: 162 [2018-10-04 12:14:23,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-04 12:14:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 109. [2018-10-04 12:14:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-04 12:14:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2018-10-04 12:14:23,510 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 11 [2018-10-04 12:14:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:23,510 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2018-10-04 12:14:23,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:14:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2018-10-04 12:14:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:14:23,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:23,512 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:23,513 INFO L423 AbstractCegarLoop]: === Iteration 6 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:23,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:23,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1150793287, now seen corresponding path program 1 times [2018-10-04 12:14:23,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:23,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:23,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:23,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:23,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:23,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:23,606 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:23,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:23,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:23,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:23,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-10-04 12:14:23,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:14:23,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:14:23,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:14:23,776 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand 10 states. [2018-10-04 12:14:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:24,840 INFO L93 Difference]: Finished difference Result 181 states and 254 transitions. [2018-10-04 12:14:24,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:14:24,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-10-04 12:14:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:24,844 INFO L225 Difference]: With dead ends: 181 [2018-10-04 12:14:24,844 INFO L226 Difference]: Without dead ends: 179 [2018-10-04 12:14:24,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-04 12:14:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2018-10-04 12:14:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-04 12:14:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 164 transitions. [2018-10-04 12:14:24,874 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 164 transitions. Word has length 11 [2018-10-04 12:14:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:24,874 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 164 transitions. [2018-10-04 12:14:24,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:14:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 164 transitions. [2018-10-04 12:14:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:14:24,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:24,876 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:24,877 INFO L423 AbstractCegarLoop]: === Iteration 7 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:24,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:24,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1829652612, now seen corresponding path program 1 times [2018-10-04 12:14:24,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:24,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:24,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:24,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:24,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:25,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:25,023 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:25,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:25,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:25,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:14:25,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-10-04 12:14:25,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:14:25,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:14:25,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:14:25,259 INFO L87 Difference]: Start difference. First operand 117 states and 164 transitions. Second operand 9 states. [2018-10-04 12:14:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:26,537 INFO L93 Difference]: Finished difference Result 217 states and 304 transitions. [2018-10-04 12:14:26,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:14:26,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-04 12:14:26,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:26,539 INFO L225 Difference]: With dead ends: 217 [2018-10-04 12:14:26,539 INFO L226 Difference]: Without dead ends: 133 [2018-10-04 12:14:26,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:14:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-04 12:14:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2018-10-04 12:14:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-04 12:14:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 160 transitions. [2018-10-04 12:14:26,562 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 160 transitions. Word has length 13 [2018-10-04 12:14:26,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:26,562 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 160 transitions. [2018-10-04 12:14:26,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:14:26,563 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 160 transitions. [2018-10-04 12:14:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:14:26,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:26,564 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:26,564 INFO L423 AbstractCegarLoop]: === Iteration 8 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:26,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:26,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1433054771, now seen corresponding path program 1 times [2018-10-04 12:14:26,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:26,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:26,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:26,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:26,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:26,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:26,675 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:26,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:26,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:26,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:26,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-04 12:14:26,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:26,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:26,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:26,959 INFO L87 Difference]: Start difference. First operand 119 states and 160 transitions. Second operand 13 states. [2018-10-04 12:14:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:28,599 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2018-10-04 12:14:28,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:14:28,603 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-04 12:14:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:28,605 INFO L225 Difference]: With dead ends: 194 [2018-10-04 12:14:28,605 INFO L226 Difference]: Without dead ends: 192 [2018-10-04 12:14:28,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:14:28,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-04 12:14:28,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 181. [2018-10-04 12:14:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-04 12:14:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 257 transitions. [2018-10-04 12:14:28,634 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 257 transitions. Word has length 14 [2018-10-04 12:14:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:28,635 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 257 transitions. [2018-10-04 12:14:28,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 257 transitions. [2018-10-04 12:14:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:14:28,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:28,636 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:28,637 INFO L423 AbstractCegarLoop]: === Iteration 9 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:28,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:28,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1436992942, now seen corresponding path program 1 times [2018-10-04 12:14:28,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:28,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:28,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:28,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:28,762 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:28,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:28,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:29,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:29,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-04 12:14:29,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:29,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:29,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:29,192 INFO L87 Difference]: Start difference. First operand 181 states and 257 transitions. Second operand 14 states. [2018-10-04 12:14:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:30,520 INFO L93 Difference]: Finished difference Result 246 states and 347 transitions. [2018-10-04 12:14:30,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:14:30,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 12:14:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:30,528 INFO L225 Difference]: With dead ends: 246 [2018-10-04 12:14:30,528 INFO L226 Difference]: Without dead ends: 244 [2018-10-04 12:14:30,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:14:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-04 12:14:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 193. [2018-10-04 12:14:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-04 12:14:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2018-10-04 12:14:30,562 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 14 [2018-10-04 12:14:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:30,563 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2018-10-04 12:14:30,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2018-10-04 12:14:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:14:30,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:30,564 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:30,564 INFO L423 AbstractCegarLoop]: === Iteration 10 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:30,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:30,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1436993326, now seen corresponding path program 1 times [2018-10-04 12:14:30,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:30,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:30,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:30,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:30,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:30,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:30,693 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:30,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:30,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:30,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:30,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-04 12:14:30,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:30,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:30,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:30,898 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand 14 states. [2018-10-04 12:14:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:32,895 INFO L93 Difference]: Finished difference Result 288 states and 406 transitions. [2018-10-04 12:14:32,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:14:32,896 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 12:14:32,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:32,898 INFO L225 Difference]: With dead ends: 288 [2018-10-04 12:14:32,898 INFO L226 Difference]: Without dead ends: 286 [2018-10-04 12:14:32,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=338, Invalid=1068, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 12:14:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-04 12:14:32,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 221. [2018-10-04 12:14:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-04 12:14:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2018-10-04 12:14:32,933 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 14 [2018-10-04 12:14:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:32,933 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2018-10-04 12:14:32,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2018-10-04 12:14:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:14:32,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:32,934 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:32,934 INFO L423 AbstractCegarLoop]: === Iteration 11 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:32,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:32,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1791986342, now seen corresponding path program 1 times [2018-10-04 12:14:32,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:32,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:32,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:32,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:32,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:33,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:33,064 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:33,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:33,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:33,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:33,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-04 12:14:33,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:33,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:33,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:33,214 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand 14 states. [2018-10-04 12:14:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:34,079 INFO L93 Difference]: Finished difference Result 314 states and 443 transitions. [2018-10-04 12:14:34,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:14:34,086 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 12:14:34,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:34,088 INFO L225 Difference]: With dead ends: 314 [2018-10-04 12:14:34,088 INFO L226 Difference]: Without dead ends: 312 [2018-10-04 12:14:34,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=815, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:14:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-04 12:14:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 243. [2018-10-04 12:14:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-04 12:14:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 349 transitions. [2018-10-04 12:14:34,125 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 349 transitions. Word has length 14 [2018-10-04 12:14:34,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:34,125 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 349 transitions. [2018-10-04 12:14:34,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 349 transitions. [2018-10-04 12:14:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:14:34,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:34,126 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:34,126 INFO L423 AbstractCegarLoop]: === Iteration 12 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:34,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash 844488035, now seen corresponding path program 1 times [2018-10-04 12:14:34,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:34,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:34,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:34,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:34,197 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:34,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:34,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:34,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:34,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 12 [2018-10-04 12:14:34,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:34,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:34,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:34,368 INFO L87 Difference]: Start difference. First operand 243 states and 349 transitions. Second operand 13 states. [2018-10-04 12:14:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:35,341 INFO L93 Difference]: Finished difference Result 322 states and 462 transitions. [2018-10-04 12:14:35,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:14:35,348 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-04 12:14:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:35,350 INFO L225 Difference]: With dead ends: 322 [2018-10-04 12:14:35,350 INFO L226 Difference]: Without dead ends: 320 [2018-10-04 12:14:35,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:14:35,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-04 12:14:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 302. [2018-10-04 12:14:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-04 12:14:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 444 transitions. [2018-10-04 12:14:35,409 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 444 transitions. Word has length 14 [2018-10-04 12:14:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:35,409 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 444 transitions. [2018-10-04 12:14:35,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 444 transitions. [2018-10-04 12:14:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:14:35,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:35,411 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:35,411 INFO L423 AbstractCegarLoop]: === Iteration 13 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:35,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:35,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1052420626, now seen corresponding path program 1 times [2018-10-04 12:14:35,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:35,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:35,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:35,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:35,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:35,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:35,549 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:35,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:35,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:35,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:35,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-04 12:14:35,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:14:35,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:14:35,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:14:35,771 INFO L87 Difference]: Start difference. First operand 302 states and 444 transitions. Second operand 14 states. [2018-10-04 12:14:37,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:37,160 INFO L93 Difference]: Finished difference Result 378 states and 544 transitions. [2018-10-04 12:14:37,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:14:37,163 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 12:14:37,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:37,167 INFO L225 Difference]: With dead ends: 378 [2018-10-04 12:14:37,167 INFO L226 Difference]: Without dead ends: 376 [2018-10-04 12:14:37,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=307, Invalid=815, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:14:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-04 12:14:37,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 301. [2018-10-04 12:14:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-04 12:14:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 443 transitions. [2018-10-04 12:14:37,241 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 443 transitions. Word has length 14 [2018-10-04 12:14:37,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:37,242 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 443 transitions. [2018-10-04 12:14:37,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:14:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 443 transitions. [2018-10-04 12:14:37,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:14:37,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:37,243 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:37,243 INFO L423 AbstractCegarLoop]: === Iteration 14 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:37,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:37,244 INFO L82 PathProgramCache]: Analyzing trace with hash 697427610, now seen corresponding path program 1 times [2018-10-04 12:14:37,244 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:37,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:37,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:37,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:37,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:37,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:37,874 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:37,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:37,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:38,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:38,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 14 [2018-10-04 12:14:38,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:14:38,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:14:38,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:14:38,101 INFO L87 Difference]: Start difference. First operand 301 states and 443 transitions. Second operand 15 states. [2018-10-04 12:14:39,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:39,589 INFO L93 Difference]: Finished difference Result 395 states and 572 transitions. [2018-10-04 12:14:39,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:14:39,589 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-04 12:14:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:39,592 INFO L225 Difference]: With dead ends: 395 [2018-10-04 12:14:39,592 INFO L226 Difference]: Without dead ends: 393 [2018-10-04 12:14:39,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2018-10-04 12:14:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-04 12:14:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 312. [2018-10-04 12:14:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-04 12:14:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 459 transitions. [2018-10-04 12:14:39,646 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 459 transitions. Word has length 14 [2018-10-04 12:14:39,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:39,646 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 459 transitions. [2018-10-04 12:14:39,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:14:39,646 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 459 transitions. [2018-10-04 12:14:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:14:39,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:39,647 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:39,648 INFO L423 AbstractCegarLoop]: === Iteration 15 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:39,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:39,648 INFO L82 PathProgramCache]: Analyzing trace with hash 697427226, now seen corresponding path program 1 times [2018-10-04 12:14:39,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:39,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:39,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:39,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:39,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:39,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:39,722 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:39,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:39,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:39,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:39,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2018-10-04 12:14:39,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:39,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:39,912 INFO L87 Difference]: Start difference. First operand 312 states and 459 transitions. Second operand 13 states. [2018-10-04 12:14:41,014 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-04 12:14:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:42,482 INFO L93 Difference]: Finished difference Result 383 states and 560 transitions. [2018-10-04 12:14:42,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:14:42,483 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-10-04 12:14:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:42,485 INFO L225 Difference]: With dead ends: 383 [2018-10-04 12:14:42,485 INFO L226 Difference]: Without dead ends: 381 [2018-10-04 12:14:42,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:14:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-04 12:14:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 328. [2018-10-04 12:14:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-04 12:14:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 482 transitions. [2018-10-04 12:14:42,548 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 482 transitions. Word has length 14 [2018-10-04 12:14:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:42,549 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 482 transitions. [2018-10-04 12:14:42,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 482 transitions. [2018-10-04 12:14:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:14:42,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:42,550 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:42,550 INFO L423 AbstractCegarLoop]: === Iteration 16 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:42,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:42,550 INFO L82 PathProgramCache]: Analyzing trace with hash 406900684, now seen corresponding path program 1 times [2018-10-04 12:14:42,551 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:42,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:42,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:42,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:42,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:42,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:42,776 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:42,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:42,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:42,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:42,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-04 12:14:42,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:14:42,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:14:42,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:42,988 INFO L87 Difference]: Start difference. First operand 328 states and 482 transitions. Second operand 16 states. [2018-10-04 12:14:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:44,433 INFO L93 Difference]: Finished difference Result 429 states and 618 transitions. [2018-10-04 12:14:44,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:14:44,434 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-10-04 12:14:44,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:44,440 INFO L225 Difference]: With dead ends: 429 [2018-10-04 12:14:44,440 INFO L226 Difference]: Without dead ends: 427 [2018-10-04 12:14:44,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=579, Invalid=1401, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 12:14:44,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-04 12:14:44,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 242. [2018-10-04 12:14:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-04 12:14:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 351 transitions. [2018-10-04 12:14:44,504 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 351 transitions. Word has length 17 [2018-10-04 12:14:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:44,505 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 351 transitions. [2018-10-04 12:14:44,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:14:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 351 transitions. [2018-10-04 12:14:44,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:14:44,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:44,506 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:44,506 INFO L423 AbstractCegarLoop]: === Iteration 17 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:44,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:44,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2143481530, now seen corresponding path program 1 times [2018-10-04 12:14:44,507 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:44,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:44,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:44,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:44,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:44,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:44,636 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:14:44,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:44,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:44,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:44,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2018-10-04 12:14:44,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:14:44,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:14:44,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:14:44,803 INFO L87 Difference]: Start difference. First operand 242 states and 351 transitions. Second operand 16 states. [2018-10-04 12:14:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:46,384 INFO L93 Difference]: Finished difference Result 330 states and 466 transitions. [2018-10-04 12:14:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:14:46,384 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-10-04 12:14:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:46,386 INFO L225 Difference]: With dead ends: 330 [2018-10-04 12:14:46,386 INFO L226 Difference]: Without dead ends: 328 [2018-10-04 12:14:46,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=579, Invalid=1401, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 12:14:46,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-04 12:14:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 158. [2018-10-04 12:14:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-04 12:14:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 226 transitions. [2018-10-04 12:14:46,441 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 226 transitions. Word has length 17 [2018-10-04 12:14:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:46,441 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 226 transitions. [2018-10-04 12:14:46,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:14:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 226 transitions. [2018-10-04 12:14:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:14:46,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:46,442 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-04 12:14:46,442 INFO L423 AbstractCegarLoop]: === Iteration 18 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:46,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:46,442 INFO L82 PathProgramCache]: Analyzing trace with hash -653821292, now seen corresponding path program 1 times [2018-10-04 12:14:46,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:46,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:46,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:46,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:46,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:46,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:46,944 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-04 12:14:46,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:46,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:47,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:47,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-04 12:14:47,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:14:47,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:14:47,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:14:47,067 INFO L87 Difference]: Start difference. First operand 158 states and 226 transitions. Second operand 12 states. [2018-10-04 12:14:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:47,590 INFO L93 Difference]: Finished difference Result 271 states and 380 transitions. [2018-10-04 12:14:47,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:14:47,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-10-04 12:14:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:47,598 INFO L225 Difference]: With dead ends: 271 [2018-10-04 12:14:47,599 INFO L226 Difference]: Without dead ends: 269 [2018-10-04 12:14:47,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:14:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-04 12:14:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 180. [2018-10-04 12:14:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-04 12:14:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 258 transitions. [2018-10-04 12:14:47,673 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 258 transitions. Word has length 18 [2018-10-04 12:14:47,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:47,674 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 258 transitions. [2018-10-04 12:14:47,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:14:47,674 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 258 transitions. [2018-10-04 12:14:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:14:47,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:47,675 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:47,675 INFO L423 AbstractCegarLoop]: === Iteration 19 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:47,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:47,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1014964826, now seen corresponding path program 1 times [2018-10-04 12:14:47,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:47,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:47,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:47,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:47,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:48,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:48,215 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:14:48,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:48,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:48,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:14:48,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-10-04 12:14:48,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:48,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:48,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:48,393 INFO L87 Difference]: Start difference. First operand 180 states and 258 transitions. Second operand 13 states. [2018-10-04 12:14:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:50,852 INFO L93 Difference]: Finished difference Result 741 states and 1047 transitions. [2018-10-04 12:14:50,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-04 12:14:50,853 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 12:14:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:50,855 INFO L225 Difference]: With dead ends: 741 [2018-10-04 12:14:50,855 INFO L226 Difference]: Without dead ends: 564 [2018-10-04 12:14:50,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2559 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1290, Invalid=6192, Unknown=0, NotChecked=0, Total=7482 [2018-10-04 12:14:50,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-10-04 12:14:51,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 341. [2018-10-04 12:14:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-04 12:14:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 486 transitions. [2018-10-04 12:14:51,036 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 486 transitions. Word has length 18 [2018-10-04 12:14:51,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:51,037 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 486 transitions. [2018-10-04 12:14:51,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 486 transitions. [2018-10-04 12:14:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:14:51,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:51,038 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-04 12:14:51,039 INFO L423 AbstractCegarLoop]: === Iteration 20 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:51,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash -155045024, now seen corresponding path program 1 times [2018-10-04 12:14:51,039 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:51,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:51,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:51,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:51,262 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:14:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:51,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:51,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:51,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2018-10-04 12:14:51,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:51,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:51,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:51,396 INFO L87 Difference]: Start difference. First operand 341 states and 486 transitions. Second operand 13 states. [2018-10-04 12:14:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:53,185 INFO L93 Difference]: Finished difference Result 809 states and 1155 transitions. [2018-10-04 12:14:53,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:14:53,186 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 12:14:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:53,189 INFO L225 Difference]: With dead ends: 809 [2018-10-04 12:14:53,189 INFO L226 Difference]: Without dead ends: 470 [2018-10-04 12:14:53,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=462, Invalid=1518, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 12:14:53,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-04 12:14:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 368. [2018-10-04 12:14:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-04 12:14:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 523 transitions. [2018-10-04 12:14:53,351 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 523 transitions. Word has length 18 [2018-10-04 12:14:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:53,352 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 523 transitions. [2018-10-04 12:14:53,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 523 transitions. [2018-10-04 12:14:53,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:14:53,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:53,353 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:53,353 INFO L423 AbstractCegarLoop]: === Iteration 21 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:53,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:53,354 INFO L82 PathProgramCache]: Analyzing trace with hash 393788879, now seen corresponding path program 1 times [2018-10-04 12:14:53,354 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:53,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:53,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:53,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:53,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:53,732 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-04 12:14:53,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:53,732 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:14:53,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:53,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:53,867 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-04 12:14:53,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:53,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:14:53,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:53,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:53,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:53,889 INFO L87 Difference]: Start difference. First operand 368 states and 523 transitions. Second operand 13 states. [2018-10-04 12:14:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:55,667 INFO L93 Difference]: Finished difference Result 1106 states and 1568 transitions. [2018-10-04 12:14:55,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 12:14:55,667 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 12:14:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:55,671 INFO L225 Difference]: With dead ends: 1106 [2018-10-04 12:14:55,671 INFO L226 Difference]: Without dead ends: 724 [2018-10-04 12:14:55,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=678, Invalid=2628, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:14:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-10-04 12:14:55,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 519. [2018-10-04 12:14:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-10-04 12:14:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 739 transitions. [2018-10-04 12:14:55,843 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 739 transitions. Word has length 18 [2018-10-04 12:14:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:55,844 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 739 transitions. [2018-10-04 12:14:55,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:14:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 739 transitions. [2018-10-04 12:14:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:14:55,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:55,845 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:55,845 INFO L423 AbstractCegarLoop]: === Iteration 22 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:55,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:55,845 INFO L82 PathProgramCache]: Analyzing trace with hash -216264799, now seen corresponding path program 1 times [2018-10-04 12:14:55,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:55,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:55,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:55,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:55,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:55,936 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-04 12:14:55,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:55,937 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-04 12:14:55,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:55,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:56,073 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-04 12:14:56,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:14:56,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-04 12:14:56,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:14:56,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:14:56,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:14:56,097 INFO L87 Difference]: Start difference. First operand 519 states and 739 transitions. Second operand 11 states. [2018-10-04 12:14:57,047 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-04 12:14:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:14:57,816 INFO L93 Difference]: Finished difference Result 711 states and 1002 transitions. [2018-10-04 12:14:57,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:14:57,816 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-10-04 12:14:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:14:57,819 INFO L225 Difference]: With dead ends: 711 [2018-10-04 12:14:57,819 INFO L226 Difference]: Without dead ends: 709 [2018-10-04 12:14:57,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:14:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-10-04 12:14:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 498. [2018-10-04 12:14:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-10-04 12:14:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 704 transitions. [2018-10-04 12:14:57,980 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 704 transitions. Word has length 18 [2018-10-04 12:14:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:14:57,980 INFO L480 AbstractCegarLoop]: Abstraction has 498 states and 704 transitions. [2018-10-04 12:14:57,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:14:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 704 transitions. [2018-10-04 12:14:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:14:57,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:14:57,981 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:14:57,981 INFO L423 AbstractCegarLoop]: === Iteration 23 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:14:57,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:14:57,981 INFO L82 PathProgramCache]: Analyzing trace with hash 983482113, now seen corresponding path program 1 times [2018-10-04 12:14:57,981 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:14:57,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:14:57,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:57,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:57,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:14:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:58,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:14:58,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 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-04 12:14:58,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:14:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:14:58,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:14:58,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:14:58,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:14:58,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-10-04 12:14:58,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:14:58,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:14:58,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:14:58,499 INFO L87 Difference]: Start difference. First operand 498 states and 704 transitions. Second operand 13 states. [2018-10-04 12:15:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:00,377 INFO L93 Difference]: Finished difference Result 1319 states and 1864 transitions. [2018-10-04 12:15:00,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:15:00,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 12:15:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:00,381 INFO L225 Difference]: With dead ends: 1319 [2018-10-04 12:15:00,381 INFO L226 Difference]: Without dead ends: 823 [2018-10-04 12:15:00,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 12:15:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-10-04 12:15:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 566. [2018-10-04 12:15:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-10-04 12:15:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 809 transitions. [2018-10-04 12:15:00,591 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 809 transitions. Word has length 18 [2018-10-04 12:15:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:00,592 INFO L480 AbstractCegarLoop]: Abstraction has 566 states and 809 transitions. [2018-10-04 12:15:00,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:15:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 809 transitions. [2018-10-04 12:15:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:00,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:00,593 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-04 12:15:00,593 INFO L423 AbstractCegarLoop]: === Iteration 24 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:00,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:00,594 INFO L82 PathProgramCache]: Analyzing trace with hash 801556786, now seen corresponding path program 1 times [2018-10-04 12:15:00,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:00,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:00,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:00,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:00,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:00,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:00,729 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-04 12:15:00,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:00,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:00,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:00,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-10-04 12:15:00,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:15:00,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:15:00,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:15:00,893 INFO L87 Difference]: Start difference. First operand 566 states and 809 transitions. Second operand 12 states. [2018-10-04 12:15:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:01,815 INFO L93 Difference]: Finished difference Result 766 states and 1086 transitions. [2018-10-04 12:15:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:15:01,815 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-10-04 12:15:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:01,818 INFO L225 Difference]: With dead ends: 766 [2018-10-04 12:15:01,818 INFO L226 Difference]: Without dead ends: 764 [2018-10-04 12:15:01,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:15:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-10-04 12:15:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 608. [2018-10-04 12:15:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-04 12:15:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 869 transitions. [2018-10-04 12:15:02,005 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 869 transitions. Word has length 18 [2018-10-04 12:15:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:02,005 INFO L480 AbstractCegarLoop]: Abstraction has 608 states and 869 transitions. [2018-10-04 12:15:02,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:15:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 869 transitions. [2018-10-04 12:15:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:02,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:02,006 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:02,007 INFO L423 AbstractCegarLoop]: === Iteration 25 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:02,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:02,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1593301430, now seen corresponding path program 1 times [2018-10-04 12:15:02,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:02,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:02,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:02,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:02,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:02,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:02,640 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-04 12:15:02,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:02,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:02,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:15:02,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-10-04 12:15:02,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:15:02,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:15:02,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:15:02,872 INFO L87 Difference]: Start difference. First operand 608 states and 869 transitions. Second operand 13 states. [2018-10-04 12:15:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:05,735 INFO L93 Difference]: Finished difference Result 2095 states and 2968 transitions. [2018-10-04 12:15:05,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-04 12:15:05,735 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 12:15:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:05,740 INFO L225 Difference]: With dead ends: 2095 [2018-10-04 12:15:05,740 INFO L226 Difference]: Without dead ends: 1329 [2018-10-04 12:15:05,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2559 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1290, Invalid=6192, Unknown=0, NotChecked=0, Total=7482 [2018-10-04 12:15:05,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2018-10-04 12:15:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 992. [2018-10-04 12:15:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-10-04 12:15:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1402 transitions. [2018-10-04 12:15:06,053 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1402 transitions. Word has length 18 [2018-10-04 12:15:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:06,054 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1402 transitions. [2018-10-04 12:15:06,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:15:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1402 transitions. [2018-10-04 12:15:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:06,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:06,055 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:06,055 INFO L423 AbstractCegarLoop]: === Iteration 26 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:06,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1366841759, now seen corresponding path program 1 times [2018-10-04 12:15:06,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:06,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:06,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:06,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:06,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:06,467 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-04 12:15:06,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:06,468 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-04 12:15:06,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:06,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:06,553 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-04 12:15:06,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:06,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-10-04 12:15:06,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:15:06,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:15:06,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:15:06,577 INFO L87 Difference]: Start difference. First operand 992 states and 1402 transitions. Second operand 11 states. [2018-10-04 12:15:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:07,902 INFO L93 Difference]: Finished difference Result 1291 states and 1819 transitions. [2018-10-04 12:15:07,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:15:07,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-10-04 12:15:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:07,907 INFO L225 Difference]: With dead ends: 1291 [2018-10-04 12:15:07,907 INFO L226 Difference]: Without dead ends: 1289 [2018-10-04 12:15:07,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:15:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-10-04 12:15:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1028. [2018-10-04 12:15:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-10-04 12:15:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1454 transitions. [2018-10-04 12:15:08,204 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1454 transitions. Word has length 18 [2018-10-04 12:15:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:08,204 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1454 transitions. [2018-10-04 12:15:08,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:15:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1454 transitions. [2018-10-04 12:15:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:08,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:08,205 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:08,206 INFO L423 AbstractCegarLoop]: === Iteration 27 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:08,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:08,206 INFO L82 PathProgramCache]: Analyzing trace with hash -817918193, now seen corresponding path program 1 times [2018-10-04 12:15:08,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:08,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:08,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:08,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:08,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:08,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:08,352 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-04 12:15:08,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:08,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:08,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:15:08,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2018-10-04 12:15:08,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:15:08,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:15:08,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:15:08,479 INFO L87 Difference]: Start difference. First operand 1028 states and 1454 transitions. Second operand 13 states. [2018-10-04 12:15:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:10,078 INFO L93 Difference]: Finished difference Result 2222 states and 3144 transitions. [2018-10-04 12:15:10,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:15:10,078 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 12:15:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:10,082 INFO L225 Difference]: With dead ends: 2222 [2018-10-04 12:15:10,082 INFO L226 Difference]: Without dead ends: 1132 [2018-10-04 12:15:10,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 12:15:10,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-10-04 12:15:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 831. [2018-10-04 12:15:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-10-04 12:15:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1173 transitions. [2018-10-04 12:15:10,366 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1173 transitions. Word has length 18 [2018-10-04 12:15:10,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:10,366 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 1173 transitions. [2018-10-04 12:15:10,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:15:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1173 transitions. [2018-10-04 12:15:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:15:10,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:10,368 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:10,368 INFO L423 AbstractCegarLoop]: === Iteration 28 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:10,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:10,368 INFO L82 PathProgramCache]: Analyzing trace with hash -228224959, now seen corresponding path program 1 times [2018-10-04 12:15:10,368 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:10,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:10,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:10,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:10,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:10,591 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-04 12:15:10,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:10,591 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-04 12:15:10,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:10,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:10,727 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-04 12:15:10,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:10,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:15:10,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:15:10,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:15:10,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:15:10,750 INFO L87 Difference]: Start difference. First operand 831 states and 1173 transitions. Second operand 13 states. [2018-10-04 12:15:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:13,086 INFO L93 Difference]: Finished difference Result 1989 states and 2785 transitions. [2018-10-04 12:15:13,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 12:15:13,086 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-10-04 12:15:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:13,090 INFO L225 Difference]: With dead ends: 1989 [2018-10-04 12:15:13,090 INFO L226 Difference]: Without dead ends: 1130 [2018-10-04 12:15:13,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=678, Invalid=2628, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:15:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-10-04 12:15:13,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 806. [2018-10-04 12:15:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-04 12:15:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1135 transitions. [2018-10-04 12:15:13,376 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1135 transitions. Word has length 18 [2018-10-04 12:15:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:13,377 INFO L480 AbstractCegarLoop]: Abstraction has 806 states and 1135 transitions. [2018-10-04 12:15:13,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:15:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1135 transitions. [2018-10-04 12:15:13,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:15:13,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:13,378 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:13,378 INFO L423 AbstractCegarLoop]: === Iteration 29 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:13,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:13,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1122647006, now seen corresponding path program 1 times [2018-10-04 12:15:13,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:13,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:13,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:13,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:13,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:13,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:13,622 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-04 12:15:13,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:13,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:13,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:13,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-10-04 12:15:13,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:15:13,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:15:13,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:15:13,744 INFO L87 Difference]: Start difference. First operand 806 states and 1135 transitions. Second operand 11 states. [2018-10-04 12:15:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:15,062 INFO L93 Difference]: Finished difference Result 1022 states and 1428 transitions. [2018-10-04 12:15:15,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:15:15,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-10-04 12:15:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:15,067 INFO L225 Difference]: With dead ends: 1022 [2018-10-04 12:15:15,067 INFO L226 Difference]: Without dead ends: 1020 [2018-10-04 12:15:15,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2018-10-04 12:15:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-10-04 12:15:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 838. [2018-10-04 12:15:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-10-04 12:15:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1182 transitions. [2018-10-04 12:15:15,342 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1182 transitions. Word has length 22 [2018-10-04 12:15:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:15,342 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1182 transitions. [2018-10-04 12:15:15,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:15:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1182 transitions. [2018-10-04 12:15:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:15:15,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:15,343 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:15,343 INFO L423 AbstractCegarLoop]: === Iteration 30 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:15,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:15,344 INFO L82 PathProgramCache]: Analyzing trace with hash 15880131, now seen corresponding path program 1 times [2018-10-04 12:15:15,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:15,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:15,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:15,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:15,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:15,497 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-04 12:15:15,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:15,497 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-04 12:15:15,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:15,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:15,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:15,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-04 12:15:15,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:15:15,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:15:15,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:15:15,591 INFO L87 Difference]: Start difference. First operand 838 states and 1182 transitions. Second operand 10 states. [2018-10-04 12:15:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:17,263 INFO L93 Difference]: Finished difference Result 1127 states and 1575 transitions. [2018-10-04 12:15:17,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:15:17,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-10-04 12:15:17,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:17,268 INFO L225 Difference]: With dead ends: 1127 [2018-10-04 12:15:17,268 INFO L226 Difference]: Without dead ends: 1125 [2018-10-04 12:15:17,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:15:17,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-04 12:15:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 852. [2018-10-04 12:15:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-10-04 12:15:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1203 transitions. [2018-10-04 12:15:17,562 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1203 transitions. Word has length 22 [2018-10-04 12:15:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:17,563 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1203 transitions. [2018-10-04 12:15:17,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:15:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1203 transitions. [2018-10-04 12:15:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:15:17,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:17,565 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:17,565 INFO L423 AbstractCegarLoop]: === Iteration 31 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:17,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:17,565 INFO L82 PathProgramCache]: Analyzing trace with hash -510719313, now seen corresponding path program 1 times [2018-10-04 12:15:17,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:17,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:17,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:17,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:17,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:17,679 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-04 12:15:17,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:17,679 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-04 12:15:17,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:17,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:18,277 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-04 12:15:18,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:18,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:15:18,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:15:18,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:15:18,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:15:18,305 INFO L87 Difference]: Start difference. First operand 852 states and 1203 transitions. Second operand 14 states. [2018-10-04 12:15:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:19,989 INFO L93 Difference]: Finished difference Result 1127 states and 1578 transitions. [2018-10-04 12:15:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:15:19,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-10-04 12:15:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:19,994 INFO L225 Difference]: With dead ends: 1127 [2018-10-04 12:15:19,994 INFO L226 Difference]: Without dead ends: 1125 [2018-10-04 12:15:19,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=548, Invalid=1432, Unknown=0, NotChecked=0, Total=1980 [2018-10-04 12:15:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-10-04 12:15:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 830. [2018-10-04 12:15:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-10-04 12:15:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1171 transitions. [2018-10-04 12:15:20,291 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1171 transitions. Word has length 22 [2018-10-04 12:15:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:20,291 INFO L480 AbstractCegarLoop]: Abstraction has 830 states and 1171 transitions. [2018-10-04 12:15:20,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:15:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1171 transitions. [2018-10-04 12:15:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:15:20,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:20,293 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:20,293 INFO L423 AbstractCegarLoop]: === Iteration 32 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:20,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:20,294 INFO L82 PathProgramCache]: Analyzing trace with hash 627807824, now seen corresponding path program 1 times [2018-10-04 12:15:20,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:20,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:20,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:20,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:20,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:20,453 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-04 12:15:20,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:20,454 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-04 12:15:20,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:20,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:20,620 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-04 12:15:20,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:20,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-10-04 12:15:20,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:20,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:20,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:20,642 INFO L87 Difference]: Start difference. First operand 830 states and 1171 transitions. Second operand 15 states. [2018-10-04 12:15:22,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:22,264 INFO L93 Difference]: Finished difference Result 1072 states and 1499 transitions. [2018-10-04 12:15:22,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:15:22,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-10-04 12:15:22,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:22,268 INFO L225 Difference]: With dead ends: 1072 [2018-10-04 12:15:22,268 INFO L226 Difference]: Without dead ends: 1070 [2018-10-04 12:15:22,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:15:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-10-04 12:15:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 788. [2018-10-04 12:15:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-10-04 12:15:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1104 transitions. [2018-10-04 12:15:22,539 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1104 transitions. Word has length 22 [2018-10-04 12:15:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:22,540 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1104 transitions. [2018-10-04 12:15:22,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:22,540 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1104 transitions. [2018-10-04 12:15:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:15:22,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:22,541 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:22,542 INFO L423 AbstractCegarLoop]: === Iteration 33 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:22,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:22,542 INFO L82 PathProgramCache]: Analyzing trace with hash 345073063, now seen corresponding path program 1 times [2018-10-04 12:15:22,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:22,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:22,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:22,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:22,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:22,739 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-04 12:15:22,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:22,740 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:15:22,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:22,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:22,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:22,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-04 12:15:22,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:15:22,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:15:22,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:15:22,847 INFO L87 Difference]: Start difference. First operand 788 states and 1104 transitions. Second operand 10 states. [2018-10-04 12:15:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:24,193 INFO L93 Difference]: Finished difference Result 1025 states and 1426 transitions. [2018-10-04 12:15:24,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:15:24,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-10-04 12:15:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:24,197 INFO L225 Difference]: With dead ends: 1025 [2018-10-04 12:15:24,197 INFO L226 Difference]: Without dead ends: 1023 [2018-10-04 12:15:24,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-04 12:15:24,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-10-04 12:15:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 818. [2018-10-04 12:15:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2018-10-04 12:15:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1149 transitions. [2018-10-04 12:15:24,504 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1149 transitions. Word has length 22 [2018-10-04 12:15:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:24,504 INFO L480 AbstractCegarLoop]: Abstraction has 818 states and 1149 transitions. [2018-10-04 12:15:24,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:15:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1149 transitions. [2018-10-04 12:15:24,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:15:24,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:24,505 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:24,506 INFO L423 AbstractCegarLoop]: === Iteration 34 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:24,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:24,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1613894486, now seen corresponding path program 1 times [2018-10-04 12:15:24,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:24,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:24,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:24,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:24,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:24,625 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-04 12:15:24,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:24,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 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-04 12:15:24,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:24,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:24,738 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-04 12:15:24,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:24,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-10-04 12:15:24,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:24,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:24,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:24,760 INFO L87 Difference]: Start difference. First operand 818 states and 1149 transitions. Second operand 15 states. [2018-10-04 12:15:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:26,485 INFO L93 Difference]: Finished difference Result 1057 states and 1481 transitions. [2018-10-04 12:15:26,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:15:26,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-10-04 12:15:26,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:26,489 INFO L225 Difference]: With dead ends: 1057 [2018-10-04 12:15:26,489 INFO L226 Difference]: Without dead ends: 1055 [2018-10-04 12:15:26,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:15:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2018-10-04 12:15:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 770. [2018-10-04 12:15:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-10-04 12:15:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1073 transitions. [2018-10-04 12:15:26,793 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1073 transitions. Word has length 22 [2018-10-04 12:15:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:26,793 INFO L480 AbstractCegarLoop]: Abstraction has 770 states and 1073 transitions. [2018-10-04 12:15:26,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1073 transitions. [2018-10-04 12:15:26,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 12:15:26,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:26,794 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:26,794 INFO L423 AbstractCegarLoop]: === Iteration 35 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:26,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:26,794 INFO L82 PathProgramCache]: Analyzing trace with hash -488650854, now seen corresponding path program 1 times [2018-10-04 12:15:26,794 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:26,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:26,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:26,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:26,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:27,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:27,686 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:15:27,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:27,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:15:28,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:28,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-04 12:15:28,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:28,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:28,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:28,404 INFO L87 Difference]: Start difference. First operand 770 states and 1073 transitions. Second operand 15 states. [2018-10-04 12:15:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:31,022 INFO L93 Difference]: Finished difference Result 1779 states and 2438 transitions. [2018-10-04 12:15:31,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 12:15:31,022 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-04 12:15:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:31,027 INFO L225 Difference]: With dead ends: 1779 [2018-10-04 12:15:31,027 INFO L226 Difference]: Without dead ends: 1507 [2018-10-04 12:15:31,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1037, Invalid=3655, Unknown=0, NotChecked=0, Total=4692 [2018-10-04 12:15:31,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-10-04 12:15:31,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1174. [2018-10-04 12:15:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2018-10-04 12:15:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1623 transitions. [2018-10-04 12:15:31,498 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1623 transitions. Word has length 25 [2018-10-04 12:15:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:31,498 INFO L480 AbstractCegarLoop]: Abstraction has 1174 states and 1623 transitions. [2018-10-04 12:15:31,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1623 transitions. [2018-10-04 12:15:31,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 12:15:31,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:31,499 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:31,500 INFO L423 AbstractCegarLoop]: === Iteration 36 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:31,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:31,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1608047085, now seen corresponding path program 1 times [2018-10-04 12:15:31,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:31,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:31,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:31,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:31,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:31,667 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-04 12:15:31,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:31,668 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-04 12:15:31,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:31,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:15:31,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:31,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-04 12:15:31,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:31,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:31,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:31,817 INFO L87 Difference]: Start difference. First operand 1174 states and 1623 transitions. Second operand 15 states. [2018-10-04 12:15:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:34,637 INFO L93 Difference]: Finished difference Result 2685 states and 3700 transitions. [2018-10-04 12:15:34,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:15:34,637 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-04 12:15:34,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:34,643 INFO L225 Difference]: With dead ends: 2685 [2018-10-04 12:15:34,644 INFO L226 Difference]: Without dead ends: 1652 [2018-10-04 12:15:34,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=782, Invalid=2758, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 12:15:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2018-10-04 12:15:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1212. [2018-10-04 12:15:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2018-10-04 12:15:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1681 transitions. [2018-10-04 12:15:35,089 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1681 transitions. Word has length 25 [2018-10-04 12:15:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:35,089 INFO L480 AbstractCegarLoop]: Abstraction has 1212 states and 1681 transitions. [2018-10-04 12:15:35,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1681 transitions. [2018-10-04 12:15:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 12:15:35,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:35,091 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:35,091 INFO L423 AbstractCegarLoop]: === Iteration 37 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:35,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:35,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1101622072, now seen corresponding path program 1 times [2018-10-04 12:15:35,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:35,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:35,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:35,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:35,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:35,246 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-04 12:15:35,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:35,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:15:35,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:35,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-04 12:15:35,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:35,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:35,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:35,374 INFO L87 Difference]: Start difference. First operand 1212 states and 1681 transitions. Second operand 15 states. [2018-10-04 12:15:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:38,313 INFO L93 Difference]: Finished difference Result 2130 states and 2907 transitions. [2018-10-04 12:15:38,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 12:15:38,313 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-04 12:15:38,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:38,320 INFO L225 Difference]: With dead ends: 2130 [2018-10-04 12:15:38,320 INFO L226 Difference]: Without dead ends: 1946 [2018-10-04 12:15:38,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1010, Invalid=3546, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 12:15:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2018-10-04 12:15:38,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1616. [2018-10-04 12:15:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2018-10-04 12:15:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2248 transitions. [2018-10-04 12:15:38,940 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2248 transitions. Word has length 25 [2018-10-04 12:15:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:38,941 INFO L480 AbstractCegarLoop]: Abstraction has 1616 states and 2248 transitions. [2018-10-04 12:15:38,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2248 transitions. [2018-10-04 12:15:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 12:15:38,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:38,943 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:38,943 INFO L423 AbstractCegarLoop]: === Iteration 38 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:38,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:38,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1649781575, now seen corresponding path program 1 times [2018-10-04 12:15:38,943 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:38,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:38,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:38,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:38,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:39,095 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-04 12:15:39,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:39,096 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-04 12:15:39,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:39,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:15:39,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:39,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2018-10-04 12:15:39,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:15:39,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:15:39,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:15:39,237 INFO L87 Difference]: Start difference. First operand 1616 states and 2248 transitions. Second operand 15 states. [2018-10-04 12:15:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:42,265 INFO L93 Difference]: Finished difference Result 3372 states and 4705 transitions. [2018-10-04 12:15:42,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:15:42,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-10-04 12:15:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:42,274 INFO L225 Difference]: With dead ends: 3372 [2018-10-04 12:15:42,274 INFO L226 Difference]: Without dead ends: 2040 [2018-10-04 12:15:42,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=782, Invalid=2758, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 12:15:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2018-10-04 12:15:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1575. [2018-10-04 12:15:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-10-04 12:15:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2199 transitions. [2018-10-04 12:15:42,829 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2199 transitions. Word has length 25 [2018-10-04 12:15:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:42,830 INFO L480 AbstractCegarLoop]: Abstraction has 1575 states and 2199 transitions. [2018-10-04 12:15:42,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:15:42,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2199 transitions. [2018-10-04 12:15:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 12:15:42,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:42,832 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:42,833 INFO L423 AbstractCegarLoop]: === Iteration 39 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:42,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:42,833 INFO L82 PathProgramCache]: Analyzing trace with hash -664447164, now seen corresponding path program 2 times [2018-10-04 12:15:42,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:42,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:42,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:42,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:15:42,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:42,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:42,979 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:15:42,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:15:43,041 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:15:43,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:43,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:43,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:43,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 12:15:43,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:15:43,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:15:43,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:15:43,274 INFO L87 Difference]: Start difference. First operand 1575 states and 2199 transitions. Second operand 20 states. [2018-10-04 12:15:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:50,284 INFO L93 Difference]: Finished difference Result 2646 states and 3763 transitions. [2018-10-04 12:15:50,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-04 12:15:50,284 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-10-04 12:15:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:50,293 INFO L225 Difference]: With dead ends: 2646 [2018-10-04 12:15:50,293 INFO L226 Difference]: Without dead ends: 2644 [2018-10-04 12:15:50,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4956 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3132, Invalid=9524, Unknown=0, NotChecked=0, Total=12656 [2018-10-04 12:15:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2018-10-04 12:15:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 1833. [2018-10-04 12:15:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2018-10-04 12:15:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2576 transitions. [2018-10-04 12:15:50,971 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2576 transitions. Word has length 29 [2018-10-04 12:15:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:50,971 INFO L480 AbstractCegarLoop]: Abstraction has 1833 states and 2576 transitions. [2018-10-04 12:15:50,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:15:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2576 transitions. [2018-10-04 12:15:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 12:15:50,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:50,974 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:50,974 INFO L423 AbstractCegarLoop]: === Iteration 40 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:50,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:50,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1030242552, now seen corresponding path program 2 times [2018-10-04 12:15:50,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:50,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:50,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:50,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:15:50,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:15:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:51,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:15:51,350 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:15:51,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:15:51,412 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:15:51,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:15:51,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:15:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:15:51,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:15:51,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-10-04 12:15:51,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:15:51,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:15:51,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:15:51,606 INFO L87 Difference]: Start difference. First operand 1833 states and 2576 transitions. Second operand 21 states. [2018-10-04 12:15:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:15:58,742 INFO L93 Difference]: Finished difference Result 2887 states and 4117 transitions. [2018-10-04 12:15:58,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-04 12:15:58,742 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-10-04 12:15:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:15:58,748 INFO L225 Difference]: With dead ends: 2887 [2018-10-04 12:15:58,749 INFO L226 Difference]: Without dead ends: 2885 [2018-10-04 12:15:58,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 5023 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3166, Invalid=9716, Unknown=0, NotChecked=0, Total=12882 [2018-10-04 12:15:58,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2018-10-04 12:15:59,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2102. [2018-10-04 12:15:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2018-10-04 12:15:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 2970 transitions. [2018-10-04 12:15:59,520 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 2970 transitions. Word has length 29 [2018-10-04 12:15:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:15:59,520 INFO L480 AbstractCegarLoop]: Abstraction has 2102 states and 2970 transitions. [2018-10-04 12:15:59,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:15:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2970 transitions. [2018-10-04 12:15:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:15:59,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:15:59,523 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:15:59,523 INFO L423 AbstractCegarLoop]: === Iteration 41 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:15:59,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:15:59,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1174012687, now seen corresponding path program 2 times [2018-10-04 12:15:59,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:15:59,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:15:59,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:59,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:15:59,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:15:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 12:16:00,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:00,026 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-04 12:16:00,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:16:00,089 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:16:00,089 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:00,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:16:00,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:00,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 12:16:00,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:16:00,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:16:00,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:16:00,524 INFO L87 Difference]: Start difference. First operand 2102 states and 2970 transitions. Second operand 16 states. [2018-10-04 12:16:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:05,992 INFO L93 Difference]: Finished difference Result 6948 states and 9725 transitions. [2018-10-04 12:16:05,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-04 12:16:05,992 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-10-04 12:16:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:06,003 INFO L225 Difference]: With dead ends: 6948 [2018-10-04 12:16:06,003 INFO L226 Difference]: Without dead ends: 4896 [2018-10-04 12:16:06,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6484 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2880, Invalid=14150, Unknown=0, NotChecked=0, Total=17030 [2018-10-04 12:16:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4896 states. [2018-10-04 12:16:07,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4896 to 3634. [2018-10-04 12:16:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3634 states. [2018-10-04 12:16:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3634 states and 5080 transitions. [2018-10-04 12:16:07,454 INFO L78 Accepts]: Start accepts. Automaton has 3634 states and 5080 transitions. Word has length 33 [2018-10-04 12:16:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:07,454 INFO L480 AbstractCegarLoop]: Abstraction has 3634 states and 5080 transitions. [2018-10-04 12:16:07,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:16:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3634 states and 5080 transitions. [2018-10-04 12:16:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:16:07,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:07,457 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:07,458 INFO L423 AbstractCegarLoop]: === Iteration 42 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:07,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:07,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2110003385, now seen corresponding path program 1 times [2018-10-04 12:16:07,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:07,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:07,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:07,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:07,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:07,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:07,683 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-04 12:16:07,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:07,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:16:07,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:07,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-10-04 12:16:07,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:16:07,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:16:07,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:16:07,908 INFO L87 Difference]: Start difference. First operand 3634 states and 5080 transitions. Second operand 18 states. [2018-10-04 12:16:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:14,649 INFO L93 Difference]: Finished difference Result 5436 states and 7576 transitions. [2018-10-04 12:16:14,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-04 12:16:14,649 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-10-04 12:16:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:14,662 INFO L225 Difference]: With dead ends: 5436 [2018-10-04 12:16:14,662 INFO L226 Difference]: Without dead ends: 5349 [2018-10-04 12:16:14,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2508 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1401, Invalid=6609, Unknown=0, NotChecked=0, Total=8010 [2018-10-04 12:16:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5349 states. [2018-10-04 12:16:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5349 to 4022. [2018-10-04 12:16:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4022 states. [2018-10-04 12:16:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 5648 transitions. [2018-10-04 12:16:16,417 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 5648 transitions. Word has length 33 [2018-10-04 12:16:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:16,418 INFO L480 AbstractCegarLoop]: Abstraction has 4022 states and 5648 transitions. [2018-10-04 12:16:16,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:16:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 5648 transitions. [2018-10-04 12:16:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:16:16,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:16,421 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:16,421 INFO L423 AbstractCegarLoop]: === Iteration 43 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:16,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash -895180230, now seen corresponding path program 3 times [2018-10-04 12:16:16,421 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:16,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:16,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:16,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:16,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:16,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:16,588 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-04 12:16:16,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:16:16,655 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 12:16:16,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:16,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:16:17,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:17,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-10-04 12:16:17,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:16:17,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:16:17,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:16:17,643 INFO L87 Difference]: Start difference. First operand 4022 states and 5648 transitions. Second operand 22 states. [2018-10-04 12:16:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:29,703 INFO L93 Difference]: Finished difference Result 8032 states and 11417 transitions. [2018-10-04 12:16:29,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-04 12:16:29,703 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 33 [2018-10-04 12:16:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:29,721 INFO L225 Difference]: With dead ends: 8032 [2018-10-04 12:16:29,721 INFO L226 Difference]: Without dead ends: 7935 [2018-10-04 12:16:29,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8181 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4070, Invalid=17686, Unknown=0, NotChecked=0, Total=21756 [2018-10-04 12:16:29,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7935 states. [2018-10-04 12:16:31,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7935 to 4327. [2018-10-04 12:16:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4327 states. [2018-10-04 12:16:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 6121 transitions. [2018-10-04 12:16:31,589 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 6121 transitions. Word has length 33 [2018-10-04 12:16:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:31,589 INFO L480 AbstractCegarLoop]: Abstraction has 4327 states and 6121 transitions. [2018-10-04 12:16:31,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:16:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 6121 transitions. [2018-10-04 12:16:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:16:31,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:31,593 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:31,593 INFO L423 AbstractCegarLoop]: === Iteration 44 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:31,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:31,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1250173630, now seen corresponding path program 1 times [2018-10-04 12:16:31,593 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:31,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:31,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:31,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:31,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:16:31,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:31,748 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-04 12:16:31,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:31,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:31,930 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:16:31,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:31,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-10-04 12:16:31,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:16:31,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:16:31,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:16:31,952 INFO L87 Difference]: Start difference. First operand 4327 states and 6121 transitions. Second operand 19 states. [2018-10-04 12:16:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:40,338 INFO L93 Difference]: Finished difference Result 9177 states and 12958 transitions. [2018-10-04 12:16:40,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-04 12:16:40,339 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-10-04 12:16:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:40,357 INFO L225 Difference]: With dead ends: 9177 [2018-10-04 12:16:40,357 INFO L226 Difference]: Without dead ends: 5991 [2018-10-04 12:16:40,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4514 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2969, Invalid=11311, Unknown=0, NotChecked=0, Total=14280 [2018-10-04 12:16:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2018-10-04 12:16:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 4147. [2018-10-04 12:16:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4147 states. [2018-10-04 12:16:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4147 states to 4147 states and 5817 transitions. [2018-10-04 12:16:42,218 INFO L78 Accepts]: Start accepts. Automaton has 4147 states and 5817 transitions. Word has length 33 [2018-10-04 12:16:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:42,218 INFO L480 AbstractCegarLoop]: Abstraction has 4147 states and 5817 transitions. [2018-10-04 12:16:42,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:16:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4147 states and 5817 transitions. [2018-10-04 12:16:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:16:42,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:42,222 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:42,222 INFO L423 AbstractCegarLoop]: === Iteration 45 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:42,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:42,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1810158453, now seen corresponding path program 2 times [2018-10-04 12:16:42,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:42,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:42,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:42,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:42,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:43,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:43,067 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-04 12:16:43,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:16:43,141 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:16:43,141 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:16:43,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:16:43,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:43,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-10-04 12:16:43,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:16:43,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:16:43,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:16:43,301 INFO L87 Difference]: Start difference. First operand 4147 states and 5817 transitions. Second operand 18 states. [2018-10-04 12:16:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:16:48,923 INFO L93 Difference]: Finished difference Result 5255 states and 7327 transitions. [2018-10-04 12:16:48,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:16:48,923 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-10-04 12:16:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:16:48,932 INFO L225 Difference]: With dead ends: 5255 [2018-10-04 12:16:48,932 INFO L226 Difference]: Without dead ends: 5253 [2018-10-04 12:16:48,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=346, Invalid=1460, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 12:16:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5253 states. [2018-10-04 12:16:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5253 to 4447. [2018-10-04 12:16:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4447 states. [2018-10-04 12:16:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4447 states to 4447 states and 6228 transitions. [2018-10-04 12:16:51,099 INFO L78 Accepts]: Start accepts. Automaton has 4447 states and 6228 transitions. Word has length 33 [2018-10-04 12:16:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:16:51,099 INFO L480 AbstractCegarLoop]: Abstraction has 4447 states and 6228 transitions. [2018-10-04 12:16:51,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:16:51,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4447 states and 6228 transitions. [2018-10-04 12:16:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:16:51,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:16:51,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:16:51,103 INFO L423 AbstractCegarLoop]: === Iteration 46 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:16:51,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:16:51,104 INFO L82 PathProgramCache]: Analyzing trace with hash -667748710, now seen corresponding path program 1 times [2018-10-04 12:16:51,104 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:16:51,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:16:51,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:51,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:16:51,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:16:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:51,269 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-04 12:16:51,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:16:51,269 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-04 12:16:51,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:16:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:16:51,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:16:51,455 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-04 12:16:51,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:16:51,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-10-04 12:16:51,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:16:51,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:16:51,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:16:51,476 INFO L87 Difference]: Start difference. First operand 4447 states and 6228 transitions. Second operand 18 states. [2018-10-04 12:17:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:01,718 INFO L93 Difference]: Finished difference Result 7721 states and 10805 transitions. [2018-10-04 12:17:01,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-04 12:17:01,718 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-10-04 12:17:01,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:01,730 INFO L225 Difference]: With dead ends: 7721 [2018-10-04 12:17:01,730 INFO L226 Difference]: Without dead ends: 7719 [2018-10-04 12:17:01,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3331 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1278, Invalid=8228, Unknown=0, NotChecked=0, Total=9506 [2018-10-04 12:17:01,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7719 states. [2018-10-04 12:17:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7719 to 5438. [2018-10-04 12:17:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5438 states. [2018-10-04 12:17:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5438 states to 5438 states and 7651 transitions. [2018-10-04 12:17:04,312 INFO L78 Accepts]: Start accepts. Automaton has 5438 states and 7651 transitions. Word has length 33 [2018-10-04 12:17:04,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:04,312 INFO L480 AbstractCegarLoop]: Abstraction has 5438 states and 7651 transitions. [2018-10-04 12:17:04,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:17:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 5438 states and 7651 transitions. [2018-10-04 12:17:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:17:04,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:04,316 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:04,316 INFO L423 AbstractCegarLoop]: === Iteration 47 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:04,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:04,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1146614399, now seen corresponding path program 2 times [2018-10-04 12:17:04,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:04,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:04,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:04,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:04,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-04 12:17:04,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:04,410 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:17:04,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:17:04,471 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:17:04,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:17:04,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:17:04,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:04,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-10-04 12:17:04,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:17:04,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:17:04,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:17:04,583 INFO L87 Difference]: Start difference. First operand 5438 states and 7651 transitions. Second operand 16 states. [2018-10-04 12:17:08,150 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-04 12:17:08,582 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-04 12:17:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:14,081 INFO L93 Difference]: Finished difference Result 15976 states and 22278 transitions. [2018-10-04 12:17:14,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-04 12:17:14,081 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-10-04 12:17:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:14,095 INFO L225 Difference]: With dead ends: 15976 [2018-10-04 12:17:14,095 INFO L226 Difference]: Without dead ends: 10483 [2018-10-04 12:17:14,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6466 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2880, Invalid=14150, Unknown=0, NotChecked=0, Total=17030 [2018-10-04 12:17:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10483 states. [2018-10-04 12:17:17,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10483 to 8111. [2018-10-04 12:17:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8111 states. [2018-10-04 12:17:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8111 states to 8111 states and 11260 transitions. [2018-10-04 12:17:18,010 INFO L78 Accepts]: Start accepts. Automaton has 8111 states and 11260 transitions. Word has length 33 [2018-10-04 12:17:18,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:18,010 INFO L480 AbstractCegarLoop]: Abstraction has 8111 states and 11260 transitions. [2018-10-04 12:17:18,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:17:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 8111 states and 11260 transitions. [2018-10-04 12:17:18,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:17:18,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:18,015 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:18,015 INFO L423 AbstractCegarLoop]: === Iteration 48 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:18,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:18,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1449531796, now seen corresponding path program 1 times [2018-10-04 12:17:18,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:18,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:18,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:18,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:17:18,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:18,164 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-04 12:17:18,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:18,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 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-04 12:17:18,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:18,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-04 12:17:18,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:18,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-10-04 12:17:18,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:17:18,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:17:18,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:17:18,369 INFO L87 Difference]: Start difference. First operand 8111 states and 11260 transitions. Second operand 19 states. [2018-10-04 12:17:23,177 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-10-04 12:17:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:27,313 INFO L93 Difference]: Finished difference Result 10277 states and 14246 transitions. [2018-10-04 12:17:27,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 12:17:27,314 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-10-04 12:17:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:27,328 INFO L225 Difference]: With dead ends: 10277 [2018-10-04 12:17:27,328 INFO L226 Difference]: Without dead ends: 10275 [2018-10-04 12:17:27,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=978, Invalid=4424, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:17:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10275 states. [2018-10-04 12:17:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10275 to 8291. [2018-10-04 12:17:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8291 states. [2018-10-04 12:17:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8291 states to 8291 states and 11531 transitions. [2018-10-04 12:17:31,329 INFO L78 Accepts]: Start accepts. Automaton has 8291 states and 11531 transitions. Word has length 33 [2018-10-04 12:17:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:31,329 INFO L480 AbstractCegarLoop]: Abstraction has 8291 states and 11531 transitions. [2018-10-04 12:17:31,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:17:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 8291 states and 11531 transitions. [2018-10-04 12:17:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:17:31,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:31,334 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:31,334 INFO L423 AbstractCegarLoop]: === Iteration 49 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:31,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1026480992, now seen corresponding path program 1 times [2018-10-04 12:17:31,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:31,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:31,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:31,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:31,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:17:31,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:31,475 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-04 12:17:31,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:31,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:17:31,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:31,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-10-04 12:17:31,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:17:31,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:17:31,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:17:31,660 INFO L87 Difference]: Start difference. First operand 8291 states and 11531 transitions. Second operand 19 states. [2018-10-04 12:17:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:17:42,192 INFO L93 Difference]: Finished difference Result 16294 states and 22694 transitions. [2018-10-04 12:17:42,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-04 12:17:42,193 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-10-04 12:17:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:17:42,204 INFO L225 Difference]: With dead ends: 16294 [2018-10-04 12:17:42,204 INFO L226 Difference]: Without dead ends: 9999 [2018-10-04 12:17:42,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4530 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2859, Invalid=11183, Unknown=0, NotChecked=0, Total=14042 [2018-10-04 12:17:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9999 states. [2018-10-04 12:17:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9999 to 8241. [2018-10-04 12:17:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8241 states. [2018-10-04 12:17:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8241 states to 8241 states and 11466 transitions. [2018-10-04 12:17:46,413 INFO L78 Accepts]: Start accepts. Automaton has 8241 states and 11466 transitions. Word has length 33 [2018-10-04 12:17:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:17:46,414 INFO L480 AbstractCegarLoop]: Abstraction has 8241 states and 11466 transitions. [2018-10-04 12:17:46,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:17:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 8241 states and 11466 transitions. [2018-10-04 12:17:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:17:46,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:17:46,418 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:17:46,418 INFO L423 AbstractCegarLoop]: === Iteration 50 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:17:46,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:17:46,419 INFO L82 PathProgramCache]: Analyzing trace with hash 610357864, now seen corresponding path program 3 times [2018-10-04 12:17:46,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:17:46,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:17:46,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:46,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:17:46,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:17:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:17:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:17:46,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:17:46,692 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-04 12:17:46,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:17:46,755 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 12:17:46,756 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:17:46,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:17:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:17:46,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:17:46,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 21 [2018-10-04 12:17:46,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:17:46,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:17:46,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:17:46,880 INFO L87 Difference]: Start difference. First operand 8241 states and 11466 transitions. Second operand 21 states. [2018-10-04 12:18:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:07,597 INFO L93 Difference]: Finished difference Result 25684 states and 35500 transitions. [2018-10-04 12:18:07,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-04 12:18:07,597 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-10-04 12:18:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:07,620 INFO L225 Difference]: With dead ends: 25684 [2018-10-04 12:18:07,620 INFO L226 Difference]: Without dead ends: 16698 [2018-10-04 12:18:07,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18096 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=6678, Invalid=35142, Unknown=0, NotChecked=0, Total=41820 [2018-10-04 12:18:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16698 states. [2018-10-04 12:18:12,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16698 to 10011. [2018-10-04 12:18:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10011 states. [2018-10-04 12:18:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10011 states to 10011 states and 13930 transitions. [2018-10-04 12:18:12,835 INFO L78 Accepts]: Start accepts. Automaton has 10011 states and 13930 transitions. Word has length 33 [2018-10-04 12:18:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:18:12,835 INFO L480 AbstractCegarLoop]: Abstraction has 10011 states and 13930 transitions. [2018-10-04 12:18:12,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:18:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand 10011 states and 13930 transitions. [2018-10-04 12:18:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:18:12,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:18:12,840 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:18:12,840 INFO L423 AbstractCegarLoop]: === Iteration 51 === [l1l0Err0ASSERT_VIOLATIONASSERT, l0l1Err0ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:18:12,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:18:12,840 INFO L82 PathProgramCache]: Analyzing trace with hash 690693469, now seen corresponding path program 1 times [2018-10-04 12:18:12,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:18:12,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:18:12,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:12,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:18:12,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:18:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:18:12,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:18:12,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 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-04 12:18:12,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:18:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:18:13,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:18:13,217 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-04 12:18:13,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:18:13,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-10-04 12:18:13,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:18:13,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:18:13,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:18:13,238 INFO L87 Difference]: Start difference. First operand 10011 states and 13930 transitions. Second operand 21 states. [2018-10-04 12:18:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:18:25,663 INFO L93 Difference]: Finished difference Result 12668 states and 17557 transitions. [2018-10-04 12:18:25,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-04 12:18:25,663 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-10-04 12:18:25,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:18:25,677 INFO L225 Difference]: With dead ends: 12668 [2018-10-04 12:18:25,677 INFO L226 Difference]: Without dead ends: 12586 [2018-10-04 12:18:25,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2220 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=841, Invalid=6131, Unknown=0, NotChecked=0, Total=6972 [2018-10-04 12:18:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12586 states. Received shutdown request... [2018-10-04 12:18:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12586 to 10468. [2018-10-04 12:18:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10468 states. [2018-10-04 12:18:31,151 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:18:31,156 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:18:31,157 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:18:31 BoogieIcfgContainer [2018-10-04 12:18:31,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:18:31,158 INFO L168 Benchmark]: Toolchain (without parser) took 254259.59 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -916.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-04 12:18:31,158 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-04 12:18:31,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.52 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-04 12:18:31,159 INFO L168 Benchmark]: Boogie Preprocessor took 24.71 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-04 12:18:31,159 INFO L168 Benchmark]: RCFGBuilder took 726.00 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-04 12:18:31,160 INFO L168 Benchmark]: TraceAbstraction took 253459.53 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -937.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-04 12:18:31,162 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.19 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.52 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 24.71 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 726.00 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 253459.53 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -937.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 66). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 99). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 112). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 121). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 4 error locations. TIMEOUT Result, 253.3s OverallTime, 51 OverallIterations, 4 TraceHistogramMax, 186.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3758 SDtfs, 10438 SDslu, 7427 SDs, 0 SdLazy, 52271 SolverSat, 14023 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3857 GetRequests, 1041 SyntacticMatches, 11 SemanticMatches, 2805 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 85743 ImplicationChecksByTransitivity, 74.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10011occurred in iteration=50, 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: 42.5s AutomataMinimizationTime, 51 MinimizatonAttempts, 32101 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 2108 NumberOfCodeBlocks, 2108 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 2009 ConstructedInterpolants, 32 QuantifiedInterpolants, 222893 SizeOfPredicates, 797 NumberOfNonLiveVariables, 14213 ConjunctsInSsa, 1503 ConjunctsInUnsatCore, 99 InterpolantComputations, 9 PerfectInterpolantSequences, 199/778 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_WithProcedures.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-18-31-175.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_product_WithProcedures.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-18-31-175.csv Completed graceful shutdown